Axioms and Examples Related to Ordinal Dynamic Programming

Published Online:https://doi.org/10.1287/moor.9.3.345

This note is intended as a continuation of Sobel's work on ordinal dynamic programming (Sobel, M. J. 1975. Ordinal dynamic programming. Management Sci.21 967–975.). We generalize several results of that paper. Also, some examples are given to clarify differences between the treatment of ordinal dynamic programming in (Sobel, M. J. 1975. Ordinal dynamic programming. Management Sci.21 967–975.) and Sobel's later treatment (Sobel, M. J. 1980. Ordinal sequential games. Econom. et SocietiesXIV 1571–1581.).

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.