IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v318y2024i1p242-252.html
   My bibliography  Save this article

Determinism versus uncertainty: Examining the worst-case expected performance of data-driven policies

Author

Listed:
  • Tian, Xuecheng
  • Wang, Shuaian
  • Laporte, Gilbert
  • Yang, Ying

Abstract

This paper explores binary decision making, a critical domain in areas such as finance and supply chain management, where decision makers must often choose between a deterministic-cost option and an uncertain-cost option. Given the limited historical data on the uncertain cost and its unknown probability distribution, this research aims to ascertain how decision makers can optimize their decisions. To this end, we evaluate the worst-case expected performance of all possible data-driven policies, including the sample average approximation policy, across four scenarios differentiated by the extent of knowledge regarding the lower and upper bounds of the first moment of the uncertain cost distribution. Our analysis, using worst-case expected absolute regret and worst-case expected relative regret metrics, consistently shows that no data-driven policy outperforms the straightforward strategy of choosing either a deterministic-cost or uncertain-cost option in these scenarios. Notably, the optimal choice between these two options depends on the specific lower and upper bounds of the first moment. Our research contributes to the literature by revealing the minimal worst-case expected performance of all possible data-driven policies for binary decision-making problems.

Suggested Citation

  • Tian, Xuecheng & Wang, Shuaian & Laporte, Gilbert & Yang, Ying, 2024. "Determinism versus uncertainty: Examining the worst-case expected performance of data-driven policies," European Journal of Operational Research, Elsevier, vol. 318(1), pages 242-252.
  • Handle: RePEc:eee:ejores:v:318:y:2024:i:1:p:242-252
    DOI: 10.1016/j.ejor.2024.04.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724003308
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2024.04.031?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. 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.
    2. Liu, Congzheng & Letchford, Adam N. & Svetunkov, Ivan, 2022. "Newsvendor problems: An integrated method for estimation and optimisation," European Journal of Operational Research, Elsevier, vol. 300(2), pages 590-601.
    3. Yingjie Lan & Michael O. Ball & Itir Z. Karaesmen, 2011. "Regret in Overbooking and Fare-Class Allocation for Single Leg," Manufacturing & Service Operations Management, INFORMS, vol. 13(2), pages 194-208, December.
    4. Tian, Xuecheng & Yan, Ran & Liu, Yannick & Wang, Shuaian, 2023. "A smart predict-then-optimize method for targeted and cost-effective maritime transportation," Transportation Research Part B: Methodological, Elsevier, vol. 172(C), pages 32-52.
    5. 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.
    6. Karthik Natarajan & Melvyn Sim & Joline Uichanco, 2018. "Asymmetry and Ambiguity in Newsvendor Models," Management Science, INFORMS, vol. 64(7), pages 3146-3167, July.
    7. Igor Averbakh, 2005. "The Minmax Relative Regret Median Problem on Networks," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 451-461, November.
    8. Cheridito, Patrick & Delbaen, Freddy & Kupper, Michael, 2004. "Coherent and convex monetary risk measures for bounded càdlàg processes," Stochastic Processes and their Applications, Elsevier, vol. 112(1), pages 1-22, July.
    9. Georgia Perakis & Guillaume Roels, 2008. "Regret in the Newsvendor Model with Partial Information," Operations Research, INFORMS, vol. 56(1), pages 188-203, February.
    10. Bart P. G. Van Parys & Peyman Mohajerin Esfahani & Daniel Kuhn, 2021. "From Data to Decisions: Distributionally Robust Optimization Is Optimal," Management Science, INFORMS, vol. 67(6), pages 3387-3402, June.
    11. Joel Goh & Melvyn Sim, 2010. "Distributionally Robust Optimization and Its Tractable Approximations," Operations Research, INFORMS, vol. 58(4-part-1), pages 902-917, August.
    12. Dimitris Bertsimas & Nathan Kallus, 2020. "From Predictive to Prescriptive Analytics," Management Science, INFORMS, vol. 66(3), pages 1025-1044, March.
    13. 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.
    14. 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.
    15. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    16. Retsef Levi & Cong Shi, 2013. "Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times," Operations Research, INFORMS, vol. 61(3), pages 593-602, June.
    17. Francesca Maggioni & Matteo Cagnolari & Luca Bertazzi, 2019. "The value of the right distribution in stochastic programming with application to a Newsvendor problem," Computational Management Science, Springer, vol. 16(4), pages 739-758, October.
    18. 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.
    19. Pascal M. Notz & Richard Pibernik, 2022. "Prescriptive Analytics for Flexible Capacity Management," Management Science, INFORMS, vol. 68(3), pages 1756-1775, March.
    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. Erkip, Nesim Kohen, 2023. "Can accessing much data reshape the theory? Inventory theory under the challenge of data-driven systems," European Journal of Operational Research, Elsevier, vol. 308(3), pages 949-959.
    2. Bai, Qingguo & Xu, Jianteng & Gong, Yeming & Chauhan, Satyaveer S., 2022. "Robust decisions for regulated sustainable manufacturing with partial demand information: Mandatory emission capacity versus emission tax," European Journal of Operational Research, Elsevier, vol. 298(3), pages 874-893.
    3. Shuaian Wang & Xuecheng Tian, 2023. "A Deficiency of the Predict-Then-Optimize Framework: Decreased Decision Quality with Increased Data Size," Mathematics, MDPI, vol. 11(15), pages 1-9, July.
    4. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    5. Olivares-Nadal, Alba V., 2024. "Constructing decision rules for multiproduct newsvendors: An integrated estimation-and-optimization framework," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1021-1037.
    6. 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.
    7. Yang, Cheng-Hu & Wang, Hai-Tang & Ma, Xin & Talluri, Srinivas, 2023. "A data-driven newsvendor problem: A high-dimensional and mixed-frequency method," International Journal of Production Economics, Elsevier, vol. 266(C).
    8. Thais de Castro Moraes & Jiancheng Qin & Xue-Ming Yuan & Ek Peng Chew, 2023. "Evolving Hybrid Deep Neural Network Models for End-to-End Inventory Ordering Decisions," Logistics, MDPI, vol. 7(4), pages 1-18, November.
    9. Shanshan Wang & Erick Delage, 2024. "A Column Generation Scheme for Distributionally Robust Multi-Item Newsvendor Problems," INFORMS Journal on Computing, INFORMS, vol. 36(3), pages 849-867, May.
    10. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    11. Andrew F. Siegel & Michael R. Wagner, 2021. "Profit Estimation Error in the Newsvendor Model Under a Parametric Demand Distribution," Management Science, INFORMS, vol. 67(8), pages 4863-4879, August.
    12. Zhi Chen & Weijun Xie, 2021. "Regret in the Newsvendor Model with Demand and Yield Randomness," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4176-4197, November.
    13. Meng Qi & Ying Cao & Zuo-Jun (Max) Shen, 2022. "Distributionally Robust Conditional Quantile Prediction with Fixed Design," Management Science, INFORMS, vol. 68(3), pages 1639-1658, March.
    14. Xuan Wang & Jiawei Zhang, 2015. "Process Flexibility: A Distribution-Free Bound on the Performance of k -Chain," Operations Research, INFORMS, vol. 63(3), pages 555-571, June.
    15. Liu, Congzheng & Letchford, Adam N. & Svetunkov, Ivan, 2022. "Newsvendor problems: An integrated method for estimation and optimisation," European Journal of Operational Research, Elsevier, vol. 300(2), pages 590-601.
    16. Corredera, Alberto & Ruiz, Carlos, 2023. "Prescriptive selection of machine learning hyperparameters with applications in power markets: Retailer’s optimal trading," European Journal of Operational Research, Elsevier, vol. 306(1), pages 370-388.
    17. Anh Ninh & Honggang Hu & David Allen, 2019. "Robust newsvendor problems: effect of discrete demands," Annals of Operations Research, Springer, vol. 275(2), pages 607-621, April.
    18. Postek, Krzysztof & Ben-Tal, A. & den Hertog, Dick & Melenberg, Bertrand, 2015. "Exact Robust Counterparts of Ambiguous Stochastic Constraints Under Mean and Dispersion Information," Other publications TiSEM d718e419-a375-4707-b206-e, Tilburg University, School of Economics and Management.
    19. Georgia Perakis & Melvyn Sim & Qinshen Tang & Peng Xiong, 2023. "Robust Pricing and Production with Information Partitioning and Adaptation," Management Science, INFORMS, vol. 69(3), pages 1398-1419, March.
    20. Corredera, Alberto, 2022. "Prescriptive selection of machine learning hyperparameters with applications in power markets: retailer's optimal trading," DES - Working Papers. Statistics and Econometrics. WS 33693, Universidad Carlos III de Madrid. Departamento de Estadística.

    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:eee:ejores:v:318:y:2024:i:1:p:242-252. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.