Online Decisions with (Biased) Offline Data

References

• Abbasi-Yadkori Y, Pál D, Szepesvári C (2011) Improved algorithms for linear stochastic bandits. Proc. 25th Internat. Conf. Neural Inform. Proc. Systems (NIPS'11) (Curran Associates Inc., Red Hook, NY), 2312–2320.Google Scholar
• Araman VF, Caldentey R (2009) Dynamic pricing for nonperishable products with demand learning. Oper. Res. 57(5):1169–1188.Link, Google Scholar
• Aronow PM, Lee DK (2013) Interval estimation of population means under unknown but bounded probabilities of sample selection. Biometrika 100(1):235–240.Crossref, Google Scholar
• Auer P, Cesa-Bianchi N, Fischer P (2002) Finite-time analysis of the multiarmed bandit problem. Machine Learn. 47(2):235–256.Crossref, Google Scholar
• Azoury KS (1985) Bayes solution to dynamic inventory models under unknown demand distribution. Management Sci. 31(9):1150–1160.Link, Google Scholar
• Ban GY, Keskin NB (2021) Personalized dynamic pricing with machine learning: High-dimensional features and heterogeneous elasticity. Management Sci. 67(9):5549–5568.Link, Google Scholar
• Ban GY, Rudin C (2019) The big data newsvendor: Practical insights from machine learning. Oper. Res. 67(1):90–108.Link, Google Scholar
• Bennouna A, Van Parys B (2022) Holistic robust data-driven decisions. Preprint, submitted July 19, https://arxiv.org/abs/2207.09560.Google Scholar
• Besbes O, Mouchtaki O (2026) How big should your data really be? Data-driven newsvendor: Learning one sample at a time. Management Sci. 69(10):5848–5865.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, Zeevi A (2009) Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms. Oper. Res. 57(6):1407–1420.Link, Google Scholar
• Besbes O, Zeevi A (2011) On the minimax complexity of pricing in a changing environment. Oper. Res. 59(1):66–79.Link, Google Scholar
• Besbes O, Ma W, Mouchtaki O (2022) Beyond IID: Data-driven decision-making in heterogeneous environments. Adv. Neural Inform. Processing vol. 35 (Curran Associates Inc., Red Hook, NY), 23979–23991.Google Scholar
• Besbes O, Ma W, Mouchtaki O (2026). From contextual data to newsvendor decisions: On the actual performance of data-driven algorithms. Management Sci., ePub ahead of print May 14, https://doi.org/10.1287/mnsc.2023.02068Google Scholar
• Bu J, Simchi-Levi D, Xu Y (2022) Online pricing with offline data: Phase transition and inverse square law. Management Sci. 68(12):8568–8588.Google Scholar
• Bu J, Simchi-Levi D, Xu Y, Zhai CWS (2025) Feature-based dynamic pricing with online learning and offline data. Preprint, submitted May 20, https://dx.doi.org/10.2139/ssrn.5261068.Google Scholar
• Chan G, Van Parys B, Bennouna A (2024) From distributional robustness to robust statistics: A confidence sets perspective. Preprint, submitted October 17, https://arxiv.org/abs/2410.14008.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
• Cheung WC, Lyu L (2024) Leveraging (biased) information: Multi-armed bandits with offline data. Preprint, submitted May 4, https://arxiv.org/abs/2405.02594.Google Scholar
• Chu LY, Shanthikumar JG, Shen ZJM (2008) Solving operational statistics via a Bayesian analysis. Oper. Res. Lett. 36(1):110–116.Crossref, Google Scholar
• Clautiaux F, Ljubić I (2025) Last fifty years of integer linear programming: A focus on recent practical advances. Eur. J. Oper. Res. 324(3):707–731.Crossref, Google Scholar
• Cohen MC, Lobel I, Paes Leme R (2020) Feature-based dynamic pricing. Management Sci. 66(11):4921–4943.Link, Google Scholar
• DeHoratius N, Mersereau AJ, Schrage L (2008) Retail inventory management when records are inaccurate. Manufacturing Service Oper. Management 10(2):257–277.Link, Google Scholar
• Den Boer AV (2015) Dynamic pricing and learning: Historical origins, current research, and new directions. Surveys Oper. Res. Management Sci. 20(1):1–18.Crossref, Google Scholar
• den Boer AV, Keskin NB (2022) Dynamic pricing with demand learning and reference effects. Management Sci. 68(10):7112–7130.Link, Google Scholar
• Ding X, Puterman ML, Bisi A (2002) The censored newsvendor and the optimal acquisition of information. Oper. Res. 50(3):517–527.Link, Google Scholar
• Draper NR, Van Nostrand RC (1979) Ridge regression and james-stein estimation: Review and comments. Technometrics 21(4):451–466.Crossref, Google Scholar
• Dvoretzky A, Kiefer J, Wolfowitz J (1956) Asymptotic minimax character of the sample distribution function and of the classical multinomial estimator. Ann. Math. Statist. 27(3):642–669.Crossref, Google Scholar
• Elmachtoub AN, Grigas P (2022) Smart “predict, then optimize”. Management Sci. 68(1):9–26.Link, Google Scholar
• Gallien J, Mersereau AJ, Garro A, Mora AD, Vidal MN (2015) Initial shipment decisions for new products at Zara. Oper. Res. 63(2):269–286.Link, Google Scholar
• Gao R, Chen X, Kleywegt AJ (2024) Wasserstein distributionally robust optimization and variation regularization. Oper. Res. 72(3):1177–1191.Link, Google Scholar
• Gill RD, Vardi Y, Wellner JA (1988) Large sample theory of empirical distributions in biased sampling models. Ann. Statist. 16(3):1069–1112.Google Scholar
• Godfrey GA, Powell WB (2001) An adaptive, distribution-free algorithm for the newsvendor problem with censored demands, with applications to inventory and distribution. Management Sci. 47(8):1101–1112.Link, 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
• Huh WT, Levi R, Rusmevichientong P, Orlin JB (2011) Adaptive data-driven inventory control with censored demand based on Kaplan-Meier estimator. Oper. Res. 59(4):929–941.Link, Google Scholar
• Javanmard A, Nazerzadeh H (2019) Dynamic pricing in high-dimensions. J. Machine Learn. Res. 20(9):1–49.Google Scholar
• Karlin S (1960) Dynamic inventory policy with varying stochastic demands. Management Sci. 6(3):231–258.Link, Google Scholar
• Keskin NB, Zeevi A (2014) Dynamic pricing with an unknown demand model: Asymptotically optimal semi-myopic policies. Oper. Res. 62(5):1142–1167.Link, Google Scholar
• Klein C (2015) Why coca-cola’s ‘new coke’ flopped. Accessed June 14, 2025, https://www.history.com/articles/why-coca-cola-new-coke-flopped,history.com.Google Scholar
• Kuhn D, Esfahani PM, Nguyen VA, Shafieezadeh-Abadeh S (2019) Wasserstein distributionally robust optimization: Theory and applications in machine learning. Operations Research & Management Science in the Age of Analytics (INFORMS, Cantonsville, MD), 130–166.Link, Google Scholar
• Lange S, Gabel T, Riedmiller M (2012) Batch reinforcement learning. Wiering M, van Otterlo M, eds. Reinforcement Learning Adaptation, Learning, and Optimization, vol. 12 (Springer, Berlin, Heidelberg).Crossref, Google Scholar
• Lariviere MA, Porteus EL (1999) Stalking information: Bayesian inventory management with unobserved lost sales. Management Sci. 45(3):346–363.Link, 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
• Levine S, Kumar A, Tucker G, Fu J (2020) Offline reinforcement learning: Tutorial, review, and perspectives on open problems. Preprint, submitted May 4, https://arxiv.org/abs/2005.01643.Google Scholar
• Lim AE, Shanthikumar JG (2007) Relative entropy, exponential utility, and robust dynamic pricing. Oper. Res. 55(2):198–214.Link, Google Scholar
• Lin KY (2006) Dynamic pricing with real-time demand learning. Eur. J. Oper. Res. 174(1):522–538.Crossref, 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
• Liu S, Liu M (2026) Decision-focused optimal transport. Preprint, submitted February 2, https://arxiv.org/abs/2602.02800.Google Scholar
• Liu M, Cao J, Shen ZJM (2022) Learning from click transition data: Effectiveness of greedy pricing policy under dynamic product availability. Preprint, submitted July 22, https://doi.org/10.2139/ssrn.4158054.Google Scholar
• Liyanage LH, Shanthikumar JG (2005) A practical inventory control policy using operational statistics. Oper. Res. Lett. 33(4):341–348.Crossref, Google Scholar
• Lu X, Song JS, Zhu K (2008) Analysis of perishable-inventory systems with censored demand data. Oper. Res. 56(4):1034–1038.Link, Google Scholar
• Mohajerin Esfahani P, Kuhn D (2018) Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Math. Programming 171(1):115–166.Crossref, Google Scholar
• Morello P (2024) How amazon uses real-time data and dynamic pricing to maximize profits. Accessed July 24, 2025, https://www.pricefy.io/articles/amazon-real-time-data-dynamic-pricing.Google Scholar
• Natarajan K, Sim M, Uichanco J (2018) Asymmetry and ambiguity in newsvendor models. Management Sci. 64(7):3146–3167.Link, Google Scholar
• Perakis G, Roels G (2008) Regret in the newsvendor model with partial information. Oper. Res. 56(1):188–203.Link, Google Scholar
• Popescu I, Wu Y (2007) Dynamic pricing strategies with reference effects. Oper. Res. 55(3):413–429.Link, Google Scholar
• Rusmevichientong P, Tsitsiklis JN (2010) Linearly parameterized bandits. Math. Oper. Res. 35(2):395–411.Link, Google Scholar
• Saghafian S, Tomlin B (2016) The newsvendor under demand ambiguity: Combining data with moment and tail information. Oper. Res. 64(1):167–185.Link, Google Scholar
• Sahoo R, Lei L, Wager S (2022) Learning from a biased sample. Preprint, submitted September 5, https://arxiv.org/abs/2209.01754.Google Scholar
• Scarf H (1959) Bayes solutions of the statistical inventory problem. Ann. Math. Statist. 30(2):490–508.Crossref, Google Scholar
• Scarf HE, Arrow K, Karlin S (1957) A Min-Max Solution of an Inventory Problem (Rand Corporation, Santa Monica, CA).Google Scholar
• See CT, Sim M (2010) Robust approximation to multiperiod inventory management. Oper. Res. 58(3):583–594.Link, Google Scholar
• Sentenac F, Lee I, Szepesvari C (2025) Balancing optimism and pessimism in offline-to-online learning. Preprint, submitted February 12, https://arxiv.org/abs/2502.08259.Google Scholar
• Shapiro A (2003) Monte Carlo sampling methods. Handbooks in Operations Research and Management Science, vol. 10 (Elsevier, Amsterdam), 353–425.Crossref, Google Scholar
• Shi C, Chen W, Duenyas I (2016) Nonparametric data-driven algorithms for multiproduct inventory systems with censored demand. Oper. Res. 64(2):362–370.Link, Google Scholar
• Shukla N, Kolbeinsson A, Otwell K, Marla L, Yellepeddi K (2019) Dynamic pricing for airline ancillaries with customer context. Proc. 25th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (KDD '19) (Association for Computing Machinery, New York), 2174–2182.Google Scholar
• Si N, Zhang F, Zhou Z, Blanchet J (2023) Distributionally robust batch contextual bandits. Management Sci. 69(10):5772–5793.Link, Google Scholar
• Siegel AF, Wagner MR (2023) Data-driven profit estimation error in the newsvendor model. Oper. Res. 71(6):2146–2157.Link, Google Scholar
• Van Parys BP, Esfahani PM, Kuhn D (2021) From data to decisions: Distributionally robust optimization is optimal. Management Sci. 67(6):3387–3402.Link, Google Scholar
• Vardi Y (1985) Empirical distributions in selection bias models. Ann. Statist. 13(1):178–203.Crossref, Google Scholar
• Vielma JP (2015) Mixed integer linear programming formulation techniques. SIAM Rev. 57(1):3–57.Crossref, Google Scholar
• Villani C (2009) Optimal Transport: Old and New, vol. 338 (Springer, Berlin).Google Scholar
• Waller M, Boccasam VP (2013) How sharing data drives supply chain innovation. Accessed July 24, 2025, https://www.industryweek.com/supply-chain/supplier-relationships/article/21960963/how-sharing-data-drives-supply-chain-innovation.Google Scholar
• Walmart Inc. (2024) Walmart data ventures signals growth at inspire, announces new name for insights ecosystem. Accessed July 11, 2025, https://corporate.walmart.com/news/2024/10/02/walmart-data-ventures-signals-growth-at-inspire-announces-new-name-for-insights-ecosystem.Google Scholar
• Weiss K, Khoshgoftaar TM, Wang D (2016) A survey of transfer learning. J. Big Data 3(1):9.Crossref, Google Scholar
• Wohlsen M (2015) The amazon fire phone was always going to fail. Accessed June 14, 2025, https://www.wired.com/2015/01/amazon-fire-phone-always-going-fail.Google Scholar
• Yoder S, Visich JK, Rustambekov E (2016) Lessons learned from international expansion failures and successes. Bus. Horizons 59(2):233–243.Crossref, Google Scholar
• Zhang Z, Ahn HS, 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 M, Ahn HS, Uichanco J (2022) Data-driven pricing for a new product. Oper. Res. 70(2):847–866.Link, 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
• Zheng H, Luo X, Wei P, Song X, Li D, Jiang J (2023) Adaptive policy learning for offline-to-online reinforcement learning. Proc. Thirty-Seventh AAAI Conf. Artificial Intelligence Thirty-Fifth Conf. Innovative Appl. Artificial Intelligence Thirteenth Sympos. Educational Adv. Artificial Intelligence (AAAI'23/IAAI'23/EAAI'23), vol. 37 (AAAI Press, Palo Alto, CA), 11372–11380.Google Scholar