scientific article; zbMATH DE number 3670172
discounted Markov decision processesfinite action spacefinite dynamic programmingfinite Markov decision processesfinite state spaceinfinite horizon equationlinear programmingMarkov renewal programmingpolicy iterationpolicy-space algorithmssequential decision processesundiscounted Markov decision processesvalue iteration
Markov renewal processes, semi-Markov processes (60K15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Minimax problems in mathematical programming (90C47)
- Approximating Markov decision processes using expected state transitions
- Linear programming formulations of Markov decision processes
- Monotone value iteration for discounted finite Markov decision processes
- Discount-isotone policies for Markov decision processes
- Repair limit replacement
- Multi-objective infinite-horizon discounted Markov decision processes
- Revised simplex algorithm for finite Markov decision processes
- Infinite horizon Markov decision processes with unknown or variable discount factors
- Stochastic revision opportunities in Markov decision problems
- Shortest and longest path problems
- Markov: A methodology for the solution of infinite time horizon markov decision processes
- Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
- Solving infinite horizon discounted Markov decision process problems for a range of discount factors
- Markov decision processes
- On Markov policies for minimax decision processes
- Isotone policies for the value iteration method for Markov decision processes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3867541)
