IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v208y2013i1p433-45010.1007-s10479-012-1230-2.html
   My bibliography  Save this article

Variance minimization for constrained discounted continuous-time MDPs with exponentially distributed stopping times

Author

Listed:
  • Jun Fei
  • Eugene Feinberg

Abstract

This paper deals with minimization of the variances of the total discounted costs for constrained Continuous-Time Markov Decision Processes (CTMDPs). The costs consist of cumulative costs incurred between jumps and instant costs incurred at jump epochs. We interpret discounting as an exponentially distributed stopping time. According to existing theory, for the expected total discounted costs optimal policies exist in the forms of randomized stationary and switching stationary policies. While the former is typically unique, the latter forms a finite set whose number of elements grows exponentially with the number of constraints. This paper investigates the problem when the process stops immediately after the first jump. For costs up to the first jump we provide an index for selection of actions by switching stationary policies and show that the indexed switching policy achieves a smaller variance than the randomized stationary policy. For problems without instant costs, the indexed switching policy achieves the minimum variance of costs up to the first jump among all the equivalent switching policies. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • 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.
  • Handle: RePEc:spr:annopr:v:208:y:2013:i:1:p:433-450:10.1007/s10479-012-1230-2
    DOI: 10.1007/s10479-012-1230-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-012-1230-2
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-012-1230-2?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. 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.
    2. Matthew J. Sobel, 1994. "Mean-Variance Tradeoffs in an Undiscounted MDP," Operations Research, INFORMS, vol. 42(1), pages 175-183, February.
    Full references (including those not matched with items on IDEAS)

    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. Li Xia, 2020. "Risk‐Sensitive Markov Decision Processes with Combined Metrics of Mean and Variance," Production and Operations Management, Production and Operations Management Society, vol. 29(12), pages 2808-2827, December.
    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. Alessandro Arlotto & Noah Gans & J. Michael Steele, 2014. "Markov Decision Problems Where Means Bound Variances," Operations Research, INFORMS, vol. 62(4), pages 864-875, August.
    4. René Caldentey & Martin B. Haugh, 2009. "Supply Contracts with Financial Hedging," Operations Research, INFORMS, vol. 57(1), pages 47-65, February.
    5. A. B. Piunovskiy, 2004. "Optimal Interventions in Countable Jump Markov Processes," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 289-308, May.
    6. Ma, Shuai & Ma, Xiaoteng & Xia, Li, 2023. "A unified algorithm framework for mean-variance optimization in discounted Markov decision processes," European Journal of Operational Research, Elsevier, vol. 311(3), pages 1057-1067.
    7. 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.
    8. Eugene Feinberg, 2005. "On essential information in sequential decision processes," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(3), pages 399-410, December.
    9. 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.
    10. Hermans, Ben & Leus, Roel & Looy, Bart Van, 2023. "Deciding on scheduling, secrecy, and patenting during the new product development process: The relevance of project planning models," Omega, Elsevier, vol. 116(C).
    11. Huang, Yonghui & Guo, Xianping, 2011. "Finite horizon semi-Markov decision processes with application to maintenance systems," European Journal of Operational Research, Elsevier, vol. 212(1), pages 131-140, July.
    12. Chunling Luo & Chin Hon Tan, 2020. "Almost Stochastic Dominance for Most Risk-Averse Decision Makers," Decision Analysis, INFORMS, vol. 17(2), pages 169-184, June.
    13. 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.
    14. 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.

    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:annopr:v:208:y:2013:i:1:p:433-450:10.1007/s10479-012-1230-2. 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.