Unbounded cost Markov decision processes with limsup and liminf average criteria: new conditions

Quanxin Zhu, Xianping Guo () and Yonglong Dai

Mathematical Methods of Operations Research, 2005, vol. 61, issue 3, 469-482

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. Copyright Springer-Verlag 2005

Keywords: Discrete-time Markov decision process; unbounded cost; average criterion; optimal stationary policy; 90C40 (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860400408 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:61:y:2005:i:3:p:469-482

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860400408

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().