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

Markov Decision Processes with Observation Costs: Framework and Computation with a Penalty Scheme

Author

Listed:
  • Christoph Reisinger

    (Mathematical Institute, University of Oxford, Oxford OX2 6GG, United Kingdom)

  • Jonathan Tam

    (Mathematical Institute, University of Oxford, Oxford OX2 6GG, United Kingdom)

Abstract

We consider Markov decision processes where the state of the chain is only given at chosen observation times and of a cost. Optimal strategies involve the optimization of observation times as well as the subsequent action values. We consider the finite horizon and discounted infinite horizon problems as well as an extension with parameter uncertainty. By including the time elapsed from observations as part of the augmented Markov system, the value function satisfies a system of quasivariational inequalities (QVIs). Such a class of QVIs can be seen as an extension to the interconnected obstacle problem. We prove a comparison principle for this class of QVIs, which implies the uniqueness of solutions to our proposed problem. Penalty methods are then utilized to obtain arbitrarily accurate solutions. Finally, we perform numerical experiments on three applications that illustrate our framework.

Suggested Citation

  • Christoph Reisinger & Jonathan Tam, 2025. "Markov Decision Processes with Observation Costs: Framework and Computation with a Penalty Scheme," Mathematics of Operations Research, INFORMS, vol. 50(2), pages 1305-1332, May.
    • Handle: RePEc:inm:ormoor:v:50:y:2025:i:2:p:1305-1332
    DOI: 10.1287/moor.2023.0172
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2023.0172
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2023.0172?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:50:y:2025:i:2:p:1305-1332. 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.