Technical Note—Revenue Management with Calendar-Aware and Dependent Demands: Asymptotically Tight Fluid Approximations

Published Online:https://doi.org/10.1287/opre.2023.0442

References

  • Aouad A, Ma W (2022) A nonparametric framework for online stochastic matching with correlated arrivals. Technical report, London Business School, London.Google Scholar
  • Baek J, Ma W (2022) Technical note—Bifurcating constraints to improve approximation ratios for network revenue management with reusable resources. Oper. Res. 70(4):2226–2236.LinkGoogle Scholar
  • Bai Y, El Housni O, Rusmevichientong P, Topaloglu H (2022) Coordinated inventory stocking and assortment personalization. Technical report, Cornell University, New York.Google Scholar
  • Bai Y, El Housni O, Jin B, Rusmevichientong P, Topaloglu H, Williamson DP (2023) Fluid approximations for revenue management under high-variance demand. Management Sci. 69(7):4016–4026.LinkGoogle Scholar
  • Balseiro SR, Besbes O, Pizarro D (2024) Survey of dynamic resource constrained reward collection problems: Unified model and analysis. Oper. Res. 72(5):2168–2189.LinkGoogle Scholar
  • Box GEP, Jenkins GM, Reinsel GC, Ljung GM (2015) Time Series Analysis: Forecasting and Control (John Wiley & Sons, Hoboken, NJ).Google Scholar
  • Burnside C (2001) Discrete state-space methods for the study of dynamic economies. Marimon R, Scott A, eds. Computational Methods for the Study of Dynamic Economies (Oxford University Press, New York), 95–113.CrossrefGoogle Scholar
  • Dubhashi DP, Panconesi A (2009) Concentration of Measure for the Analysis of Randomized Algorithms (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Fella G, Gallipoli G, Pan J (2019) Markov-chain approximations for life-cycle models. Rev. Econom. Dynam. 34:183–201.CrossrefGoogle Scholar
  • Feng Y, Niazadeh R, Saberi A (2022) Near-optimal Bayesian online assortment of reusable resources. Technical report, University of Chicago, Chicago.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.LinkGoogle 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.LinkGoogle Scholar
  • Gallego G, Iyengar G, Phillips R, Dubey A (2004) Managing flexible products on a network. CORC Technical Report No. TR-2004-01, Cornell University, New York.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.LinkGoogle Scholar
  • Jiang J (2023) Constant approximation for network revenue management with Markovian-correlated customer arrivals. Technical report, Hong Kong University of Science and Technology, Clear Water Bay.Google Scholar
  • Kourentzes N, Li F, Strauss AK (2019) Unconstraining methods for revenue management systems under small demand. J. Revenue Pricing Management 18:27–41.CrossrefGoogle Scholar
  • Kunnumkal S, Talluri K, Topaloglu H (2012) A randomized linear programming method for network revenue management with product-specific no-shows. Transportation Sci. 46(1):90–108.LinkGoogle Scholar
  • Liu Q, van Ryzin GJ (2008) On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10(2):288–310.LinkGoogle Scholar
  • Ma W, Simchi-Levi D, Zhao J (2021) Dynamic pricing (and assortment) under a static calendar. Management Sci. 67(4):2292–2313.LinkGoogle Scholar
  • Ma Y, Rusmevichientong P, Sumida M, Topaloglu H (2020) An approximation algorithm for network revenue management under nonstationary arrivals. Oper. Res. 68(3):834–855.LinkGoogle Scholar
  • Queenan CC, Ferguson M, Higbie J, Kapoor R (2007) A comparison of unconstraining methods to improve revenue management systems. Production Oper. Management 16(6):729–746.CrossrefGoogle Scholar
  • Rusmevichientong P, Sumida M, Topaloglu H (2020) Dynamic assortment optimization for reusable products with random usage durations. Management Sci. 66(7):2820–2844.LinkGoogle Scholar
  • Talluri K, van Ryzin G (1998) An analysis of bid-price controls for network revenue management. Management Sci. 44(11):1577–1593.LinkGoogle Scholar
  • Talluri K, van Ryzin G (1999) A randomized linear programming method for computing network bid prices. Transportation Sci. 33(2):207–216.LinkGoogle Scholar
  • Tauchen G (1986) Finite state Markov-chain approximations to univariate and vector autoregressions. Econom. Lett. 20(2):177–181.CrossrefGoogle Scholar
  • Wainwright MJ (2019) High-Dimensional Statistics: A Non-Asymptotic Viewpoint, Cambridge Series in Statistical and Probabilistic Mathematics (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Weatherford LR, Polt S (2002) Better unconstraining of airline demand data in revenue management systems for improved forecast accuracy and greater revenues. J. Revenue Pricing Management 1(3):234–254.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.