Weak conditions for the existence of optimal stationary policies in average Markov decision chains with unbounded costs
Rolando Cavazos-Cadena (1989)
Kybernetika
Similarity:
Rolando Cavazos-Cadena (1989)
Kybernetika
Similarity:
H. Girlich (1980)
Banach Center Publications
Similarity:
Xiaolong Zou, Xianping Guo (2015)
Kybernetika
Similarity:
In this paper we give a new set of verifiable conditions for the existence of average optimal stationary policies in discrete-time Markov decision processes with Borel spaces and unbounded reward/cost functions. More precisely, we provide another set of conditions, which only consists of a Lyapunov-type condition and the common continuity-compactness conditions. These conditions are imposed on the primitive data of the model of Markov decision processes and thus easy to verify. We also...
Zhu, Quanxin, Guo, Xianping (2006)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Karel Sladký (2010)
Kybernetika
Similarity:
In this note we focus attention on identifying optimal policies and on elimination suboptimal policies minimizing optimality criteria in discrete-time Markov decision processes with finite state space and compact action set. We present unified approach to value iteration algorithms that enables to generate lower and upper bounds on optimal values, as well as on the current policy. Using the modified value iterations it is possible to eliminate suboptimal actions and to identify an optimal...