On the relation between recurrence and ergodicity properties in denumerable Markov decision chains
View PDF Version
Redirect to Permalink
(Permalink.url.txt, 87 bytes)
This paper studies two properties of the set of Markov chains induced by the deterministic policies in a Markov decision chain. These properties are called μ-uniform geometric ergodicity and μ-uniform geometric recurrence. μ-uniform ergodicity generalises a quasi-compactness condition. It can be interpreted as a strong version of stability, as it implies that the Markov chains generated by the deterministic stationary policies are uniformly stable. μ-uniform geometric recurrence can be shown to be equivalent to the simultaneous Doeblin condition, if μ is bounded. Both properties imply the existence of deterministic average and sensitive optimal policies. The second Key theorem in this paper shows the equivalence of μ-uniform geometric erogdicity and weak μ-uniform geometric recurrence under appropriate continuity conditions. In the literature numerous recurrence conditions have been used. The first Key theorem derives the relation between serval of these conditions, which interestingly turn out to be equivalent in most cases.