IDEAS home Printed from https://ideas.repec.org/a/hin/jnlaaa/103723.html
   My bibliography  Save this article

Policy Iteration for Continuous-Time Average Reward Markov Decision Processes in Polish Spaces

Author

Listed:
  • Quanxin Zhu
  • Xinsong Yang
  • Chuangxia Huang

Abstract

We study the policy iteration algorithm (PIA) for continuous-time jump Markov decision processes in general state and action spaces. The corresponding transition rates are allowed to be unbounded , and the reward rates may have neither upper nor lower bounds . The criterion that we are concerned with is expected average reward . We propose a set of conditions under which we first establish the average reward optimality equation and present the PIA. Then under two slightly different sets of conditions we show that the PIA yields the optimal (maximum) reward, an average optimal stationary policy, and a solution to the average reward optimality equation.

Suggested Citation

  • Quanxin Zhu & Xinsong Yang & Chuangxia Huang, 2009. "Policy Iteration for Continuous-Time Average Reward Markov Decision Processes in Polish Spaces," Abstract and Applied Analysis, Hindawi, vol. 2009, pages 1-17, January.
    • Handle: RePEc:hin:jnlaaa:103723
    DOI: 10.1155/2009/103723
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/AAA/2009/103723.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/AAA/2009/103723.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2009/103723?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlaaa:103723. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.