Geometric Convergence of Algorithms in Gambling Theory

References

• Dekker R. , Hordijk A. , Spieksma F. M. On the relation between recurrence and ergodicity properties in denumerable Markov decision chains. Math. Oper. Res. (1994) 19 539 559 Link, Google Scholar
• Dubins L. , Maitra A. , Purves R. , Sudderth W. Measurable, nonleavable gambling problems. Israel J. Math. (1989) 67 257 271 Crossref, Google Scholar
• (DS) Dubins Lester E. , Savage Leonard J. How to Gamble If You Must: Inequalities for Stochastic Processes (1965) (McGraw-Hill, New York) Google Scholar
• Durrett Richard . Probability: Theory and Examples (1991) (Wadsworth and Brooks/Cole, Pacific Grove, California) Google Scholar
• Freedman David . Markov Chains (1971) (Holden-Day, San Francisco) Google Scholar
• (MS) Maitra Ashok P. , Sudderth William D. Discrete Gambling and Stochastic Games (1996) (Springer, New York) Crossref, Google Scholar
• Schweitzer Paul J. , Federgruen A. Geometric convergence of value iteration in multichain Markov decision problems. Adv. Appl. Probab. (1979) 11 187 217 Crossref, Google Scholar
• van Dawen Rolf . Negative dynamic programming. Institut f. Angewante Math., Univ. Bonn. (1985) . Preprint 758 Google Scholar
• Whittle P. A simple condition for regularity in negative dynamic programming. J. Appl. Probab. (1979) 16 305 318 Crossref, Google Scholar