Algorithms for Countable State Markov Decision Models with an Absorbing Set
From MaRDI portal
Publication:5317111
DOI10.1137/S0363012902411027zbMath1097.90067MaRDI QIDQ5317111
Karl Hinderer, Karl-Heinz Waldmann
Publication date: 15 September 2005
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Markov decision processesabsorbing setsextrapolation methodsexpected total reward criterionPerron--Frobenius theorytransient Markov decision processes
Approximation methods and heuristics in mathematical programming (90C59) Markov and semi-Markov decision processes (90C40)
Related Items (11)
Stability Estimation of Transient Markov Decision Processes ⋮ On undiscounted semi-Markov decision processes with absorbing states ⋮ First passage problems for nonstationary discrete-time stochastic control systems ⋮ Turnpikes in Finite Markov Decision Processes and Random Walk ⋮ A general storage model with applications to energy systems ⋮ Convergence of value functions for finite horizon Markov decision processes with constraints ⋮ Finite approximation of the first passage models for discrete-time Markov decision processes with varying discount factors ⋮ An analysis of transient Markov decision processes ⋮ Convergence of Markov decision processes with constraints and state-action dependent discount factors ⋮ Robust shortest path planning and semicontractive dynamic programming ⋮ On the reduction of total‐cost and average‐cost MDPs to discounted MDPs
This page was built for publication: Algorithms for Countable State Markov Decision Models with an Absorbing Set
