IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v154y2012i2d10.1007_s10957-012-0015-8.html
   My bibliography  Save this article

The Transformation Method for Continuous-Time Markov Decision Processes

Author

Listed:
  • Alexey Piunovskiy

    (University of Liverpool)

  • Yi Zhang

    (University of Liverpool)

Abstract

In this paper, we show that a discounted continuous-time Markov decision process in Borel spaces with randomized history-dependent policies, arbitrarily unbounded transition rates and a non-negative reward rate is equivalent to a discrete-time Markov decision process. Based on a completely new proof, which does not involve Kolmogorov’s forward equation, it is shown that the value function for both models is given by the minimal non-negative solution to the same Bellman equation. A verifiable necessary and sufficient condition for the finiteness of this value function is given, which induces a new condition for the non-explosion of the underlying controlled process.

Suggested Citation

  • Alexey Piunovskiy & Yi Zhang, 2012. "The Transformation Method for Continuous-Time Markov Decision Processes," Journal of Optimization Theory and Applications, Springer, vol. 154(2), pages 691-712, August.
    • Handle: RePEc:spr:joptap:v:154:y:2012:i:2:d:10.1007_s10957-012-0015-8
    DOI: 10.1007/s10957-012-0015-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-012-0015-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-012-0015-8?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.

    References listed on IDEAS

    as
    1. Richard F. Serfozo, 1979. "Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes," Operations Research, INFORMS, vol. 27(3), pages 616-620, June.
    2. Alexey Piunovskiy & Yi Zhang, 2011. "Accuracy of fluid approximations to controlled birth-and-death processes: absorbing case," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 159-187, April.
    3. Eugene A. Feinberg, 2004. "Continuous Time Discounted Jump Markov Decision Processes: A Discrete-Event Approach," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 492-524, August.
    4. Xianping Guo & Alexei Piunovskiy, 2011. "Discounted Continuous-Time Markov Decision Processes with Constraints: Unbounded Transition and Loss Rates," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 105-132, February.
    5. Xianping Guo, 2007. "Continuous-Time Markov Decision Processes with Discounted Rewards: The Case of Polish Spaces," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 73-87, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Guo, Xianping & Zhang, Wenzhao, 2014. "Convergence of controlled models and finite-state approximation for discounted continuous-time Markov decision processes with constraints," European Journal of Operational Research, Elsevier, vol. 238(2), pages 486-496.
    2. Ping Cao & Jingui Xie, 2016. "Optimal control of a multiclass queueing system when customers can change types," Queueing Systems: Theory and Applications, Springer, vol. 82(3), pages 285-313, April.
    3. F. M. Spieksma, 2016. "Kolmogorov forward equation and explosiveness in countable state Markov processes," Annals of Operations Research, Springer, vol. 241(1), pages 3-22, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nicole Leder & Bernd Heidergott & Arie Hordijk, 2010. "An Approximation Approach for the Deviation Matrix of Continuous-Time Markov Processes with Application to Markov Decision Theory," Operations Research, INFORMS, vol. 58(4-part-1), pages 918-932, August.
    2. Xianping Guo & Alexei Piunovskiy, 2011. "Discounted Continuous-Time Markov Decision Processes with Constraints: Unbounded Transition and Loss Rates," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 105-132, February.
    3. Xianping Guo & Yi Zhang, 2016. "Optimality of Mixed Policies for Average Continuous-Time Markov Decision Processes with Constraints," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1276-1296, November.
    4. Guo, Xianping & Zhang, Wenzhao, 2014. "Convergence of controlled models and finite-state approximation for discounted continuous-time Markov decision processes with constraints," European Journal of Operational Research, Elsevier, vol. 238(2), pages 486-496.
    5. Ping Cao & Jingui Xie, 2016. "Optimal control of a multiclass queueing system when customers can change types," Queueing Systems: Theory and Applications, Springer, vol. 82(3), pages 285-313, April.
    6. Xiuli Chao & Frank Y. Chen, 2005. "An Optimal Production and Shutdown Strategy when a Supplier Offers an Incentive Program," Manufacturing & Service Operations Management, INFORMS, vol. 7(2), pages 130-143, March.
    7. Dwi Ertiningsih & Sandjai Bhulai & Flora Spieksma, 2018. "A novel use of value iteration for deriving bounds for threshold and switching curve optimal policies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(8), pages 638-659, December.
    8. Yi Zhang, 2018. "On the Nonexplosion and Explosion for Nonhomogeneous Markov Pure Jump Processes," Journal of Theoretical Probability, Springer, vol. 31(3), pages 1322-1355, September.
    9. Jun Fei & Eugene Feinberg, 2013. "Variance minimization for constrained discounted continuous-time MDPs with exponentially distributed stopping times," Annals of Operations Research, Springer, vol. 208(1), pages 433-450, September.
    10. Dinard van der Laan, 2015. "Assigning Multiple Job Types to Parallel Specialized Servers," Tinbergen Institute Discussion Papers 15-102/III, Tinbergen Institute.
    11. Sergei V. Savin & Morris A. Cohen & Noah Gans & Ziv Katalan, 2005. "Capacity Management in Rental Businesses with Two Customer Bases," Operations Research, INFORMS, vol. 53(4), pages 617-631, August.
    12. Erhan Bayraktar & Michael Ludkovski, 2014. "Liquidation In Limit Order Books With Controlled Intensity," Mathematical Finance, Wiley Blackwell, vol. 24(4), pages 627-650, October.
    13. A. B. Piunovskiy, 2004. "Optimal Interventions in Countable Jump Markov Processes," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 289-308, May.
    14. Subrata Golui & Chandan Pal & Subhamay Saha, 2022. "Continuous-Time Zero-Sum Games for Markov Decision Processes with Discounted Risk-Sensitive Cost Criterion," Dynamic Games and Applications, Springer, vol. 12(2), pages 485-512, June.
    15. Subrata Golui & Chandan Pal, 2022. "Risk-sensitive discounted cost criterion for continuous-time Markov decision processes on a general state space," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(2), pages 219-247, April.
    16. Xufeng Yang & Juliang Zhang & Wen Jiao & Hong Yan, 2023. "Optimal Capacity Rationing Policy for a Container Leasing System with Multiple Kinds of Customers and Substitutable Containers," Management Science, INFORMS, vol. 69(3), pages 1468-1485, March.
    17. Han, Gain & Sohn, Keemin, 2016. "Activity imputation for trip-chains elicited from smart-card data using a continuous hidden Markov model," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 121-135.
    18. Gregory Dobson & Hsiao-Hui Lee & Arvind Sainathan & Vera Tilson, 2012. "A Queueing Model to Evaluate the Impact of Patient "Batching" on Throughput and Flow Time in a Medical Teaching Facility," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 584-599, October.
    19. Yoon, Soovin & Albert, Laura A., 2020. "A dynamic ambulance routing model with multiple response," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    20. Tomás Prieto-Rumeau & Onésimo Hernández-Lerma, 2016. "Uniform ergodicity of continuous-time controlled Markov chains: A survey and new results," Annals of Operations Research, Springer, vol. 241(1), pages 249-293, June.

    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:joptap:v:154:y:2012:i:2:d:10.1007_s10957-012-0015-8. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.