The numerical exploitation of periodicity in Markov decision processes

DOI10.1007/BF01720020zbMath0526.90095OpenAlexW1990667931MaRDI QIDQ594776

Sumit K. Garg

Publication date: 1983

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01720020

zbMATH Keywords

periodicitysuccessive approximationssharp boundsdiscounted and undiscounted periodic Markov decision processes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Markov and semi-Markov decision processes (90C40)

Related Items

On efficiency of linear programming applied to discounted Markovian decision problems, On using discrete random models within decision support systems, Aggregation and disaggregation in Markov decision models for inventory control

Cites Work

• Unnamed Item
• The method of value oriented successive approximations for the average reward Markov decision process
• Iterative solution of the functional equations of undiscounted Markov renewal programming
• On iterative optimization ol structured Markov decision processes with discounted rewards
• Successive approximations for Markov decision processes and Markov games with unbounded rewards
• Bounds and Transformations for Discounted Finite Markov Decision Chains
• A set of successive approximation methods for discounted Markovian decision problems
• Technical Note—Improved Conditions for Convergence in Undiscounted Markov Renewal Programming
• A method of bisection for discounted Markov decision problems
• Generalization of White's Method of Successive Approximations to Periodic Markovian Decision Processes