IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v9y1979i2p223-235.html
   My bibliography  Save this article

Denumerable state semi-Markov decision processes with unbounded costs, average cost criterion

Author

Listed:
  • Federgruen, A.
  • Hordijk, A.
  • Tijms, H. C.

Abstract

This paper establishes a rather complete optimality theory for the average cost semi-Markov decision model with a denumerable state space, compact metric action sets and unbounded one-step costs for the case where the underlying Markov chains have a single ergotic set. Under a condition which, roughly speaking, requires the existence of a finite set such that the supremum over all stationary policies of the expected time and the total expected absolute cost incurred until the first return to this set are finite for any starting state, we shall verify the existence of a finite solution to the average costs optimality equation and the existence of an average cost optimal stationary policy.

Suggested Citation

  • Federgruen, A. & Hordijk, A. & Tijms, H. C., 1979. "Denumerable state semi-Markov decision processes with unbounded costs, average cost criterion," Stochastic Processes and their Applications, Elsevier, vol. 9(2), pages 223-235, November.
  • Handle: RePEc:eee:spapps:v:9:y:1979:i:2:p:223-235
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(79)90034-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qingda Wei & Xianping Guo, 2012. "New Average Optimality Conditions for Semi-Markov Decision Processes in Borel Spaces," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 709-732, June.
    2. L. Jianyong & Z. Xiaobo, 2004. "On Average Reward Semi-Markov Decision Processes with a General Multichain Structure," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 339-352, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:9:y:1979:i:2:p:223-235. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.