Ordinal Dynamic Programming
From MaRDI portal
Publication:4077689
DOI10.1287/mnsc.21.9.967zbMath0316.90002OpenAlexW2022783922MaRDI QIDQ4077689
Publication date: 1975
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.21.9.967
Related Items
Does backwards induction imply subgame perfection? ⋮ The shortest path problem with two objective functions ⋮ Discrete dynamic programming with outcomes in random variable structures ⋮ Theory and applications of generalized dynamic programming: An overview ⋮ Interactive procedure for a multiobjective stochastic discrete dynamic problem ⋮ Discounting axioms imply risk neutrality ⋮ A general decomposition approach for multi-criteria decision trees ⋮ Some comments on preference order dynamic programming models ⋮ Decomposition methods in multiobjective discrete-time dynamic problems ⋮ An abstract topological approach to dynamic programming ⋮ Markov-perfect equilibria in intergenerational games with consistent preferences ⋮ Multiple objectives and non-separability in stochastic dynamic programming ⋮ Decomposition of multiple criteria mathematical programming problems by dynamic programming ⋮ Dynamic programming and principles of optimality ⋮ Mean, variance and probabilistic criteria in finite Markov decision processes: A review ⋮ Monotonicity and the principle of optimality ⋮ Percentiles and Markovian decision processes ⋮ Finite state Markov decision models with average reward criteria
