Some basic concepts of numerical treatment of Markov decision models
From MaRDI portal
Publication:3743147
DOI10.1080/02331888608801921zbMath0605.90130OpenAlexW2092660739MaRDI QIDQ3743147
Publication date: 1986
Published in: Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331888608801921
Numerical mathematical programming methods (65K05) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified form of the iterative method of dynamic programming
- Estimates for finite-stage dynamic programs
- A successive approximation algorithm for an undiscounted Markov decision process
- Dynamic programming, Markov chains, and the method of successive approximations
- A modified dynamic programming method for Markovian decision problems
- Finite-state approximations to denumerable-state dynamic programs
- Linear Programming and Sequential Decisions
- On Sequential Decisions and Markov Chains
- Convergence of discretization procedures in dynamic programming
- A decision exclusion algorithm for a class of Markovian Decision Processes
- Note—A Test for Nonoptimal Actions in Undiscounted Finite Markov Decision Chains
- On the Fixed Points of the Optimal Reward Operator in Stochastic Dynamic Programming with Discount Factor Greater than One
- Approximations of Dynamic Programs, I
- A method of bisection for discounted Markov decision problems
- Discrete Dynamic Programming
- Discounted Dynamic Programming
- Negative Dynamic Programming
- On the Opimality of $( {s,S} )$ Inventory Policies: New Conditions and a New Proof
- On Finding the Maximal Gain for Markov Decision Processes
- Multichain Markov Renewal Programs
- Technical Note—Bounds on the Gain of a Markov Decision Process
- Some Bounds for Discounted Sequential Decision Processes
- Solution of a Markovian decision problem by successive overrelaxation
- Multiple Policy Improvements in Undiscounted Markov Renewal Programming
This page was built for publication: Some basic concepts of numerical treatment of Markov decision models
