Approximation solution and suboptimality for discounted semi-markov decision problems with countable state space

DOI10.1080/02331930410001720932zbMath1092.90057OpenAlexW1979259161MaRDI QIDQ4820396

No author found.

Publication date: 15 October 2004

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930410001720932

zbMATH Keywords

Markov renewal programmingSemi-Markov decision problems

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Related Items

Performance analysis for controlled semi-Markov systems with application to maintenance

Cites Work

• Unnamed Item
• Finite-state approximations for denumerable-state infinite-horizon discounted Markov decision processes
• Finite-state approximations to denumerable-state dynamic programs
• A modified Gauss-Seidel-algorithm with exclusion of suboptimal actions for A class of semi-Markovian decision problems
• Average, Sensitive and Blackwell Optimal Policies in Denumerable Markov Decision Chains with Unbounded Rewards
• A method of clustering for discounted markovian decision problems
• Domain Decomposition Methods for Large Markov Chain Control Problems and Nonlinear Elliptic-Type Equations
• Contraction Mappings in the Theory Underlying Dynamic Programming