On policies for single-leg revenue management with limited demand information
From MaRDI portal
Publication:4994151
DOI10.1287/OPRE.2020.2048zbMATH Open1467.91049arXiv1810.10900OpenAlexW3114472434MaRDI QIDQ4994151FDOQ4994151
Authors: Will Ma, David Simchi-Levi, Chung-Piaw Teo 
Publication date: 17 June 2021
Published in: Operations Research (Search for Journal in Brave)
Abstract: 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, Ball and Queyranne (2009) have established the tight competitive ratio for this problem using 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 from Eren and Maglaras (2010), 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.
Full work available at URL: https://arxiv.org/abs/1810.10900
Recommendations
- Revenue management with limited demand information
- Toward Robust Revenue Management: Competitive Analysis of Online Booking
- Blind network revenue management
- Dynamic pricing without knowing the demand function: risk bounds and near-optimal algorithms
- Online joint pricing and booking policies in airline revenue management
Online algorithms; streaming algorithms (68W27) Microeconomic theory (price theory and economic markets) (91B24)
Cites Work
- Relative Entropy, Exponential Utility, and Robust Dynamic Pricing
- Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons
- AdWords and generalized online matching
- Matroid prophet inequalities
- Optimal Dynamic Pricing for Perishable Assets with Nonhomogeneous Demand
- Dynamic pricing for nonperishable products with demand learning
- Dynamic pricing without knowing the demand function: risk bounds and near-optimal algorithms
- Dynamic Pricing and Learning with Finite Inventories
- Prophet Inequalities with Limited Information
- An optimal deterministic algorithm for online \(b\)-matching
- Toward Robust Revenue Management: Competitive Analysis of Online Booking
- Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching
- Revenue Management with Limited Demand Information
- Stochastic regret minimization for revenue management problems with nonstationary demands
- Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
- From pricing to prophets, and back!
Cited In (3)
This page was built for publication: On policies for single-leg revenue management with limited demand information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994151)
