Axioms and Examples Related to Ordinal Dynamic Programming

DOI10.1287/MOOR.9.3.345MaRDI QIDQ3346111zbMATH OpenOpenAlexWikidataFDO

Authors C. E. Blair

Publication date 1984

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.9.3.345

zbMATH Keywords

deterministic sequential Markov processordinal dynamic programmingstationary policies

Mathematics Subject Classification ID

Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Recommendations

• Theory and applications of generalized dynamic programming: An overview
• Some applications of the theory of dynamic programming -- a review
• Generalizations and applications of a class of dynamic programming problems
• Dynamic programming with ordered structures: Theory, examples and applications
• Ordered Solutions for Dynamic Programs

Cited in

(5)

• An abstract topological approach to dynamic programming
• Does backwards induction imply subgame perfection?
• Discounting axioms imply risk neutrality
• Dynamic programming with ordered structures: Theory, examples and applications
• Markov-perfect equilibria in intergenerational games with consistent preferences

This page was built for publication: Axioms and Examples Related to Ordinal Dynamic Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3346111)