Approximation solution and suboptimality for discounted semi-markov decision problems with countable state space
From MaRDI portal
Publication:4820396
DOI10.1080/02331930410001720932zbMATH Open1092.90057OpenAlexW1979259161MaRDI QIDQ4820396FDOQ4820396
Authors:
Publication date: 15 October 2004
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930410001720932
Recommendations
- Discounted semi-Markov decision processes with nonnegative costs
- Performance optimization for countable semi-Markov decision processes with discounted-cost
- Finite-state approximations for denumerable state discounted Markov decision processes
- Numerical approximations for discounted continuous time Markov decision processes
- Performance optimization of semi-Markov decision processes with discounted-cost criteria
Cites Work
- Title not available (Why is that?)
- Finite-state approximations for denumerable-state infinite-horizon discounted Markov decision processes
- Average, Sensitive and Blackwell Optimal Policies in Denumerable Markov Decision Chains with Unbounded Rewards
- Contraction Mappings in the Theory Underlying Dynamic Programming
- 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
- Domain Decomposition Methods for Large Markov Chain Control Problems and Nonlinear Elliptic-Type Equations
- A method of clustering for discounted markovian decision problems
Cited In (3)
This page was built for publication: Approximation solution and suboptimality for discounted semi-markov decision problems with countable state space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820396)
