Fluid Approximations for Revenue Management Under High-Variance Demand

Published Online:https://doi.org/10.1287/mnsc.2023.4769

References

  • Aouad A, Ma W (2022) A nonparametric framework for online stochastic matching with correlated arrivals. Technical report, London Business School, London.Google Scholar
  • Bai Y, El Housni O, Rusmevichientong P, Topaloglu H (2022) Coordinated inventory stocking and assortment personalization. Technical report, Cornell University, Ithaca, NY.Google Scholar
  • Balseiro SR, Besbes O, Pizarro D (2021) Survey of dynamic resource constrained reward collection problems: Unified model and analysis. Technical report, Columbia University, New York.Google Scholar
  • Besbes O, Saure D (2014) Dynamic pricing strategies in the presence of demand shifts. Manufacturing Service Oper. Management 16(4):513–528.LinkGoogle Scholar
  • Cooper WL (2002) Asymptotic behavior of an allocation policy for revenue management. Oper. Res. 50(4):720–727.LinkGoogle 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, CORC, Columbia 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
  • Kaggle (2021) E-commerce purchase history from an electronics store. Accessed May 30, 2022, https://www.kaggle.com/datasets/mkechinov/ecommerce-purchase-history-from-electronics-store.Google 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
  • 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 KT, van Ryzin GJ (2005) The Theory and Practice of Revenue Management (Kluwer Academic Publishers, Boston).CrossrefGoogle Scholar
  • Walczak D (2006) Modeling high demand variance in dynamic programming. J. Revenue Pricing Management 5(2):94–101.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.