On nonoptimality of bold play for subfair red-and-black with a rational-valued house limit

May Ru Chen, Shoou Ren Hsiau, Pei Shou Chung, Y. A.O. Yi-Ching

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In the subfair red-and-black gambling problem, a gambler can stake any amount in his possession, winning an amount equal to the stake with probability w and losing the stake with probability 1 - w, where 0 < w < 1/2. The gambler seeks to maximize the probability of reaching a fixed fortune (to be normalized to unity) by gambling repeatedly with suitably chosen stakes. In their classic work, Dubins and Savage (1965), (1976) showed that it is optimal to play boldly. When there is a house limit of ℓ (0 ℓ t < 1/2), so that the gambler can stake no more than &ill, Wilkins (1972) showed that bold play remains optimal provided that 1/ℓ is an integer. On the other hand, building on an earlier surprising result of Heath, Pruitt and Sudderth (1972), Schweinsberg (2005) recently showed that, for all irrational 0 < ℓ < 1/2 and all 0 < w < 1/2, bold play is not optimal for some initial fortune. The purpose of the present paper is to present several results supporting the conjecture that, for all rational ℓ with 1/ℓ not an integer and all 0 < w < 1/2, bold play is not optimal for some initial fortune. While most of these results are based on Schweinsberg's method, in a special case where his method is shown to be inapplicable, we argue that the conjecture can be verified with the help of symbolic-computation software.

Original languageEnglish
Pages (from-to)1024-1038
Number of pages15
JournalJournal of Applied Probability
Volume45
Issue number4
DOIs
Publication statusPublished - 2008 Dec 1

Fingerprint

Gambling
Integer
Symbolic Computation
Maximise
Software

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Mathematics(all)
  • Statistics, Probability and Uncertainty

Cite this

Chen, May Ru ; Hsiau, Shoou Ren ; Chung, Pei Shou ; Yi-Ching, Y. A.O. / On nonoptimality of bold play for subfair red-and-black with a rational-valued house limit. In: Journal of Applied Probability. 2008 ; Vol. 45, No. 4. pp. 1024-1038.
@article{a60230e04fb748268fd5492eceb4af90,
title = "On nonoptimality of bold play for subfair red-and-black with a rational-valued house limit",
abstract = "In the subfair red-and-black gambling problem, a gambler can stake any amount in his possession, winning an amount equal to the stake with probability w and losing the stake with probability 1 - w, where 0 < w < 1/2. The gambler seeks to maximize the probability of reaching a fixed fortune (to be normalized to unity) by gambling repeatedly with suitably chosen stakes. In their classic work, Dubins and Savage (1965), (1976) showed that it is optimal to play boldly. When there is a house limit of ℓ (0 ℓ t < 1/2), so that the gambler can stake no more than &ill, Wilkins (1972) showed that bold play remains optimal provided that 1/ℓ is an integer. On the other hand, building on an earlier surprising result of Heath, Pruitt and Sudderth (1972), Schweinsberg (2005) recently showed that, for all irrational 0 < ℓ < 1/2 and all 0 < w < 1/2, bold play is not optimal for some initial fortune. The purpose of the present paper is to present several results supporting the conjecture that, for all rational ℓ with 1/ℓ not an integer and all 0 < w < 1/2, bold play is not optimal for some initial fortune. While most of these results are based on Schweinsberg's method, in a special case where his method is shown to be inapplicable, we argue that the conjecture can be verified with the help of symbolic-computation software.",
author = "Chen, {May Ru} and Hsiau, {Shoou Ren} and Chung, {Pei Shou} and Yi-Ching, {Y. A.O.}",
year = "2008",
month = "12",
day = "1",
doi = "10.1239/jap/1231340231",
language = "English",
volume = "45",
pages = "1024--1038",
journal = "Journal of Applied Probability",
issn = "0021-9002",
publisher = "University of Sheffield",
number = "4",

}

On nonoptimality of bold play for subfair red-and-black with a rational-valued house limit. / Chen, May Ru; Hsiau, Shoou Ren; Chung, Pei Shou; Yi-Ching, Y. A.O.

In: Journal of Applied Probability, Vol. 45, No. 4, 01.12.2008, p. 1024-1038.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On nonoptimality of bold play for subfair red-and-black with a rational-valued house limit

AU - Chen, May Ru

AU - Hsiau, Shoou Ren

AU - Chung, Pei Shou

AU - Yi-Ching, Y. A.O.

PY - 2008/12/1

Y1 - 2008/12/1

N2 - In the subfair red-and-black gambling problem, a gambler can stake any amount in his possession, winning an amount equal to the stake with probability w and losing the stake with probability 1 - w, where 0 < w < 1/2. The gambler seeks to maximize the probability of reaching a fixed fortune (to be normalized to unity) by gambling repeatedly with suitably chosen stakes. In their classic work, Dubins and Savage (1965), (1976) showed that it is optimal to play boldly. When there is a house limit of ℓ (0 ℓ t < 1/2), so that the gambler can stake no more than &ill, Wilkins (1972) showed that bold play remains optimal provided that 1/ℓ is an integer. On the other hand, building on an earlier surprising result of Heath, Pruitt and Sudderth (1972), Schweinsberg (2005) recently showed that, for all irrational 0 < ℓ < 1/2 and all 0 < w < 1/2, bold play is not optimal for some initial fortune. The purpose of the present paper is to present several results supporting the conjecture that, for all rational ℓ with 1/ℓ not an integer and all 0 < w < 1/2, bold play is not optimal for some initial fortune. While most of these results are based on Schweinsberg's method, in a special case where his method is shown to be inapplicable, we argue that the conjecture can be verified with the help of symbolic-computation software.

AB - In the subfair red-and-black gambling problem, a gambler can stake any amount in his possession, winning an amount equal to the stake with probability w and losing the stake with probability 1 - w, where 0 < w < 1/2. The gambler seeks to maximize the probability of reaching a fixed fortune (to be normalized to unity) by gambling repeatedly with suitably chosen stakes. In their classic work, Dubins and Savage (1965), (1976) showed that it is optimal to play boldly. When there is a house limit of ℓ (0 ℓ t < 1/2), so that the gambler can stake no more than &ill, Wilkins (1972) showed that bold play remains optimal provided that 1/ℓ is an integer. On the other hand, building on an earlier surprising result of Heath, Pruitt and Sudderth (1972), Schweinsberg (2005) recently showed that, for all irrational 0 < ℓ < 1/2 and all 0 < w < 1/2, bold play is not optimal for some initial fortune. The purpose of the present paper is to present several results supporting the conjecture that, for all rational ℓ with 1/ℓ not an integer and all 0 < w < 1/2, bold play is not optimal for some initial fortune. While most of these results are based on Schweinsberg's method, in a special case where his method is shown to be inapplicable, we argue that the conjecture can be verified with the help of symbolic-computation software.

UR - http://www.scopus.com/inward/record.url?scp=58449090324&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58449090324&partnerID=8YFLogxK

U2 - 10.1239/jap/1231340231

DO - 10.1239/jap/1231340231

M3 - Article

AN - SCOPUS:58449090324

VL - 45

SP - 1024

EP - 1038

JO - Journal of Applied Probability

JF - Journal of Applied Probability

SN - 0021-9002

IS - 4

ER -