Value iteration in average cost Markov control processes on Borel spaces
✍ Scribed by Raúl Montes-de-Oca; Onésimo Hernández-Lerma
- Publisher
- Springer Netherlands
- Year
- 1996
- Tongue
- English
- Weight
- 872 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0167-8019
No coin nor oath required. For personal study only.
✦ Synopsis
This paper deals with discrete-time Markov control processes with Borel state and control spaces, with possibly unbounded costs and noncompact control constraint sets, and the average cost criterion. Conditions are given for the convergence of the value iteration algorithm to the optimal average cost, and for a sequence of finite-horizon optimal policies to have an accumulation point which is average cost optimal.
📜 SIMILAR VOLUMES
This work concerns average Markov decision chains with denumerable state space. Assuming that the Lyapunov function condition holds, it is shown that the value iteration scheme yields convergent approximations to the solution of the average cost optimality equation. This result is obtained using a p
This paper is concerned with the linear programming formulation of Markov decision processes (or stochastic dynamic programs) with Borel state and action spaces and the discounted cost criterion. The one-stage cost function may be unbounded. A linear program and its dual are introduced, for which is