A decomposition algorithm for limiting average Markov decision problems.
From MaRDI portal
Recommendations
- Algorithms for aggregated limiting average Markov decision problems
- On some algorithms for limiting average Markov decision processes
- Exact decomposition approaches for Markov decision processes: a survey
- Algorithms for singularly perturbed limiting average Markov control problems
- Hierarchical algorithms for discounted and weighted Markov decision processes
Cites work
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 3793773 (Why is no real title available?)
- A decomposition approach for undiscounted two-person zero-sum stochastic games
- Algorithms for aggregated limiting average Markov decision problems
- An improved algorithm for solving communicating average reward Markov decision processes
- Communicating MDPs: Equivalence and LP properties
- Discrete Dynamic Programming
- Finite state Markovian decision processes
- Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach
Cited in
(7)- A variable neighborhood search based algorithm for finite-horizon Markov decision processes
- A structured pattern matrix algorithm for multichain Markov decision processes
- Exact decomposition approaches for Markov decision processes: a survey
- Algorithms for aggregated limiting average Markov decision problems
- Hierarchical algorithms for discounted and weighted Markov decision processes
- On some algorithms for limiting average Markov decision processes
- scientific article; zbMATH DE number 3934809 (Why is no real title available?)
This page was built for publication: A decomposition algorithm for limiting average Markov decision problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1412714)
