IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4613-0265-0_14.html
   My bibliography  Save this book chapter

Linear Program for Communicating MDPs with Multiple Constraints

In: Markov Processes and Controlled Markov Chains

Author

Listed:
  • Jerzy A. Filar

    (The University of South Australia, School of Mathematics)

  • Xianping Guo

    (Zhongshan University, The Department of Mathematics)

Abstract

In this paper, a mapping is developed between the ‘multichain’ and ‘unchain’ linear programs for average reward Markov decision processes (MDPs) with multiple constraints on average expected costs. Our approach applies the communicating properties of MDPs. The mapping is used not only to prove that the unichain linear program solves the average reward communicating MDPs with multiple constraints on average expected costs, but also to demonstrate that the optimal gain for the communicating MDPs with multiple constraints on average expected costs is constant.

Suggested Citation

  • Jerzy A. Filar & Xianping Guo, 2002. "Linear Program for Communicating MDPs with Multiple Constraints," Springer Books, in: Zhenting Hou & Jerzy A. Filar & Anyue Chen (ed.), Markov Processes and Controlled Markov Chains, chapter 0, pages 245-254, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4613-0265-0_14
    DOI: 10.1007/978-1-4613-0265-0_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    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:spr:sprchp:978-1-4613-0265-0_14. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.