Online Resource Allocation with Convex-Set Machine-Learned Advice

References

• Agrawal S, Wang Z, Ye Y (2014) A dynamic near-optimal algorithm for online linear programming. Oper. Res. 62(4):876–890.Link, Google Scholar
• Antoniadis A, Gouleakis T, Kleer P, Kolev P (2020) Secretary and online matching problems with machine learned advice. Preprint, submitted June 1, https://arxiv.org/abs/2006.01026.Google Scholar
• Ball MO, Queyranne M (2009) Toward robust revenue management: Competitive analysis of online booking. Oper. Res. 57(4):950–963.Link, Google Scholar
• Balseiro S, Kroer C, Kumar R (2022) Single-leg revenue management with advice. Preprint, submitted February 18, https://arxiv.org/abs/2202.10939.Google Scholar
• Bertsimas D, Brown DB (2009) Constructing uncertainty sets for robust linear optimization. Oper. Res. 57(6):1483–1495.Link, Google Scholar
• Bertsimas D, Dunning I, Lubin M (2016) Reformulation versus cutting-planes for robust optimization. Comput. Management Sci. 13(2):195–217.Crossref, Google Scholar
• Bertsimas D, Gupta V, Kallus N (2018) Data-driven robust optimization. Math. Programming 167(2):235–292.Crossref, Google Scholar
• Brumelle SL, McGill JI (1993) Airline seat allocation with multiple nested fare classes. Oper. Res. 41(1):127–137.Link, Google Scholar
• Buchbinder N, Jain K, Naor JS (2007) Online primal-dual algorithms for maximizing ad-auctions revenue. Proc. Eur. Sympos. Algorithms, Lecture Notes in Computer Science, vol. 4698 (Springer, Berlin), 253–264.Crossref, 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 G, Li X, Ye Y (2024) An improved analysis of LP-based control for revenue management. Oper. Res. 72(3):1124–1138.Link, Google Scholar
• Cheramin M, Chen RLY, Cheng J, Pinar A (2021) Data-driven robust optimization using scenario-induced uncertainty sets. Preprint, submitted July 11, https://arxiv.org/abs/2107.04977.Google Scholar
• Devanur NR, Hayes TP (2009) The adwords problem: Online keyword matching with budgeted bidders under random permutations. Proc. 10th ACM Conf. Electronic Commerce (ACM, New York), 71–78.Google Scholar
• Esfandiari H, Korula N, Mirrokni V (2015) Online allocation with traffic spikes: Mixing adversarial and stochastic models. Proc. 16th ACM Conf. Econom. Comput. (ACM, New York), 169–186.Google Scholar
• Feldman J, Henzinger M, Korula N, Mirrokni VS, Stein C (2010) Online stochastic packing applied to display ad allocation. de Berg M, Meyer U, eds. Algorithms – ESA 2010: 18th Annual Eur. Sympos., Lecture Notes in Computer Science, vol. 6346 (Springer, Berlin), 182–194.Crossref, Google Scholar
• Gärtner B, Schönherr S (1997) Smallest Enclosing Ellipses: Fast and Exact, Serie B – Informatik B 97-03 (Freie Universität Berlin, Berlin).Google Scholar
• Golrezaei N, Yao E (2026) Upfront commitment in online resource allocation with patient customers. Management Sci. 72(5):4087–4105.Google Scholar
• Golrezaei N, Jaillet P, Zhou Z (2022) Online resource allocation with samples. Preprint, submitted April 20, http://dx.doi.org/10.2139/ssrn.4054796.Google Scholar
• Golrezaei N, Nazerzadeh H, Rusmevichientong P (2014) Real-time optimization of personalized assortments. Management Sci. 60(6):1532–1551.Link, Google Scholar
• Hwang D, Jaillet P, Manshadi V (2021) Online resource allocation under partially predictable demand. Oper. Res. 69(3):895–915.Link, Google Scholar
• Jalilvand-Nejad A, Shafaei R, Shahriari H (2016) Robust optimization under correlated polyhedral uncertainty set. Comput. Industrial Engrg. 92:82–94.Crossref, Google Scholar
• Jasin S (2015) Performance of an LP-based control for revenue management with unknown demand parameters. Oper. Res. 63(4):909–915.Link, Google Scholar
• Jasin S, Kumar S (2013) Analysis of deterministic LP-based booking limit and bid price controls for revenue management. Oper. Res. 61(6):1312–1320.Link, Google Scholar
• Jin B, Ma W (2022) Online bipartite matching with advice: Tight robustness-consistency tradeoffs for the two-stage model. Preprint, submitted June 22, https://arxiv.org/abs/2206.11397.Google Scholar
• Lattanzi S, Lavastida T, Moseley B, Vassilvitskii S (2020) Online scheduling via learned weights. Proc. 14th Annual ACM-SIAM Sympos., Discrete Algorithms (SIAM, Philadelphia), 1859–1877.Google Scholar
• Littlewood K (2005) Special issue papers: Forecasting and control of passenger bookings. J. Revenue Pricing Management 4(2):111–123.Crossref, Google Scholar
• Lykouris T, Vassilvtiskii S (2018) Competitive caching with machine learned advice. Proc. 35th Internat. Conf. Machine Learn., ICML 2018, Proceedings of Machine Learning Research, vol. 80 (PMLR, New York), 3296–3305.Google Scholar
• Ma W, Simchi-Levi D, Teo CP (2021) On policies for single-leg revenue management with limited demand information. Oper. Res. 69(1):207–226.Link, Google Scholar
• Mahdian M, Nazerzadeh H, Saberi A (2012) Online optimization with uncertain information. ACM Trans. Algorithms 8(1):1–29.Crossref, Google Scholar
• Mehta A, Saberi A, Vazirani U, Vazirani V (2007) Adwords and generalized online matching. J. ACM 54(5):22.Crossref, Google Scholar
• Pearce T, Brintrup A, Zaki M, Neely A (2018) High-quality prediction intervals for deep learning: A distribution-free, ensembled approach. Proc. 35th Internat. Conf. Machine Learn., ICML 2018, Proceedings of Machine Learning Research, vol. 80 (PMLR, New York), 4075–4084.Google Scholar
• Perakis G, Roels G (2010) Robust controls for network revenue management. Manufacturing Service Oper. Management 12(1):56–76.Link, Google Scholar
• Rohatgi D (2020) Near-optimal bounds for online caching with machine learned advice. Proc. 14th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1834–1845.Google Scholar
• Wang H, Yan Z, Bei X (2022) A nonasymptotic analysis for re-solving heuristic in online matching. Production Oper. Management 31(8):3096–3124.Crossref, Google Scholar