A note on policy algorithms for discounted Markov decision problems
From MaRDI portal
Recommendations
- Adaptive policy-iteration and policy-value-iteration for discounted Markov decision processes
- Complexity bounds for approximately solving discounted MDPs by value iterations
- Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming
- The value iteration algorithm is not strongly polynomial for discounted dynamic programming
- A polynomial time bound for Howard's policy improvement algorithm
Cites work
Cited in
(12)- Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming
- An empirical study of policy convergence in Markov decision process value iteration
- A note on optimization formulations of Markov decision processes
- Policy set iteration for Markov decision processes
- Markov control processes with randomized discounted cost
- Solving H-horizon, stationary Markov decision problems in time proportional to log (H)
- Estimate and approximate policy iteration algorithm for discounted Markov decision models with bounded costs and Borel spaces
- Undiscounted Markov decision chains with partial information; an algorithm for computing a locally optimal periodic policy
- A New Policy Evaluation Algorithm for Markov Decision Processes with Quasi Birth-Death Structure
- Ranking policies in discrete Markov decision processes
- A unified approach to Markov decision problems and performance sensitivity analysis with discounted and average criteria: multichain cases
- On ordinal comparison of policies in Markov reward processes
This page was built for publication: A note on policy algorithms for discounted Markov decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969768)
