Toward Robust Revenue Management: Competitive Analysis of Online Booking

In this paper, we consider the revenue management problem from the perspective of online algorithms. This approach eliminates the need for both demand forecasts and a risk-neutrality assumption. The competitive ratio of a policy relative to a given input sequence is the ratio of the policy's performance to the offline optimal. Under the online algorithm approach, revenue management policies are evaluated based on the highest competitive ratio they can guarantee. We are able to define lower bounds on the best-possible performance and describe policies that achieve these lower bounds. We address the two-fare problem in greatest detail, but also treat the general multifare problem and the bid-price control problem.

[1]  Peter Belobaba,et al.  OR Practice - Application of a Probabilistic Decision Model to Airline Seat Inventory Control , 1989, Oper. Res..

[2]  Georgia Perakis,et al.  Regret in the Newsvendor Model with Partial Information , 2008, Oper. Res..

[3]  Gang Yu,et al.  Robust economic order quantity models , 1997, Eur. J. Oper. Res..

[4]  Jeffrey I. McGill,et al.  Revenue Management: Research Overview and Prospects , 1999, Transp. Sci..

[5]  D. Simchi-Levi,et al.  Minimax analysis for finite-horizon inventory models , 2001 .

[6]  G. Ryzin,et al.  Revenue Management Without Forecasting or Optimization: An Adaptive Algorithm for Determining Airline Seat Protection Levels , 2000 .

[7]  Herbert E. Scarf,et al.  A Min-Max Solution of an Inventory Problem , 1957 .

[8]  Susanne Albers,et al.  Online algorithms: a survey , 2003, Math. Program..

[9]  K. Littlewood..  Special Issue Papers: Forecasting and control of passenger bookings , 2005 .

[10]  K. Talluri,et al.  The Theory and Practice of Revenue Management , 2004 .

[11]  E. Andrew Boyd,et al.  Revenue Management and E-Commerce , 2003, Manag. Sci..

[12]  Arkadi Nemirovski,et al.  Robust solutions of Linear Programming problems contaminated with uncertain data , 2000, Math. Program..

[13]  Hiroshi Kasugai,et al.  CHARACTERISTICS OF DYNAMIC MAXIMIN ORDERING POLICY , 1960 .

[14]  Yingjie Lan,et al.  Revenue Management with Limited Demand Information , 2008, Manag. Sci..

[15]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[16]  JAMES T. LUXHØJ,et al.  Monitoring multivariate aviation safety data by data depth: control charts and threshold systems , 2000 .

[17]  Marvin Hersh,et al.  A Model for Dynamic Airline Seat Inventory Control with Multiple Seat Bookings , 1993, Transp. Sci..

[18]  Jeffrey I. McGill,et al.  Airline Seat Allocation with Multiple Nested Fare Classes , 1993, Oper. Res..

[19]  Steven S. Seiden,et al.  A guessing game and randomized online algorithms , 2000, STOC '00.

[20]  George L. Vairaktarakis,et al.  Robust multi-item newsboy models with a budget constraint , 2000 .

[21]  Shaler Stidham,et al.  The Underlying Markov Decision Process in the Single-Leg Airline Yield-Management Problem , 1999, Transp. Sci..

[22]  Garrett J. van Ryzin,et al.  Revenue Management Under a General Discrete Choice Model of Consumer Behavior , 2004, Manag. Sci..

[23]  Peter P. Belobaba,et al.  Survey Paper - Airline Yield Management An Overview of Seat Inventory Control , 1987, Transp. Sci..

[24]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .