Browse > Article

The Optimum Strategy for Favorable Situation in Discrete Red ＆ Black  

석영우 (세종대학교 응용수학과)
안철환 (세종대학교 경영학부)
Publication Information
Journal of the military operations research society of Korea / v.30, no.1, 2004 , pp. 70-80 More about this Journal
Abstract
In discrete red and black, you can stake any amount s in your possession, but the value of s takes positive integer value. Suppose your goal is N and your current fortune is f, with 0＜f＜N. You win back your stake and as much more with probability p and lose your stake with probability, q = 1-p. In this study, we consider optimum strategies for this game with the value of p greater than $\frac{1}{2}$ where the player has the advantage over the house. The optimum strategy at any f when p>$\frac{1}{2}$ is to play timidly, which is to bet 1 all the time. This is called as Timid1 strategy. In this paper, we perform the simulation study to show that the Timid1 strategy is optimum in discrete red and black when p＞\frac{1}{2}.
Keywords
Ruin problem; convex function; simulation;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Dubins and Savage (1965). How to gamble if you must, Mcgraw-Hill, New York
2 Karlin, S. and Taylor, H. (1975). A first course in stochastic processes, The 2nd Ed., Academic Press
3 Ahn and Sok (2002). Optimum Strategies for Unfavorable Situation in Red and Black, The Korean Communications in Statistics, Vol 9, No 3. :2002, pp. 683-691   DOI
4 Loeve, M. (1977). Probability Theory I. Springer-Verlag, New York
5 Parzen, E. (1962). Stochastic processes, Holden-Day
6 Coolidge, J. L. (1908 - 1909). The gambler's ruin, Annals of Mathematics 10, 181-192   DOI