Time aggregated Markov decision processes via standard dynamic programming

DOI10.1016/j.orl.2011.03.006zbMath1219.90181OpenAlexW2041621488MaRDI QIDQ635510

Edilson F. Arruda, Marcelo Dutra Fragoso

Publication date: 19 August 2011

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.03.006

zbMATH Keywords

dynamic programmingMarkov decision processestime aggregation

Mathematics Subject Classification ID

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

Related Items

Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm ⋮ Revenue management for operations with urgent orders ⋮ A multi-cluster time aggregation approach for Markov chains ⋮ A unified approach to time-aggregated Markov decision processes

Cites Work

• Joint replacement in an operational planning phase
• A time aggregation approach to Markov decision processes
• Exact finite approximations of average-cost countable Markov decision processes
• Sufficient Classes of Strategies in Discrete Dynamic Programming I: Decomposition of Randomized Strategies and Embedded Models
• Markov decision Processes with fractional costs
• Incremental Value Iteration for Time-Aggregated Markov-Decision Processes
• Unnamed Item
• Unnamed Item