“Super-overtaking” optimal policies for Markov control processes

In this paper we study the average cost optimization problem for discrete-time Markov control processes on Borel space with possibly unbounded costs. Under proper ergodicity assumptions we show the existence of stationary policies for which asymptotic (as N → ∞) behavior of some functions of N-horizon costs can be better than for overtaking optimal policies.