Online Demand Fulfillment Problem with Initial Inventory Placement: A Regret Analysis

References

• Acimovic J, Farias VF (2019) The fulfillment-optimization problem. Netessine S, ed. Operations Research & Management Science in the Age of Analytics, TutORials in Operations Research (INFORMS, Catonsville, MD), 218–237.Link, Google Scholar
• Acimovic J, Graves SC (2015) Making better fulfillment decisions on the fly in an online retail environment. Manufacturing Service Oper. Management 17(1):34–51.Link, Google Scholar
• Acimovic J, Graves SC (2017) Mitigating spillover in online retailing via replenishment. Manufacturing Service Oper. Management 19(3):419–436.Link, Google Scholar
• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Pearson, London).Google Scholar
• Andrews JM, Farias VF, Khojandi AI, Yan CM (2019) Primal–dual algorithms for order fulfillment at Urban Outfitters, Inc. INFORMS J. Appl. Anal. 49(5):355–370.Link, Google Scholar
• Arlotto A, Gurvich I (2019) Uniformly bounded regret in the multisecretary problem. Stochastic Systems 9(3):231–260.Link, Google Scholar
• Asadpour A, Wang X, Zhang J (2020) Online resource allocation with limited flexibility. Management Sci. 66(2):642–666.Link, 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
• Berend D, Kontorovich A (2012) On the convergence of the empirical distribution. Preprint, submitted June 5, https://arxiv.org/abs/1205.6711.Google Scholar
• Billingsley P (2017) Probability and Measure (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Bumpensanti P, Wang H (2020) A re-solving heuristic with uniformly bounded loss for network revenue management. Management Sci. 66(7):2993–3009.Link, Google Scholar
• Chen AI, Graves SC (2021) Item aggregation and column generation for online-retail inventory placement. Manufacturing Service Oper. Management 23(5):1062–1076.Link, Google Scholar
• Chen X, Feldman J, Jung SH, Kouvelis P (2022) Approximation schemes for the joint inventory selection and online resource allocation problem. Production Oper. Management 31(8):3143–3159.Crossref, Google Scholar
• DeValve L, Wei Y, Wu D, Yuan R (2023) Understanding the value of fulfillment flexibility in an online retailing environment. Manufacturing Service Oper. Management 25(2):391–408.Link, Google Scholar
• Epstein B, Ma W (2024) Optimizing inventory placement for a downstream online matching problem. Preprint, submitted March 7, https://arxiv.org/abs/2403.04598v1.Google Scholar
• Govindarajan A, Sinha A, Uichanco J (2021) Joint inventory and fulfillment decisions for omnichannel retail networks. Naval Res. Logist. 68(6):779–794.Crossref, Google Scholar
• Jasin S, Kumar S (2012) A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Math. Oper. Res. 37(2):313–345.Link, Google Scholar
• Jasin S, Sinha A (2015) An LP-based correlated rounding scheme for multi-item ecommerce order fulfillment. Oper. Res. 63(6):1336–1351.Link, Google Scholar
• Jasin S, Liu S, Zhao J (2024) Inventory allocation under the greedy fulfillment policy: The (potential) perils of the hindsight approach. Preprint, submitted May 3, https://dx.doi.org/10.2139/ssrn.4815848.Google Scholar
• Jiang J, Ma W, Zhang J (2025) Degeneracy is OK: Logarithmic regret for network revenue management with indiscrete distributions. Oper. Res. 73(6):3405–3420.Link, Google Scholar
• Ma W (2023) Order-optimal correlated rounding for fulfilling multi-item e-commerce orders. Manufacturing Service Oper. Management 25(4):1324–1337.Link, Google Scholar
• Mangasarian OL, Shiau TH (1987) Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems. SIAM J. Control Optim. 25(3):583–595.Crossref, Google Scholar
• Shevtsova I (2011) On the absolute constants in the Berry-Esseen type inequalities for identically distributed summands. Preprint, submitted November 28, https://arxiv.org/abs/1111.6554.Google Scholar
• Statista Research Department (2021) Global retail e-commerce sales 2014-2025. Accessed February 4, 2026, https://www.statista.com/statistics/379046/worldwide-retail-e-commerce-sales/.Google Scholar
• Statista Research Department (2022) United States: Retail e-commerce revenue 2017-2025. Accessed February 4, 2026, https://www.statista.com/chart/17207/amazon-shipping-and-fulfillment-costs/.Google Scholar
• Vera A, Banerjee S (2021) The Bayesian prophet: A low-regret framework for online decision making. Management Sci. 67(3):1368–1391.Link, Google Scholar
• Vera A, Banerjee S, Gurvich I (2021) Online allocation and pricing: Constant regret via Bellman inequalities. Oper. Res. 69(3):821–840.Link, Google Scholar
• Vera A, Arlotto A, Gurvich I, Levin E (2025) Dynamic resource allocation: The geometry and robustness of constant regret. Math. Oper. Res. 50(4):2834–2872.Link, Google Scholar
• Xu Z, Zhang H, Zhang J, Zhang RQ (2020) Online demand fulfillment under limited flexibility. Management Sci. 66(10):4667–4685.Link, Google Scholar
• Zhao Y, Wang X, Xin L (2025) Multi-item online order fulfillment in a two-layer network. Oper. Res. 73(5):2297–2866.Link, Google Scholar