Nearly optimal stationary policies in negative dynamic programming

Abstract.

This work concerns controlled Markov chains with denumerable state space and discrete time parameter. The reward function is assumed to be≤0 and the performance of a control policy is measured by the expected total-reward criterion. Within this context, sufficient conditions are given so that the existence of a stationary policy which is ε-optimal at every state is guaranteed.