ON APPROXIMATE SOLUTIONS OF FINITE-STAGE DYNAMIC PROGRAMS

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

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

[3]  Evan L. Porteus.  Some Bounds for Discounted Sequential Decision Processes , 1971 .

[4]  B. Fox.  Finite-state approximations to denumerable-state dynamic programs , 1971 .

[5]  B. Fox.  Discretizing dynamic programs , 1973 .

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

[7]  Helmut Schellhaas,et al.  Zur Extrapolation in Markoffschen Entscheidungsmodellen mit Diskontierung , 1974, Z. Oper. Research.

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

[9]  Evan L. Porteus.  Bounds and Transformations for Discounted Finite Markov Decision Chains , 1975, Oper. Res..

[10]  D. Bertsekas.  Convergence of discretization procedures in dynamic programming , 1975 .

[11]  K. Hinderer.  Estimates for finite-stage dynamic programs , 1976 .

[12]  K. Hinderer,et al.  An Improvement of J. F. Shapiro’s Turnpike Theorem for the Horizon of Finite Stage Discrete Dynamic Programs , 1977 .

[13]  M. Puterman,et al.  Modified Policy Iteration Algorithms for Discounted Markov Decision Problems , 1978 .

[14]  Ward Whitt,et al.  Approximations of Dynamic Programs, I , 1978, Math. Oper. Res..

[15]  Thomas L. Morin,et al.  COMPUTATIONAL ADVANCES IN DYNAMIC PROGRAMMING , 1978 .

[16]  Martin L. Puterman,et al.  Contracting Markov Decision Processes. (Mathematical Centre Tract 71.) , 1978 .