Single-Leg Revenue Management with 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
• Alaei S, Hajiaghayi M, Liaghat V (2012) Online prophet-inequality matching with applications to ad allocation. Proc. 13th ACM Conf. Electronic Commerce (Association for Computing Machinery, New York), 18–35. Google Scholar
• Antoniadis A, Gouleakis T, Kleer P, Kolev P (2020) Secretary and online matching problems with machine learned advice. Larochelle H, Ranzato M, Hadsell R, Balcan MF, Lin H, eds. Adv. Neural Inform. Processing Systems, vol. 33 (Curran Associates Inc., Red Hook, NY), 7933–7944. Google Scholar
• Aouad A, Ma W (2023) A nonparametric framework for online stochastic matching with correlated arrivals. Proc. 24th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 114.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 SR, Gur Y (2019) Learning in repeated auctions with budgets: Regret minimization and equilibrium. Management Sci. 65(9):3952–3968.Link, Google Scholar
• Brumelle SL, McGill JI (1993) Airline seat allocation with multiple nested fare classes. Oper. Res. 41(1):127–137.Link, 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 (Association for Computing Machinery, New York), 71–78.Google Scholar
• Dinitz M, Im S, Lavastida T, Moseley B, Vassilvitskii S (2021) Faster matchings via learned duals. Ranzato M, Beygelzimer A, Dauphin Y, Liang PS, Wortman Vaughan J, eds. Adv. Neural Inform. Processing Systems, vol. 34 (Curran Associates Inc., Red Hook, NY), 10393–10406.Google Scholar
• Dütting P, Lattanzi S, Paes Leme R, Vassilvitskii S (2021) Secretaries with advice. Proc. 22nd ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 409–429.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. (Association for Computing Machinery, 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. Proc. Eur. Sympos. Algorithms, Lecture Notes in Computer Science, vol. 6346 (Springer, Berlin, Heidelberg), 182–194.Google Scholar
• Feldman J, Korula N, Mirrokni V, Muthukrishnan S, Pál M (2009) Online ad assignment with free disposal. Leonardi S, ed. Proc. Internat. Workshop Internet Network Econom., Lecture Notes in Computer Science, vol. 5929 (Springer, Berlin, Heidelberg), 374–385.Google Scholar
• Gallego G, Topaloglu H (2019) Revenue Management and Pricing Analytics, vol. 209 (Springer, New York).Crossref, Google Scholar
• Golrezaei N, Jaillet P, Zhou Z (2022) Online resource allocation with samples. Preprint, submitted October 10, https://arxiv.org/abs/2210.04774.Google Scholar
• Golrezaei N, Jaillet P, Zhou Z (2023) Online resource allocation with convex-set machine-learned advice. Preprint, submitted June 21, https://arxiv.org/abs/2306.12282.Google Scholar
• Huh WT, Rusmevichientong P (2006) Adaptive capacity allocation with censored demand data: Application of concave umbrella functions. Technical report, Cornell University, School of Operations Research, Ithaca, NY.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
• Jin B, Ma W (2022) Online bipartite matching with advice: Tight robustness-consistency tradeoffs for the two-stage model. Koyejo S, Mohamed S, Agarwal A, Belgrave D, Cho K, Oh A, eds. Adv. Neural Inform. Processing Systems, vol. 35 (Curran Associates Inc., Red Hook, NY), 14555–14567.Google Scholar
• Karp RM, Vazirani UV, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. Proc. 22nd Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 352–358.Google Scholar
• Kleinberg R (2005) A multiple-choice secretary algorithm with applications to online auctions. Proc. 16th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 630–631.Google Scholar
• Kunnumkal S, Topaloglu H (2009) A stochastic approximation method for the single-leg revenue management problem with discrete demand distributions. Math. Methods Oper. Res. 70(3):477.Crossref, Google Scholar
• Lan Y, Gao H, Ball MO, Karaesmen I (2008) Revenue management with limited demand information. Management Sci. 54(9):1594–1609.Link, Google Scholar
• Lautenbacher CJ, Stidham S Jr (1999) The underlying Markov decision process in the single-leg airline yield-management problem. Transportation Sci. 33(2):136–146.Link, Google Scholar
• Lee TC, Hersh M (1993) A model for dynamic airline seat inventory control with multiple seat bookings. Transportation Sci. 27(3):252–265.Link, 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 (2021) Competitive caching with machine learned advice. J. ACM 68(4).Google Scholar
• Ma W, Simchi-Levi D, Teo C-P (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 (2013) Online matching and ad allocation. Foundations Trends Theoretical Comput. Sci. 8(4):265–368.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
• Mirrokni VS, Gharan SO, Zadimoghaddam M (2012) Simultaneous approximations for adversarial and stochastic online budgeted allocation. Proc. 23rd Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1690–1701.Google Scholar
• Mitzenmacher M (2018) A model for learned bloom filters, and optimizing by sandwiching. Bengio S, Wallach H, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R, eds. Adv. Neural Inform. Processing Systems, vol. 31 (Curran Associates Inc., Red Hook, NY).Google Scholar
• Mitzenmacher M (2021) Queues with small advice. Bender M, Gilbert J, Hendrickson B, Sullivan BD, eds. Proc. SIAM Conf. Appl. Comput. Discrete Algorithms (SIAM, Philadelphia), 1–12.Google Scholar
• Mitzenmacher M, Vassilvitskii S (2022) Algorithms with predictions. Comm. ACM 65(7):33–35.Google Scholar
• Purohit M, Svitkina Z, Kumar R (2018) Improving online algorithms via ML predictions. Bengio S, Wallach H, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R, eds. Adv. Neural Inform. Processing Systems, vol. 31 (Curran Associates Inc., Red Hook, NY), 9661–9670.Google Scholar
• Robinson LW (1995) Optimal and approximate control policies for airline booking with sequential nonmonotonic fare classes. Oper. Res. 43(2):252–263.Link, Google Scholar
• Rohatgi D (2020) Near-optimal bounds for online caching with machine learned advice. Proc. Thirty-First Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1834–1845.Google Scholar
• Talluri KT, Van Ryzin GJ (2004) The Theory and Practice of Revenue Management, International Series in Operations Research & Management Science, vol. 68 (Springer-Verlag, New York).Crossref, Google Scholar
• Van Ryzin G, McGill J (2000) Revenue management without forecasting or optimization: An adaptive algorithm for determining airline seat protection levels. Management Sci. 46(6):760–775.Link, Google Scholar
• Zhou Y, Chakrabarty D, Lukose R (2008) Budget constrained bidding in keyword auctions and online knapsack problems. Proc. 17th Internat. Conf. World Wide Web (Association for Computing Machinery, New York), 1243–1244.Google Scholar