Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-14T03:24:25.177Z Has data issue: false hasContentIssue false
  • English
  • Français

Strong Optimality of Bold Play for Discounted Dubins-Savage Gambling Problems with Time-Dependent Parameters

Part of: Stochastic processes Game theory

Published online by Cambridge University Press:  14 July 2016

Yi-Ching Yao  and
May-Ru Chen
Yi-Ching Yao*
Affiliation:
Academia Sinica and National Chengchi University
May-Ru Chen*
Affiliation:
Academia Sinica
*
∗Postal address: Institute of Statistical Science, Academia Sinica, Taipei 115, Taiwan, R.O.C.
∗Postal address: Institute of Statistical Science, Academia Sinica, Taipei 115, Taiwan, R.O.C.
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 (the goal) by gambling repeatedly with suitably chosen stakes. This problem has recently been extended in a unifying framework to account for limited playing time as well as future discounting, under which bold play is known to be optimal provided that w ≤ ½ ≤ r. This paper is concerned with a further extension of the Dubins-Savage gambling problem involving time-dependent parameters, and shows that bold play not only maximizes the probability of reaching the goal, but also stochastically minimizes the number of plays needed to reach the goal. As a result, bold play also maximizes the expected utility, where the utility at the goal is only required to be monotone decreasing with respect to the number of plays needed to reach the goal. It is further noted that bold play remains optimal even when the time-dependent parameters are random.

Keywords

Gambling theoryprimitive casinodiscount factoroptimal strategy

MSC classification

Secondary: 60G40: Stopping times; optimal stopping problems; gambling theory 91A60: Probabilistic games; gambling
Type
Research Article
Information
Journal of Applied Probability , Volume 45 , Issue 2 , June 2008 , pp. 403 - 416
Copyright
Copyright © Applied Probability Trust 2008 

References

[1] Chen, M.-R. and Hsiau, S.-R. (2006). Two-person red-and-black games with bet-dependent win probability functions. J. Appl. Prob. 43, 905–915.Google Scholar
[2] Chen, R. (1978). Subfair ‘red-and-black’ in the presence of inflation. Z. Wahrscheinlichkeitsth. 42, 293–301.CrossRefGoogle Scholar
[3] Chen, R. and Zame, A. (1979). On discounted subfair primitive casino. Z. Wahrscheinlichkeitsth. 49, 257–266.Google Scholar
[4] Chen, R., 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
[5] Dubins, L. E. and Savage, L. J. (1976). Inequalities for Stochastic Processes (How to Gamble if You Must). Dover, New York.Google Scholar
[6] Grigorescu, I., Chen, R. and Shepp, L. (2007). Optimal strategy for the Vardi casino with interest payments. J. Appl. Prob. 44, 199–211.Google Scholar
[7] Klugman, S. (1977). Discounted and rapid subfair red-and-black. Ann. Statist. 5, 734–745.Google Scholar
[8] Maitra, A. P. and Sudderth, W. D. (1996). Discrete Gambling and Stochastic Games (Appl. Math. New York 32). Springer, New York.Google Scholar
[9] Pontiggia, L. (2005). Two-person red-and-black with bet-dependent win probability. Adv. Appl. Prob. 37, 75–89.Google Scholar
[10] Pontiggia, L. (2007). Nonconstant sum red-and-black games with bet-dependent win probability function. J. Appl. Prob. 44, 547–553.Google Scholar
[11] Schweinsberg, J. (2005). Improving on bold play when the gambler is restricted. J. Appl. Prob. 42, 321–333.CrossRefGoogle Scholar
[12] Shaked, M and Shanthikumar, J. G. (2007). Stochastic Orders. Springer, New York.Google Scholar
[13] Shepp, L. A. (2006). Bold play and the optimal policy for Vardi's casino. In Random Walk, Sequential Analysis and Related Topics, eds Hsiung, A. C. et al., World Scientific, Singapore, pp. 150–156.Google Scholar
[14] Sudderth, W. D. and Weerasinghe, A. (1989). Controlling a process to a goal in finite time. Math. Operat. Res. 14, 400–409.Google Scholar
[15] Yao, Y.-C. (2007). On optimality of bold play for discounted Dubins–Savage gambling problems with limited playing times. J. Appl. Prob. 44, 212–225.Google Scholar
[16] Yao, Y.-C. (2007). Explicit optimal strategy for the Vardi casino with limited playing time. J. Appl. Prob. 44, 831–837.Google Scholar