Survey of Data-driven Newsvendor: Unified Analysis and Spectrum of Achievable Regrets

References

• Balcan M-F (2020) Data-driven algorithm design. Preprint, submitted November 14, https://arxiv.org/abs/2011.07177.Google Scholar
• Balcan M-F, DeBlasio D, Dick T, Kingsford C, Sandholm T, Vitercik E (2021) How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design. Proc. 53rd Annual ACM SIGACT Sympos. Theory Comput. (Association for Computing Machinery, New York), 919–932.Google Scholar
• Balseiro SR, Besbes O, Pizarro D (2024) Survey of dynamic resource-constrained reward collection problems: Unified model and analysis. Oper. Res. 72(5):2168–2189.Link, Google Scholar
• Balseiro SR, Ma W, Zhang W (2025) Dynamic pricing for reusable resources: The power of two prices. Oper. Res.Link, Google Scholar
• Ban G-Y, Rudin C (2019) The big data newsvendor: Practical insights from machine learning. Oper. Res. 67(1):90–108.Link, Google Scholar
• Besbes O, Mouchtaki O (2023) How big should your data really be? Data-driven newsvendor: Learning one sample at a time. Management Sci. 69(10):5848–5865.Link, Google Scholar
• Besbes O, Muharremoglu A (2013) On implications of demand censoring in the newsvendor problem. Management Sci. 59(6):1407–1424.Link, Google Scholar
• Besbes O, Kanoria Y, Kumar A (2025a) Dynamic resource allocation: Algorithmic design principles and spectrum of achievable performances. Oper. Res. 73(3):1273–1288.Link, Google Scholar
• Besbes O, Ma W, Mouchtaki O (2025b) From contextual data to newsvendor decisions: On the actual performance of data-driven algorithms. Management Sci.Google Scholar
• Besbes O, Ma W, Mouchtaki O (2025c) Beyond IID: Data-driven decision making in heterogeneous environments. Management Sci. 71(12):10538–10555.Link, Google Scholar
• Chen B, Chao X, Shi C (2021) Nonparametric learning algorithms for joint pricing and inventory control with lost sales and censored demand. Math. Oper. Res. 46(2):726–756.Link, Google Scholar
• Chen B, Wang Y, Zhou Y (2024) Optimal policies for dynamic pricing and inventory control with nonparametric censored demands. Management Sci. 70(5):3362–3380.Link, Google Scholar
• Chen B, Simchi-Levi D, Wang Y, Zhou Y (2022) Dynamic pricing and inventory control with fixed ordering cost and incomplete demand information. Management Sci. 68(8):5684–5703.Link, Google Scholar
• Cheung WC, Simchi-Levi D (2019) Sampling-based approximation schemes for capacitated stochastic inventory control models. Math. Oper. Res. 44(2):668–692.Link, Google Scholar
• Guo C, Huang Z, Tang ZG, Zhang X (2021) Generalizing complex hypotheses on product distributions: Auctions, prophet inequalities, and pandora’s problem. Belkin M, Kpotufe S, eds. Proc. 34th Conf. Learn. Theory (PMLR, New York), 2248–2288.Google Scholar
• Gupta V, Kallus N (2022) Data pooling in stochastic optimization. Management Sci. 68(3):1595–1615.Link, Google Scholar
• Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58(301):13–30.Crossref, Google Scholar
• Hssaine C, Sinclair SR (2024) The data-driven censored newsvendor problem. Preprint, submitted December 2, https://arxiv.org/abs/2412.01763.Google Scholar
• Huh WT, Rusmevichientong P (2009) A nonparametric asymptotic analysis of inventory planning with censored demand. Math. Oper. Res. 34(1):103–123.Link, Google Scholar
• Jin B, Kesselheim T, Ma W, Singla S (2024) Sample complexity of posted pricing for a single item. Adv. Neural Inform. Processing Systems 37:82296–82317.Crossref, Google Scholar
• Levi R, Perakis G, Uichanco J (2015) The data-driven newsvendor problem: New bounds and insights. Oper. Res. 63(6):1294–1306.Link, Google Scholar
• Levi R, Roundy RO, Shmoys DB (2007) Provably near-optimal sampling-based policies for stochastic inventory control models. Math. Oper. Res. 32(4):821–839.Link, Google Scholar
• Lin M, Huh WT, Krishnan H, Uichanco J (2022) Data-driven newsvendor problem: Performance of the sample average approximation. Oper. Res. 70(4):1996–2012.Link, Google Scholar
• Lyu J, Yuan S, Zhou B, Zhou Y (2024) Closing the gaps: Optimality of sample average approximation for data-driven newsvendor problems. Preprint, submitted July 6, https://arxiv.org/abs/2407.04900.Google Scholar
• Mammen E, Tsybakov AB (1999) Smooth discrimination analysis. Ann. Statist. 27(6):1808–1829.Crossref, Google Scholar
• Massart P (1990) The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality. Ann. Probability 18(3):1269–1283.Google Scholar
• Mohri M, Rostamizadeh A, Talwalkar A (2018) Foundations of Machine Learning (MIT Press, Cambridge, MA).Google Scholar
• Perakis G, Roels G (2008) Regret in the newsvendor model with partial information. Oper. Res. 56(1):188–203.Link, Google Scholar
• Rigollet P, Zeevi A (2010) Nonparametric bandits with covariates. Preprint, submitted March 8, https://arxiv.org/abs/1003.1630.Google Scholar
• Shalev-Shwartz S, Ben-David S (2014) Understanding Machine Learning: From Theory to Algorithms (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Tsybakov AB (2004) Optimal aggregation of classifiers in statistical learning. Ann. Statist. 32(1):135–166.Crossref, Google Scholar
• Tsybakov AB (2009) Introduction to Nonparametric Estimation. Springer Series in Statistics (Springer, New York).Google Scholar
• Xie Y, Ma W, Xin L (2024) VC theory for inventory policies. Preprint, submitted April 17, https://arxiv.org/abs/2404.11509.Google Scholar
• Zhang Z, Ahn H-S, Baardman L (2024) More data or better data? Impact of costly data collection on the newsvendor problem. Preprint, submitted September 24, https://dx.doi.org/10.2139/ssrn.4949043.Google Scholar
• Zhang H, Chao X, Shi C (2020) Closing the gap: A learning algorithm for lost-sales inventory systems with lead times. Management Sci. 66(5):1962–1980.Link, Google Scholar
• Zhang K, Gao X, Wang Z, Zhou SX (2025) Sampling-based approximation for series inventory systems. Management Sci. 71(10):8200–8217.Link, Google Scholar