IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v49y1999i2p255-266.html
   My bibliography  Save this article

The finiteness of the reward function and the optimal value function in Markov decision processes

Author

Listed:
  • Qiying Hu
  • Chen Xu

Abstract

This paper studies the discrete time Markov decision processes (MDP) with expected discounted total reward, where the state space is countable, the action space is measurable, the reward function is extended real-valued, and the discount rate may be any real number. Two conditions (GC) and (C) are presented, which are weaker than that presented in literature. By eliminating some worst actions, the state space S can be partitioned into sets S ∞ , S −∞ , S 0 , on which the optimal value function equals +∞ , −∞ or is finite, respectively. Furthermore, the validity of the optimality equation is shown when its right hand side is well defined, especially, when it is restricted to the subset S 0 . The reward function r (i, a) is finite and bounded above in a for each i∈S 0 . Finally, some sufficient conditions for (GC) and (C) are given. Copyright Springer-Verlag Berlin Heidelberg 1999

Suggested Citation

  • Qiying Hu & Chen Xu, 1999. "The finiteness of the reward function and the optimal value function in Markov decision processes," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 49(2), pages 255-266, April.
    • Handle: RePEc:spr:mathme:v:49:y:1999:i:2:p:255-266
    DOI: 10.1007/PL00020916
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/PL00020916
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/PL00020916?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
    ---><---

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

    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:mathme:v:49:y:1999:i:2:p:255-266. 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.