[15] Gábor Lugosi, Mihalis G Markakis, and Gergely Neu. On the hardness of inventory management with censored demand data. arXiv preprint arXiv:1710.05739, 2017.
[16] Mehrdad Mahdavi, Rong Jin, and Tianbao Yang. Trading regret for efficiency: online convex optimization with long term constraints. The Journal of Machine Learning Research, 13(1):2503-2528, 2012.
[17] Spyros Makridakis, Evangelos Spiliotis, and Vassilios Assimakopoulos. The m5 competition: Background, organization, and implementation. International Journal of Forecasting, 38(4):1325-1336, 2022.
[18] Shie Mannor, John N Tsitsiklis, and Jia Yuan Yu. Online learning with sample path constraints. Journal of Machine Learning Research, 10(3), 2009.
[19] Steven Nahmias. Perishable inventory systems, volume 160. Springer Science & Business Media, 2011.
[20] Michael J Neely and Hao Yu. Online convex optimization with time-varying constraints. arXiv preprint arXiv:1702.04783, 2017.
[21] Francesco Orabona. A modern introduction to online learning. arXiv preprint arXiv:1912.13213, 2019.
[22] Francesco Orabona and David Pál. Scale-free online learning. Theoretical Computer Science, 716:50-69, 2018.
[23] Herbert Scarf. Bayes solutions of the statistical inventory problem. The annals of mathematical statistics, 30(2):490-508, 1959.
[24] Peter Sempolinski and Amitabh Chaudhary. Online algorithms for the newsvendor problem with and without censored demands. In Frontiers in Algorithmics: 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010. Proceedings 4, pages 234-249. Springer, 2010.
[25] Cong Shi, Weidong Chen, and Izak Duenyas. Nonparametric data-driven algorithms for multiproduct inventory systems with censored demand. Operations Research, 64(2):362-370, 2016.
[26] Lawrence V Snyder and Zuo-Jun Max Shen. Fundamentals of supply chain theory. John Wiley & Sons, 2019.
[27] Matthew Streeter and H Brendan McMahan. Less regret via online conditioning. arXiv preprint arXiv:1002.4862, 2010.
[28] Wen Sun, Debadeepta Dey, and Ashish Kapoor. Safety-aware algorithms for adversarial contextual bandit. In International Conference on Machine Learning, pages 3280-3288. PMLR, 2017.
[29] Roman Vershynin. High-dimensional probability: An introduction with applications in data science, volume 47. Cambridge university press, 2018.
[30] Harvey M Wagner and Thomson M Whitin. Dynamic version of the economic lot size model. Management science, 5(1):89-96, 1958.
[31] Hao Yuan, Qi Luo, and Cong Shi. Marrying stochastic gradient descent with bandits: Learning algorithms for inventory systems with fixed costs. Management Science, 67(10):6089-6115, 2021.
[32] Huanan Zhang, Xiuli Chao, and Cong Shi. Perishable inventory systems: Convexity results for base-stock policies and learning algorithms under censored demand. Operations Research, 66(5):1276-1286, 2018.
[33] Huanan Zhang, Xiuli Chao, and Cong Shi. Closing the gap: A learning algorithm for lost-sales inventory systems with lead times. Management Science, 66(5):1962-1980, 2020.
[34] Yong Zhang, Vladimir Vovk, and Weiguo Zhang. Probability-free solutions to the non-stationary newsvendor problem. Annals of Operations Research, 223(1):433-449, 2014.
[35] Yong Zhang, Xingyu Yang, and Baixun Li. Distribution-free solutions to the extended multi-period newsboy problem. Journal of Industrial & Management Optimization, 13(2):633, 2017.
[36] Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the 20th international conference on machine learning (icml-03), pages 928–936, 2003.