Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-26T19:55:16.231Z Has data issue: false hasContentIssue false
  • English
  • Français

Discrete Red-and-Black with Fortune-Dependent Win Probabilities

Published online by Cambridge University Press:  27 July 2009

Lester E. Dubins
Lester E. Dubins
Affiliation:
Department of Statistics, University of California, Berkeley, Berkeley, CA 94720
Get access Rights & Permissions [Opens in a new window]

Abstract

For discrete versions of red-and-black with a goal, for timid play to be optimal, it suffices, but is not necessary, that no win probability be less than one-half. A condition that is both necessary and sufficient is provided.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 12 , Issue 4 , October 1998 , pp. 417 - 424
Copyright
Copyright © Cambridge University Press 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Dubins, L.E. (1996). The gambler's ruin problem for periodic walks. In Ferguson, T.S. et al. (eds.), Statistics, probability and game theory; Papers in honor of David Blackwell, Lecture Notes-Monograph Series. Hayward, CA: Institute of Mathematical Statistics, pp. 7–12.CrossRefGoogle Scholar
2.Dubins, L.E. & Savage, L.J. (1976). Inequalities for stochastic processes. New York: Dover. First edition (1965), How to gamble if you must. New York: McGraw-Hill.Google Scholar
3.Harris, T.E. (1952). First passage and recurrence distributions. Transactions of the A.M.S. 73: 471–486.CrossRefGoogle Scholar
4.Maitra, A. & Sudderth, W. (1996). Discrete gambling and stochastic games. New York: Springer.CrossRefGoogle Scholar
5.Ross, S. (1974). Dynamic programming and gambling models. Advances in Applied Probability 6: 593–606.CrossRefGoogle Scholar