A set of successive approximation methods for discounted Markovian decision problems
From MaRDI portal
Publication:4133441
Cites work
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 3333895 (Why is no real title available?)
- A modified dynamic programming method for Markovian decision problems
- Contraction Mappings in the Theory Underlying Dynamic Programming
- Discounted Dynamic Programming
- Discounted semi-Markov decision processes: linear programming and policy iteration
- Discrete Dynamic Programming
- Letter to the Editor—A Test for Suboptimal Actions in Markovian Decision Problems
- Linear Programming Solutions for Separable Markovian Decision Problems
- Some Bounds for Discounted Sequential Decision Processes
- Technical Note—Elimination of Suboptimal Actions in Markov Decision Problems
Cited in
Lua error in Module:BacklinksList at line 33: bad argument #1 to 'getSitelink' (string expected, got nil).
This page was built for publication: A set of successive approximation methods for discounted Markovian decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133441)
