IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v60y2012i5p1267-1281.html
   My bibliography  Save this article

Performance Guarantees for Empirical Markov Decision Processes with Applications to Multiperiod Inventory Models

Author

Listed:
  • William L. Cooper

    (Department of Industrial and Systems Engineering, University of Minnesota, Minneapolis, Minnesota 55455)

  • Bharath Rangarajan

    (Merchandising Operations, Target Corporation, Minneapolis, Minnesota 55402)

Abstract

We consider Markov decision processes with unknown transition probabilities and unknown single-period expected cost functions, and we study a method for estimating these quantities from historical or simulated data. The method requires knowledge of the system equations that govern state transitions as well as the single-period cost functions (but not the single-period expected cost functions). The estimation procedure is based upon taking expectations with respect to the empirical distribution functions of such data. Once the estimates are in place, the method computes a policy by solving the obtained “empirical” Markov decision process as if the estimates were correct. For MDPs that satisfy some conditions, we provide explicit, easily computed expressions for the probability that the procedure will produce a policy whose true expected cost is within any specified absolute distance of the actual optimal expected cost of the true Markov decision process. We also provide expressions for the number of historical or simulated data values that is sufficient for the procedure to produce a policy whose true expected cost is, with a prescribed probability, within a prescribed absolute distance of the actual optimal expected cost of the true Markov decision process. We apply our results to multiperiod inventory models. In addition, we provide a specialized analysis of such inventory models that also yields relative, rather than absolute, accuracy guarantees. We make comparisons with related results that have recently appeared, and we provide numerical examples.

Suggested Citation

  • William L. Cooper & Bharath Rangarajan, 2012. "Performance Guarantees for Empirical Markov Decision Processes with Applications to Multiperiod Inventory Models," Operations Research, INFORMS, vol. 60(5), pages 1267-1281, October.
  • Handle: RePEc:inm:oropre:v:60:y:2012:i:5:p:1267-1281
    DOI: 10.1287/opre.1120.1090
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1120.1090
    Download Restriction: no

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

    References listed on IDEAS

    as
    1. Shie Mannor & Duncan Simester & Peng Sun & John N. Tsitsiklis, 2007. "Bias and Variance Approximation in Value Function Estimates," Management Science, INFORMS, vol. 53(2), pages 308-322, February.
    2. Hyeong Soo Chang & Michael C. Fu & Jiaqiao Hu & Steven I. Marcus, 2005. "An Adaptive Sampling Algorithm for Solving Markov Decision Processes," Operations Research, INFORMS, vol. 53(1), pages 126-139, February.
    3. Retsef Levi & Robin O. Roundy & David B. Shmoys, 2007. "Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models," Mathematics of Operations Research, INFORMS, vol. 32(4), pages 821-839, November.
    4. Georgia Perakis & Guillaume Roels, 2008. "Regret in the Newsvendor Model with Partial Information," Operations Research, INFORMS, vol. 56(1), pages 188-203, 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. William B. Haskell & Rahul Jain & Dileep Kalathil, 2016. "Empirical Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 402-429, May.
    2. Jianqiang Hu & Cheng Zhang & Chenbo Zhu, 2016. "( s , S ) Inventory Systems with Correlated Demands," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 603-611, November.

    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. Woonghee Tim Huh & Paat Rusmevichientong, 2014. "Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 150-159, February.
    2. Serrano, Breno & Minner, Stefan & Schiffer, Maximilian & Vidal, Thibaut, 2024. "Bilevel optimization for feature selection in the data-driven newsvendor problem," European Journal of Operational Research, Elsevier, vol. 315(2), pages 703-714.
    3. Woonghee Tim Huh & Paat Rusmevichientong, 2009. "A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 103-123, February.
    4. Alp Akcay & Bahar Biller & Sridhar Tayur, 2011. "Improved Inventory Targets in the Presence of Limited Historical Demand Data," Manufacturing & Service Operations Management, INFORMS, vol. 13(3), pages 297-309, July.
    5. Retsef Levi & Georgia Perakis & Joline Uichanco, 2015. "The Data-Driven Newsvendor Problem: New Bounds and Insights," Operations Research, INFORMS, vol. 63(6), pages 1294-1306, December.
    6. Gah-Yi Ban & Cynthia Rudin, 2019. "The Big Data Newsvendor: Practical Insights from Machine Learning," Operations Research, INFORMS, vol. 67(1), pages 90-108, January.
    7. Soroush Saghafian & Brian Tomlin, 2016. "The Newsvendor under Demand Ambiguity: Combining Data with Moment and Tail Information," Operations Research, INFORMS, vol. 64(1), pages 167-185, February.
    8. Pirayesh Neghab, Davood & Khayyati, Siamak & Karaesmen, Fikri, 2022. "An integrated data-driven method using deep learning for a newsvendor problem with unobservable features," European Journal of Operational Research, Elsevier, vol. 302(2), pages 482-496.
    9. Rossi, Roberto & Prestwich, Steven & Tarim, S. Armagan & Hnich, Brahim, 2014. "Confidence-based optimisation for the newsvendor problem under binomial, Poisson and exponential demand," European Journal of Operational Research, Elsevier, vol. 239(3), pages 674-684.
    10. Huber, Jakob & Müller, Sebastian & Fleischmann, Moritz & Stuckenschmidt, Heiner, 2019. "A data-driven newsvendor problem: From data to decision," European Journal of Operational Research, Elsevier, vol. 278(3), pages 904-915.
    11. Hao Yuan & Qi Luo & Cong Shi, 2021. "Marrying Stochastic Gradient Descent with Bandits: Learning Algorithms for Inventory Systems with Fixed Costs," Management Science, INFORMS, vol. 67(10), pages 6089-6115, October.
    12. Woonghee Tim Huh & Retsef Levi & Paat Rusmevichientong & James B. Orlin, 2011. "Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator," Operations Research, INFORMS, vol. 59(4), pages 929-941, August.
    13. Michael R. Wagner, 2010. "Fully Distribution-Free Profit Maximization: The Inventory Management Case," Mathematics of Operations Research, INFORMS, vol. 35(4), pages 728-741, November.
    14. Georgia Perakis & Guillaume Roels, 2008. "Regret in the Newsvendor Model with Partial Information," Operations Research, INFORMS, vol. 56(1), pages 188-203, February.
    15. Martín Egozcue & Xu Guo & Wing-Keung Wong, 2015. "Optimal output for the regret-averse competitive firm under price uncertainty," Eurasian Economic Review, Springer;Eurasia Business and Economics Society, vol. 5(2), pages 279-295, December.
    16. Peng Hu & Feng Chu & Yunfei Fang & Peng Wu, 2022. "Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1423-1446, July.
    17. Athanassoglou, Stergios & Brams, Steven J. & Sethuraman, Jay, 2008. "Minimizing regret when dissolving a partnership," MPRA Paper 12776, University Library of Munich, Germany.
    18. Qiu, Ruozhen & Sun, Minghe & Lim, Yun Fong, 2017. "Optimizing (s, S) policies for multi-period inventory models with demand distribution uncertainty: Robust dynamic programing approaches," European Journal of Operational Research, Elsevier, vol. 261(3), pages 880-892.
    19. Andersson, Jonas & Jörnsten, Kurt & Nonås, Sigrid Lise & Sandal, Leif & Ubøe, Jan, 2013. "A maximum entropy approach to the newsvendor problem with partial information," European Journal of Operational Research, Elsevier, vol. 228(1), pages 190-200.
    20. Jungho Park & Hadi El-Amine & Nevin Mutlu, 2021. "An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1213-1228, July.

    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:oropre:v:60:y:2012:i:5:p:1267-1281. 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: 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.