Calibrating Sales Forecasts in a Pandemic Using Competitive Online Nonparametric Regression

Published Online:https://doi.org/10.1287/mnsc.2023.4969

References

  • AB InBev (2019) Annual report 2019. https://www.ab-inbev.com/investors/annual-and-half-year-reports.html.Google Scholar
  • Ayer M, Brunk HD, Ewing GM, Reid WT, Silverman, E (1955) An empirical distribution function for sampling with incomplete information. Ann. Math. Statist. 26(4):641–647.CrossrefGoogle Scholar
  • Ban G-Y, Keskin NB (2020) Personalized dynamic pricing with machine learning: High dimensional features and heterogeneous elasticity. Management Sci. 67(9):5549–5568.LinkGoogle Scholar
  • Ban G-Y, Rudin C (2018) The big data newsvendor: Practical insights from machine learning. Oper. Res. 67(1):90–108.LinkGoogle Scholar
  • Besbes O, Gur Y, Zeevi A (2014) Stochastic multi-armed bandit with non-stationary rewards. NIPS’14: Proc. 27th Internat. Conf. Neural Inform. Processing Systems (ACM, New York), 199–207.Google Scholar
  • Brown L (2016) A-b InBev finalizes $100b billion acquisition of SABMiller, creating world’s largest beer company. Chicago Tribune (October 11), https://www.chicagotribune.com/business/ct-megabrew-ab-inbev-sabmiller-merger-20161010-story.html.Google Scholar
  • Brunk HD (1958) On the estimation of parameters restricted by inequalities. Ann. Math. Statist. 29:437–454.CrossrefGoogle Scholar
  • Bubeck S, Cesa-Bianchi N (2012) Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations Trends Machine Learn. 5(1):1–122.CrossrefGoogle Scholar
  • Caro F, Kök AG, Martínez-de-Albéniz V (2020) The future of retail operations. Manufacturing Services Oper. Management 22(1):47–58.LinkGoogle Scholar
  • Cesa-Bianchi N, Lugosi G (2006) Prediction, Learning, and Games (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Chen Y, Lee C-W, Luo H, Wei C-Y (2019) A new algorithm for non-stationary contextual bandits: Efficient, optimal, and parameter-free. Proc. 32nd Conf. on Learning Theory (PMLR, New York), vol. 99, 696–726.Google Scholar
  • Cheung WC, Simchi-Levi D, Zhu R (2019) Hedging the drift: Learning to optimize under non-stationarity. Preprint, submitted March 4, https://arxiv.org/abs/1903.01461.Google Scholar
  • Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to Algorithms (MIT Press, Cambridge, MA).Google Scholar
  • Cui R, Zhang DJ, Bassamboo A (2018) Learning from inventory availability information: Evidence from field experiments on Amazon. Management Sci. 65(3):1216–1235.LinkGoogle Scholar
  • Cui R, Allon G, Bassamboo A, Van Mieghem JA (2015) Information sharing in supply chains: An empirical and theoretical valuation. Management Sci. 61(11):2803–2824.LinkGoogle Scholar
  • den Boer AV, Keskin NB (2020) Discontinuous demand functions: Estimation and pricing. Management Sci. 66(10):4516–4534.LinkGoogle Scholar
  • Dette H, Pilz K (2006) A comparative study of monotone nonparametric kernel estimates. Technical Report No. 2004,21, Universität Dortmund, Dortmund, Germany.Google Scholar
  • Dette H, Neumeyer N, Pilz K (2006) A simple non-parametric estimator of a monotone regression function. Bernoulli. 12(3):469–490.CrossrefGoogle Scholar
  • Dong E, Du H, Gardner L (2020) An interactive web-based dashboard to track covid-19 in real time. Lancet Infect. Dis. 20(5):533–534.CrossrefGoogle Scholar
  • Feng Q, Luo S, Zhang D (2014) Dynamic inventory–pricing control under backorder: Demand estimation and policy optimization. Manufacturing Service Oper. Management 16(1):149–160.LinkGoogle Scholar
  • Filippi S, Cappe O, Garivier A, Szepesvari C (2010) Parametric bandits: The generalized linear case. NIPS’10: Proc. 23rd Internat. Conf. Neural Inform. Processing Systems (ACM, New York).Google Scholar
  • Gaillard P, Gerchinovitz S (2015) A chaining algorithm for online nonparametric regression. Proc. 28th Conf. on Learning Theory (PMLR, New York), vol. 40, 764–796.Google Scholar
  • Harrison JM, Keskin NB, Zeevi A (2012) Bayesian dynamic pricing policies: Learning and earning under a binary prior distribution. Management Sci. 58(3):570–586.LinkGoogle Scholar
  • Hazan E, Agarwal A, Kale S (2007) Logarithmic regret algorithms for online convex optimization. Machine Learning 69:169–192.CrossrefGoogle Scholar
  • Kakade SM, Kanade V, Shamir O, Kalai A (2011) Efficient learning of generalized linear and single index models with isotonic regression. NIPS 2011: Proc. 24th Internat. Conf. Neural Inform. Processing Systems (ACM, New York).Google Scholar
  • Kermack WO, McKendrick AG (1927) A contribution to the mathematical theory of epidemics. Proc. Royal Soc. London Ser. A 115(772):700–721.CrossrefGoogle Scholar
  • Kivinen J, Warmuth MK (1997) Exponentiated gradient vs. gradient descent for linear predictors. Inform. Comput. 132(1):1–63.CrossrefGoogle Scholar
  • Kotlowski W, Koolen WM, Malek A (2016) Online isotonic regression. 29th Annual Conf. Learning Theory, vol. 49, 1165–1189.Google Scholar
  • Kotlowski W, Koolen WM, Malek A (2017) Random permutation online isotonic regression. NIPS 2017: Proc. 30th Internat. Conf. Neural Inform. Processing Systems (ACM, New York).Google Scholar
  • Li X, Zheng Y, Zhou Z, Zheng Z (2018) Demand prediction, predictive shipping, and product allocation for large-scale e-commerce. Preprint, submitted November 27, https://ssrn.com/abstract=3277125.Google Scholar
  • Littlestone N, Warmuth MK (1994) The weighted majority algorithm. Inform. Comput. 108(2):212–261.CrossrefGoogle Scholar
  • Ma W, Simchi-Levi D, Zhao J (2020) Dynamic pricing (and assortment) under a static calendar. Management Sci. 67(4):2292–2313.LinkGoogle Scholar
  • Rakhlin A, Sridharan K (2014) Online non-parametric regression. Proc. 27th Conf. on Learning Theory, vol. 35, 1232–1264.Google Scholar
  • Robertson T, Wright FT, Dykstra RL (1988) Order Restricted Statistical Inference (John Wiley & Sons, Hoboken, NJ).Google Scholar
  • van de Geer S (1990) Estimating a regression function. Ann. Statist. 18(2):907–924.CrossrefGoogle Scholar
  • Vovk V (1997) Competitive on-line linear regression. NIPS 1997: Proc. 10th Internat. Conf. Neural Inform. Processing Systems (ACM, New York).Google Scholar
  • World Health Organization (2020) Coronavirus disease (covid-19) pandemic. Accessed October 29, 2023, https://www.who.int/emergencies/diseases/novel-coronavirus-2019.Google Scholar
  • Zhang C-H (2002) Risk bounds in isotonic regression. Ann. Statist. 30(2):528–555.CrossrefGoogle Scholar
  • Zhou Z, Xu R, Blanchet J (2019) Learning in generalized linear contextual bandits with stochastic delays. NIPS 2019: Proc. 32nd Internat. Conf. Neural Inform. Processing Systems (ACM, New York).Google Scholar
  • Zhou Z, Xu R, Blanchet J (2020) Delay-adaptive learning in generalized linear contextual bandits. Preprint, submitted March 11, https://arxiv.org/abs/2003.05174.Google Scholar
  • Zinkevich M (2003) Online convex programming and generalized infinitesimal gradient ascent. Proc. 20th Internat. Conf. Machine Learning (AAAI Press, Washington, DC), 928–935.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.