Kybernetika 46 no. 3, 558-570, 2010

Identification of optimal policies in Markov decision processes

Karel Sladký


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 policy or nearly optimal policies in a finite number of steps without knowing precise values of the performance function.


finite state Markov decision processes, discounted and average costs, elimination of suboptimal policies


90C40, 60J10, 93E20