×

zbMATH — the first resource for mathematics

Bounds on discrete dynamic programming recursions. II: Polynomial bounds on problems with block-triangular structure. (English) Zbl 0466.90084

MSC:
90C39 Dynamic programming
90C40 Markov and semi-Markov decision processes
PDF BibTeX XML Cite
Full Text: EuDML
References:
[1] R. Bellman: A Markovian decision process. J. Math. Mech. 6 (1957), 679 - 684. · Zbl 0078.34101
[2] D. Blackwell: Discrete dynamic programming. Ann. Math. Statist. 33 (1962), 2, 719-726. · Zbl 0133.12906
[3] B. G. Brown: On the iterative methods of dynamic programming in a finite space discrete time Markov processes. Ann. Math. Statist. 36 (1965), 4, 1279-1285. · Zbl 0136.14107
[4] R. A. Howard: Dynamic Programming and Markov Processes. M.I.T. and Wiley Press, New York 1960. · Zbl 0091.16001
[5] P. Mandl: Controlled Markov chains. (in Czech). Kybernetika 6 (1969), Supplement, 1-74.
[6] K. Sladký: On the set of optimal controls for Markov chains with rewards. Kybernetika 10 (1974), 4, 350-367.
[7] K. Sladký: Bounds on discrete dynamic programming recursions I - Models with non-negative matrices. Kybernetika 16 (1980), 6, 526 - 547. · Zbl 0454.90085
[8] K. Sladký: On the existence of stationary optimal policies in discrete dynamic programming. Submitted to Kybernetika.
[9] K. Sladký: On Functional Equations of Discrete Dynamic Programming with Non-Negative Matrices. Research Report No. 900, Institute of Information Theory and Automation, Prague 1978.
[10] K. Sladký: On functional equations of discrete dynamic programming. In preparation. · Zbl 0900.90390
[11] A. F. Veinott, Jr.: On finding optimal policies in discrete dynamic programming with no discounting. Ann. Math. Statist. 57(1966), 5, 1284-1294. · Zbl 0149.16301
[12] A. F. Veinott, Jr.: Discrete dynamic programming with sensitive discount optimality criteria. Ann. Math. Statist. 40 (1969), 5, 1635-1660. · Zbl 0183.49102
[13] W. H. M. Zijms: Generalized Eigenvectors and Sets of Nonnegative Matrices. Memorandum Cosor 80 - 03, Eindhoven University of Technology, Eindhoven 1980.
[14] W. H. M. Zijms: Maximizing the Growth of the Utility Vector in a Dynamic Programming Model. Memorandum Cosor 80 - 04, Eindhoven University of Technology, Eindhoven 1980.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.