Let J be the (constant) minimum long-run expected average cost in a Markov decision chain with countable state space. The paper desires the existence of an average cost optimal stationary policy and, in addition, that J is the limit of vn(ë)/n, where vn(ë) is the minimum n-step expected cost. Three sets of sufficient conditions for this to hold are given. The results generalize Ghosh and Marcus.
