Abstract
This paper deals with denumerable discrete-time Markov decision processes with unbounded costs. The criteria to be minimized are both of the limsup and liminf average criteria, instead of only the limsup average criterion widely used in the previous literature. We give another set of conditions under which the existence of an optimal stationary policy for the two average criteria is ensured. The results in this paper are applied to an admission control queueing model.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Manuscript received: January 2004 / Final version received: July 2004
Research supported by the Natural Science Foundations of China and Guangdong Province, by NCET and EYTP and by the Foundation of Zhongshan University Advanced Research Center.
Rights and permissions
About this article
Cite this article
Zhu, Q., Guo, X. & Dai, Y. Unbounded cost Markov decision processes with limsup and liminf average criteria: new conditions. Math Meth Oper Res 61, 469–482 (2005). https://doi.org/10.1007/s001860400408
Issue Date:
DOI: https://doi.org/10.1007/s001860400408