On the chance to visit a goal set infinitely often

References

• Bellman , R. 1957 . Dynamic Programming , Princeton : Princeton Univ. Press .
   Google Scholar
• Bierth , K.J. 1987 . An expected average reward criterion . Stochastic Processes Appl , 26 : 23 – 140 .
   Google Scholar
• Blackwell , D. 1962 . Discrete dynamie programming . Ann. Math. Statist , 33 : 719 – 726 .
   Google Scholar
• Blackwell , D. 1965 . Discounted dynamie Programming . Ann. Math. Statist , 36 : 226 – 235 .
   Google Scholar
• Chitashvili , R.Ya . 1976 . A finite controlled MARKOV chain with small termination probability . SIAM Theory Prob. Appl , 21 : 158 – 163 .
   Google Scholar
• Chow , Y.S. , Robbins , H. and Siegmund , D. 1971 . Great Expectations:The Theory of Opti-mal Stopping , Boston : Houghton-Mifflin .
   Google Scholar
• Demko , S. and Hill , T. 1984 . On maximizing the average time at a goal . Stochastic Processes Appl , 17 : 349 – 357 .
   Google Scholar
• Deppe , H. 1985 . Continuity of mean recurrence times in denumerable semi-MARKOV processes . Z. Wahrscheinlichkeitstheorie verw. Geb , 69 : 581 – 592 .
   Google Scholar
• Derman , C. 1970 . Finite State Markovian Decision Processes , New York : Academic Press . London
   Google Scholar
• Dubins , L.E. and Savage , L.J. 1965 . How to gamble if you must , New York : Mc Graw-Hill .
   Google Scholar
• Dubins , L.E. and Sudderth , W.D. 1977 . Countably additive gambling and optimal stopping . Z. Wahrscheinlichkeitstheorie verw. Geb , 41 : 59 – 72 .
   Google Scholar
• Dynkin , E.B. 1965 . Controlled random sequences . SIAM Theory Prob. Appl , 10 : 1 – 14 .
   Google Scholar
• Dynkin , E.B. and Yushkevich , A.A. 1979 . Controlled MARKOV Processes , Berlin : Springer . Heidelberg - New York
   Google Scholar
• Howard , R.A. 1960 . Dynamic programming and MARKOV processes , New York : Technology Press and Wiley .
   Google Scholar
• Schäl , M. 1985 . “ Optimal stopping and leavable gambling models with the average return criterion ” . In Contributions to Operations Research Edited by: Neumann , K. and Pallaschke , D. Vol. 240 , 174 – 181 . Springer Lect. Notes in Economics and Math. Syst
   Google Scholar
• Schäl , M. 1986 . “ MARKOV and semi-MARKOV decision models and optimal stopping ” . In Semi-MARKOV Models Edited by: Janssen Press , J. 39 – 62 . New York London
   Google Scholar
• Schäl , M. 1986 . “ Optimal stopping and leavable gambling models with observation cost ” . In Optimization, Parallel Processing and Applications Edited by: Kurzhanski , A. , Neumann , K. and Pallaschke , D. Vol. 304 , 49 – 56 . Springer Lect. Notes in Econ. and Math. Syst
   Google Scholar
• Schäl , M. 1989 . “ On stochastic dynamic programming:A bridge between MARKOV decision processes and gambling ” . In Markov Processes and Control Theory. Math. Res , Edited by: Langer , H. and Nollau , V. Vol. 54 , 178 – 216 . Berlin : Akad. Verl .
   Google Scholar
• Schweitzer , P.J. 1968 . Perturbation theory and finite MARKOV chains . J. Appl Prob , 5 : 401 – 413 .
   Web of Science ®Google Scholar
• Sirjaev , A.N. 1970 . Some new results in the theory of controlled random proeeses . Selected Translations in Math. Statistics and Prob , 8 : 49 – 130 .
   Google Scholar
• Snell , J.L. 1952 . Application of martingale system theorems . Trans. Amer. Math. Soc , 73 : 293 – 312 .
   Web of Science ®Google Scholar
• Sudderth , W.D. 1971 . A gambling theorem and optimal stopping theory . Ann. Math. Statist , 42 : 1697 – 1705 .
   Google Scholar
• Sudderth , W.D. 1971 . A “FATOU equation” for randomly stopped variables . Ann. Math. Statist , 42 : 2143 – 2146 .
   Google Scholar