Successive approximations for convergent dynamic programming

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.

[1]  J. A. E. E. van Nunen,et al.  Contracting Markov decision processes , 1978 .

[2]  A. Hordijk.  Regenerative Markov decision models , 1976 .

[3]  J.A.E.E. van Nunen,et al.  The action elimination algorithm for Markov decision processes , 1976 .

[4]  D. Blackwell.  Discounted Dynamic Programming , 1965 .

[5]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[6]  J. Wessels.  Markov programming by successive approximations by respect to weighted supremum norms , 1976, Advances in Applied Probability.

[7]  J. Harrison.  Discrete Dynamic Programming with Unbounded Rewards , 1972 .

[8]  D. Ornstein.  On the existence of stationary optimal strategies , 1969 .

[9]  Vincent Hodgson,et al.  The Single Server Queue. , 1972 .

[10]  N. Hastings,et al.  Note---A Test for Nonoptimal Actions in Undiscounted Finite Markov Decision Chains , 1976 .

[11]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[12]  J. Wijngaard,et al.  Stationary Markovian decision problems II , 1975 .

[13]  S. Lippman.  On Dynamic Programming with Unbounded Rewards , 1975 .

[14]  Convergent Dynamic Programming. , 1974 .

[15]  Kees M. van Hee,et al.  Markov Strategies in Dynamic Programming , 1978, Math. Oper. Res..

[16]  E. Denardo.  CONTRACTION MAPPINGS IN THE THEORY UNDERLYING DYNAMIC PROGRAMMING , 1967 .

[17]  S. Lippman.  Semi-Markov Decision Processes with Unbounded Rewards , 1973 .

[18]  J. MacQueen.  A MODIFIED DYNAMIC PROGRAMMING METHOD FOR MARKOVIAN DECISION PROBLEMS , 1966 .

[19]  A. F. Veinott.  Discrete Dynamic Programming with Sensitive Discount Optimality Criteria , 1969 .

[20]  Karel Sladký,et al.  Sensitive Optimality Criteria in Countable State Dynamic Programming , 1977, Math. Oper. Res..

[21]  C. Derman,et al.  A Note on Memoryless Rules for Controlling Sequential Control Processes , 1966 .