On Policies for Single-Leg Revenue Management with Limited Demand Information

In this paper, we study the single-item revenue management problem, with no information given about the demand trajectory over time. When the item is sold through accepting/rejecting different fare classes, the tight competitive ratio for this problem has been established by Ball and Queyranne through booking limit policies, which raise the acceptance threshold as the remaining inventory dwindles. However, when the item is sold through dynamic pricing instead, there is the additional challenge that offering a low price may entice high-paying customers to substitute down. We show that despite this challenge, the same competitive ratio can still be achieved using a randomized dynamic pricing policy. Our policy incorporates the price-skimming technique originated by Eren and Maglaras, but importantly we show how the randomized price distribution should be stochastically increased as the remaining inventory dwindles. A key technical ingredient in our policy is a new Valuation Tracking subroutine, which tracks the possible values for the optimum, and follows the most inventory-conservative control, which maintains the desired competitive ratio. Finally, we demonstrate the empirical effectiveness of our policy in simulations, where its average-case performance surpasses all naive modifications of the existing policies.

Automated summary

This paper discusses the single-item revenue management problem and addresses the challenges of dynamic pricing, demonstrating that the same competitive ratio can be achieved through a randomized dynamic pricing policy. The policy incorporates price-skimming techniques and utilizes a Valuation Tracking subroutine to maintain the desired competitive ratio.