IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v21y1974i3p348-357.html
   My bibliography  Save this article

Preferred Rules in Continuous Time Markov Decision Processes

Author

Listed:
  • Mark R. Lembersky

    (Oregon State University)

Abstract

Motivated by a planning horizon result for continuous time Markov decision chains, we study decision rules, called preferred, which may be used in the initially stationary part of nearly optimal policies. We characterize these rules and then, under conditions involving state recurrence and accessibility, consider finding such rules. We also discuss the connection between preferred rules and certain discounted process decision rules, and the role of preferred rules in optimal policies.

Suggested Citation

  • Mark R. Lembersky, 1974. "Preferred Rules in Continuous Time Markov Decision Processes," Management Science, INFORMS, vol. 21(3), pages 348-357, November.
    • Handle: RePEc:inm:ormnsc:v:21:y:1974:i:3:p:348-357
    DOI: 10.1287/mnsc.21.3.348
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.21.3.348
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.21.3.348?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Richard E. Chatwin, 1996. "Optimal control of continuous‐time terminal‐value birth‐and‐death processes and airline overbooking," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(2), pages 159-168, March.

    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:inm:ormnsc:v:21:y:1974:i:3:p:348-357. 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.