Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-23T05:26:24.827Z Has data issue: false hasContentIssue false
  • English
  • Français

On Optimality of Bold Play for Discounted Dubins-Savage Gambling Problems with Limited Playing Times

Part of: Game theory Stochastic processes

Published online by Cambridge University Press:  14 July 2016

Yi-Ching Yao
Yi-Ching Yao*
Affiliation:
Academia Sinica and National Chengchi University
*
∗ Postal address: Institute of Statistical Science, Academia Sinica, Taipei, 115, Taiwan, R. O. C. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In the classic Dubins-Savage subfair primitive casino gambling problem, the gambler can stake any amount in his possession, winning (1 - r)/r times the stake with probability w and losing the stake with probability 1 - w, 0 ≤ w ≤ r ≤ 1. The gambler seeks to maximize the probability of reaching a fixed fortune by gambling repeatedly with suitably chosen stakes. This problem has been extended in several directions to account for limited playing time or future discounting. We propose a unifying framework that covers these extensions, and prove that bold play is optimal provided that w ≤ ½ ≤ r. We also show that this condition is in fact necessary for bold play to be optimal subject to the constraint of limited playing time.

Keywords

Gambling theoryprimitive casinored-and-blackroulettediscount factoroptimal strategy

MSC classification

Primary: 60G40: Stopping times; optimal stopping problems; gambling theory
Secondary: 91A60: Probabilistic games; gambling
Type
Research Article
Information
Journal of Applied Probability , Volume 44 , Issue 1 , March 2007 , pp. 212 - 225
Copyright
Copyright © Applied Probability Trust 2007 

References

Breiman, L. (1961). Optimal gambling systems for favorable games. In Proc. 4th Berkeley Symp. Math. Statist. Prob., Vol. 1, University of California Press, Berkeley, CA, pp. 65–78.Google Scholar
Chen, R. (1976). Subfair discounted red-and-black game with a house limit. J. Appl. Prob. 13, 608–613.CrossRefGoogle Scholar
Chen, R. (1977). Subfair primitive casino with a discount factor. Z. Wahrscheinlichkeitsth. 39, 167–174.CrossRefGoogle Scholar
Chen, R. (1978). Subfair ‘red-and-black’ in the presence of inflation. Z. Wahrscheinlichkeitsth. 42, 293–301.Google Scholar
Chen, R. and Zame, A. (1979). On discounted subfair primitive casino. Z. Wahrscheinlichkeitsth. 49, 257–266.CrossRefGoogle Scholar
Chen, R. W., Shepp, L. A. and Zame, A. (2004). A bold strategy is not always optimal in the presence of inflation. J. Appl. Prob. 41, 587–592.Google Scholar
Chen, R. W., Shepp, L. A., Yao, Y.-C. and Zhang, C.-H. (2005). On optimality of bold play for primitive casinos in the presence of inflation. J. Appl. Prob. 42, 121–137.Google Scholar
Dubins, L. E. (1968). A simpler proof of Smith's roulette theorem. Ann. Math. Statist. 39, 390–393.Google Scholar
Dubins, L. E. (1998). Discrete red-and-black with fortune-dependent win probabilities. Prob. Eng. Inf. Sci. 12, 417–424.Google Scholar
Dubins, L. E. and Savage, L. J. (1965). How to Gamble if You Must. Inequalities for Stochastic Processes. McGraw-Hill, New York.Google Scholar
Dubins, L. E. and Savage, L. J. (1976). Inequalities for Stochastic Processes. How to Gamble if You Must. Corrected republication of the 1965 edition. Dover, New York.Google Scholar
Heath, D. C. and Sudderth, W. D. (1974). Continuous-time gambling problems. Adv. Appl. Prob. 6, 651–665.Google Scholar
Heath, D. C., Pruitt, W. E. and Sudderth, W. D. (1972). Subfair red-and-black with a limit. Proc. Amer. Math. Soc. 35, 555–560.CrossRefGoogle Scholar
Klugman, S. (1977). Discounted and rapid subfair red-and-black. Ann. Statist. 5, 734–745.Google Scholar
Kulldorff, M. (1993). Optimal control of favorable games with a time limit. SIAM J. Control Optimization 31, 52–69.CrossRefGoogle Scholar
Maitra, A. P. and Sudderth, W. D. (1996). Discrete Gambling and Stochastic Games (Appl. Math. (New York) 32). Springer, New York.Google Scholar
Pestien, V. and Sudderth, W. D. (1985). Continuous-time red-and-black: how to control a diffusion to a goal. Math. Operat. Res. 10, 599–611.Google Scholar
Pestien, V. and Sudderth, W. D. (1988). Continuous-time casino problems. Math. Operat. Res. 13, 364–376.Google Scholar
Ross, S. M. (1974). Dynamic programming and gambling models. Adv. Appl. Prob. 6, 593–606.Google Scholar
Schweinsberg, J. (2005). Improving on bold play when the gambler is restricted. J. Appl. Prob. 42, 321–333.Google Scholar
Secchi, P. (1997). Two-person red-and-black stochastic games. J. Appl. Prob. 34, 107–126.Google Scholar
Smith, G. J. (1967). Optimal strategy at roulette. Z. Wahrscheinlichkeitsth. 8, 91–100.Google Scholar
Sudderth, W. D. and Weerasinghe, A. (1989). Controlling a process to a goal in finite time. Math. Operat. Res. 14, 400–409.Google Scholar
Wilkins, J. E. (1972). The bold strategy in presence of house limit. Proc. Amer. Math. Soc. 32, 567–570.Google Scholar