IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p1266-1286.html
   My bibliography  Save this article

Sufficiency of Markov Policies for Continuous-Time Jump Markov Decision Processes

Author

Listed:
  • Eugene A. Feinberg

    (Department of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, New York 11794)

  • Manasa Mandava

    (Indian School of Business, Hyderabad 500032, India)

  • Albert N. Shiryaev

    (Department of Probability Theory and Mathematical Statistics, Steklov Mathematical Institute, Moscow 119991, Russia † Deceased)

Abstract

One of the basic facts known for discrete-time Markov decision processes is that, if the probability distribution of an initial state is fixed, then for every policy it is easy to construct a (randomized) Markov policy with the same marginal distributions of state-action pairs as for the original policy. This equality of marginal distributions implies that the values of major objective criteria, including expected discounted total costs and average rewards per unit time, are equal for these two policies. This paper investigates the validity of the similar fact for continuous-time jump Markov decision processes (CTJMDPs). It is shown in this paper that the equality of marginal distributions takes place for a CTJMDP if the corresponding Markov policy defines a nonexplosive jump Markov process. If this Markov process is explosive, then at each time instance, the marginal probability, that a state-action pair belongs to a measurable set of state-action pairs, is not greater for the described Markov policy than the same probability for the original policy. These results are applied in this paper to CTJMDPs with expected discounted total costs and average costs per unit time. It is shown for these criteria that, if the initial state distribution is fixed, then for every policy, there exists a Markov policy with the same or better value of the objective function.

Suggested Citation

  • Eugene A. Feinberg & Manasa Mandava & Albert N. Shiryaev, 2022. "Sufficiency of Markov Policies for Continuous-Time Jump Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1266-1286, May.
  • Handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:1266-1286
    DOI: 10.1287/moor.2021.1169
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1169
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2021.1169?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
    ---><---

    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:inm:ormoor:v:47:y:2022:i:2:p:1266-1286. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.