Finitely Additive Dynamic Programming

References

• Bertsekas DP, Shreve SE (1978) Stochastic Optimal Control: The Discrete Time Case (Academic Press, New York).Google Scholar
• Bhaskara Rao KPS, Bhaskara Rao M (1983) Theory of Charges: A Study of Finitely Additive Measures (Academic Press, New York).Google Scholar
• Blackwell D (1962) Discrete dynamic programming. Ann. Math. Statist. 33:719–726.Crossref, Google Scholar
• Blackwell D (1965) Discounted dynamic programming. Ann. Math. Statist. 36:226–235.Crossref, Google Scholar
• Blackwell D (1967) Positive dynamic programming. Lecam L, Neyman J, eds. Proc. Fifth Berkeley Symp. Math. Stat. Prob. (University of California Press, Oakland, CA), 415–418.Google Scholar
• Blackwell D, Freedman D, Orkin M (1974) The optimal reward operator in dynamic programming. Ann. Prob. 2:926–941.Crossref, Google Scholar
• Blackwell D, Ramakrishnan S (1988) Stationary plans need not be uniformly adequate for leavable, Borel gambling problems. Proc. Amer. Math. Soc. 102:1024–1027.Crossref, Google Scholar
• Dubins LE (1974) On Lebesgue-like extensions of finitely additive measures. Ann. Probab. 2:226–241.Google Scholar
• Dubins L, Maitra A, Purves R, Sudderth W (1989) Measurable, nonleavable, gambling problems. Israel J. Math. 67:257–271.Crossref, Google Scholar
• Dubins LE, Savage LJ (1965) How to Gamble if You Must: Inequalities for Stochastic Processes (McGraw-Hill, New York) (First Dover edition in 1976, second Dover edition in 2014).Google Scholar
• Dubins LE, Sudderth WD (1975) An example in which stationary strategies are inadequate. Ann. Probab. 3:722–725.Crossref, Google Scholar
• Dubins LE, Sudderth WD (1977) Persistently ɛ-optimal strategies. Math. Oper. Res. 2(2):125–134.Link, Google Scholar
• Dunford N, Schwartz J (1957) Linear Operators, Part 1 (Interscience Publishers, New York).Google Scholar
• Feinberg EA (1996) On measurability and representation of strategic measures in Markov decision processes. Ferguson TS, Shapley LS, MacQueen JB, eds. Statistics, Probability, and Game Theory Papers in Honor of David Blackwell, IMS Lecture Notes—Monograph Series, Vol. 30, 29–43.Crossref, Google Scholar
• Feinberg EA (2002) Total reward criteria. Feinberg EA, Shwartz A, eds. Handbook of Markov Decision Processes (Kluwer, Boston), 173–207.Crossref, Google Scholar
• Fudenberg D, Levine D (1983) Subgame-perfect equlibria of finite and infinite-horizon games. J. Econ. Theory 31:251–268.Crossref, Google Scholar
• Jaśkiewicz A, Matkowski D, Nowak AS (2013) Persistently optimal policies in stochastic dynamic programming with generalized discounting. Math. Oper. Res. 38(1):108–121.Link, Google Scholar
• Karatzas I, Sudderth W (2010) Two characterizations of optimality in dynamic programming. Appl. Math. Optim. 61:421–434.Crossref, Google Scholar
• Kertz RP, Nachman DC (1979) Persistently optimal plans for nonstationary dynamic programming: The topology of weak convergence case. Ann. Prob. 7:811–826.Crossref, Google Scholar
• Maitra A, Sudderth W (1992) The optimal reward operator in negative dynamic programming. Math. Oper. Res. 17(4):921–931.Link, Google Scholar
• Maitra A, Sudderth W (1993) Finitely additive and measurable stochastic games. Int. J. Game Theory 22:201–223.Crossref, Google Scholar
• Maitra A, Sudderth W (1996) Discrete Gambling and Stochastic Games (Springer, New York).Crossref, Google Scholar
• Maitra A, Sudderth W (1998) Finitely additive stochastic games with Borel measurable payoffs. Int. J. Game Theory 27:257–267.Crossref, Google Scholar
• Ornstein D (1969) On the existence of stationary optimal strategies. Proc. Amer. Math. Soc. 20:563–569.Crossref, Google Scholar
• Parthasarathy KR (1967) Probability Measures on Metric Spaces (Academic Press, New York).Crossref, Google Scholar
• Purves R, Sudderth W (1976) Some finitely additive probability. Ann. Probab. 4:259–276.Crossref, Google Scholar
• Purves R, Sudderth W (2010) Big vee: The story of a function, an algorithm, and three mathematical worlds. Sankhyā 72-A:37–63.Crossref, Google Scholar
• Puterman ML (1994) Markov Decision Processes: Discrete Stochastic Dynamic Programming (John Wiley & Sons, New York).Crossref, Google Scholar
• Renault J (2011) Uniform value in dynamic programming. J. Eur. Math. Soc. 13:309–330.Crossref, Google Scholar
• Rieder U (1976) On optimal policies and martingales in dynamic programming. Appl. Math. Optim. 61:421–434.Google Scholar
• Ross SM (1983) Introduction to Stochastic Dynamic Programming (Academic Press, New York).Google Scholar
• Strauch RE (1966) Negative dynamic programming. Ann. Math. Statist. 37:871–890.Crossref, Google Scholar
• Strauch RE (1967) Measurable gambling houses. Trans. Amer. Math. Soc. 126:64–72.Crossref, Google Scholar