Ordered Solutions for Dynamic Programs

DOI10.1287/moor.12.2.269zbMath0644.90096OpenAlexW2140424879MaRDI QIDQ3787815

William S. Lovejoy

Publication date: 1987

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

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

zbMATH Keywords

boundsbounded monotone contractionsinfinite horizon Markov decision processes

Mathematics Subject Classification ID

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

Related Items (5)

A two-state partially observable Markov decision process with three actions ⋮ Markov Teams ? An analytical approach to process migration in distributed computing systems ⋮ Control limits for two-state partially observable Markov decision processes ⋮ A Multi-Stage Two-Machines Replacement Strategy Using Mixture Models, Bayesian Inference, and Stochastic Dynamic Programming ⋮ Stochastic Comparative Statics in Markov Decision Processes

This page was built for publication: Ordered Solutions for Dynamic Programs