A Re-Solving Heuristic with Uniformly Bounded Loss for Network Revenue Management

References

• Arlotto A, Gurvich I (2019) Uniformly bounded regret in the multi-secretary problem. Stochastic Systems 9(3):231–260.Link, Google Scholar
• Arlotto A, Xie X (2019) Logarithmic regret in the dynamic and stochastic knapsack problem. Working paper, Duke University, Durham, NC.Google Scholar
• Atar R, Reiman MI (2012) Asymptotically optimal dynamic pricing for network revenue management. Stochastic Systems 2(2):232–276.Link, Google Scholar
• Babaioff M, Immorlica N, Kempe D, Kleinberg R (2007) A knapsack secretary problem with applications. Charikar M, Jansen K, Reingold O, Rolim JDP, eds. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Lecture Notes in Computer Science, vol. 4627 (Springer-Verlag, Berlin), 16–28.Google Scholar
• Bertsekas DP (2005) Dynamic Programming and Optimal Control, vol. 1, 3rd ed. (Athena Scientific, Belmont, MA).Google Scholar
• Besbes O, Zeevi A (2012) Blind network revenue management. Oper. Res. 60(6):1537–1550.Link, Google Scholar
• Chen L, Homem-de Mello T (2010) Re-solving stochastic programming models for airline revenue management. Ann. Oper. Res. 177(1):91–114.Crossref, Google Scholar
• Cooper WL (2002) Asymptotic behavior of an allocation policy for revenue management. Oper. Res. 50(4):720–727.Link, Google Scholar
• Ferreira KJ, Simchi-Levi D, Wang H (2018) Online network revenue management using Thompson sampling. Oper. Res. 66(6):1586–1602.Link, Google Scholar
• Freedman DA (1975) On tail probabilities for martingales. Ann. Probab. 3(1):100–118.Crossref, Google Scholar
• Gallego G, van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40(8):999–1020.Link, Google Scholar
• Gallego G, van Ryzin G (1997) A multiproduct dynamic pricing problem and its applications to network yield management. Oper. Res. 45(1):24–41.Link, Google Scholar
• Jasin S (2014) Reoptimization and self-adjusting price control for network revenue management. Oper. Res. 62(5):1168–1178.Link, 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 (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, 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
• Kleinberg R (2005) A multiple-choice secretary algorithm with applications to online auctions. Proc. 16th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 630–631.Google Scholar
• Kleywegt AJ, Papastavrou JD (1998) The dynamic and stochastic knapsack problem. Oper. Res. 46(1):17–35.Link, Google Scholar
• Liu Q, van Ryzin G (2008) On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10(2):288–310.Link, Google Scholar
• Maglaras C, Meissner J (2006) Dynamic pricing strategies for multiproduct revenue management problems. Manufacturing Service Oper. Management 8(2):136–148.Link, Google Scholar
• Reiman MI, Wang Q (2008) An asymptotically optimal policy for a quantity-based network revenue management problem. Math. Oper. Res. 33(2):257–282.Link, Google Scholar
• Revuz D, Yor M (2013) Continuous Martingales and Brownian Motion, Grundlehren der mathematischen Wissenschaften, vol. 293 (Springer Science & Business Media, Berlin).Google Scholar
• Secomandi N (2008) An analysis of the control-algorithm re-solving issue in inventory and revenue management. Manufacturing Service Oper. Management 10(3):468–483.Link, Google Scholar
• Talluri K, van Ryzin G (1998) An analysis of bid-price controls for network revenue management. Management Sci. 44(11):1577–1593.Link, Google Scholar
• Talluri K, van Ryzin G (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.Link, Google Scholar
• Talluri KT, van Ryzin GJ (2006) The Theory and Practice of Revenue Management, International Series in Operations Research & Management Science, vol. 68 (Springer Science & Business Media, Berlin).Google Scholar
• Vera A, Banerjee S (2019) The Bayesian prophet: A low-regret framework for online decision making. Working paper, Cornell University, Ithaca, NY.Google Scholar
• Williamson EL (1992) Airline network seat inventory control: Methodologies and revenue impacts. PhD thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Wu H, Srikant R, Liu X, Jiang C (2015) Algorithms with logarithmic or sublinear regret for constrained contextual bandits. Cortes C, Lawrence ND, Lee DD, Sugiyama M, Garnett R, eds. Advances in Neural Information Processing Systems (Curran Associates, Red Hook, NY), 433–441.Google Scholar