IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v69y2023i7p4016-4026.html

Fluid Approximations for Revenue Management Under High-Variance Demand

Author

Listed:
  • Yicheng Bai

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853)

  • Omar El Housni

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853)

  • Billy Jin

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853)

  • Paat Rusmevichientong

    (Marshall School of Business, University of Southern California, Los Angeles, California 90089)

  • Huseyin Topaloglu

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853)

  • David P. Williamson

    (School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853)

Abstract

One of the most prevalent demand models in the revenue management literature is based on dividing the selling horizon into a number of time periods such that there is at most one customer arrival at each time period. This demand model is equivalent to using a discrete-time approximation to a Poisson process, but it has an important shortcoming. If the mean number of customer arrivals is large, then the coefficient of variation of the number of customer arrivals has to be small. In other words, large demand volume and large demand variability cannot coexist in this demand model. In this paper, we start with a revenue management model that incorporates general mean and variance for the number of customer arrivals. This revenue management model has a random selling horizon length, capturing the distribution of the number of customer arrivals. The question we seek to answer is the form of the fluid approximation that corresponds to this revenue management model. It is tempting to construct the fluid approximation by computing the expected consumption of the resource capacities in the constraints and the total expected revenue in the objective function through the distribution of the number of customer arrivals. We demonstrate that this answer is wrong in the sense that it yields a fluid approximation that is not asymptotically tight as the resource capacities get large. We give an alternative fluid approximation where perhaps surprisingly, the distribution of the number of customer arrivals does not play any role in the constraints. We show that this fluid approximation is asymptotically tight as the resource capacities get large. A numerical study also demonstrates that the policies driven by the latter fluid approximation perform substantially better, so there is practical value in getting the fluid approximation right under high-variance demand.

Suggested Citation

  • Yicheng Bai & Omar El Housni & Billy Jin & Paat Rusmevichientong & Huseyin Topaloglu & David P. Williamson, 2023. "Fluid Approximations for Revenue Management Under High-Variance Demand," Management Science, INFORMS, vol. 69(7), pages 4016-4026, July.
  • Handle: RePEc:inm:ormnsc:v:69:y:2023:i:7:p:4016-4026
    DOI: 10.1287/mnsc.2023.4769
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2023.4769
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2023.4769?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. William L. Cooper, 2002. "Asymptotic Behavior of an Allocation Policy for Revenue Management," Operations Research, INFORMS, vol. 50(4), pages 720-727, August.
    2. Guillermo Gallego & Garrett van Ryzin, 1997. "A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management," Operations Research, INFORMS, vol. 45(1), pages 24-41, February.
    3. Guillermo Gallego & Garrett van Ryzin, 1994. "Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons," Management Science, INFORMS, vol. 40(8), pages 999-1020, August.
    4. Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "Dynamic Assortment Optimization for Reusable Products with Random Usage Durations," Management Science, INFORMS, vol. 66(7), pages 2820-2844, July.
    5. Kalyan Talluri & Garrett van Ryzin, 1998. "An Analysis of Bid-Price Controls for Network Revenue Management," Management Science, INFORMS, vol. 44(11-Part-1), pages 1577-1593, November.
    6. Omar Besbes & Denis Sauré, 2014. "Dynamic Pricing Strategies in the Presence of Demand Shifts," Manufacturing & Service Operations Management, INFORMS, vol. 16(4), pages 513-528, October.
    7. Qian Liu & Garrett van Ryzin, 2008. "On the Choice-Based Linear Programming Model for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 10(2), pages 288-310, October.
    8. Stefanus Jasin & Sunil Kumar, 2012. "A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 313-345, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Omar Besbes & Yash Kanoria & Akshit Kumar, 2025. "Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances," Operations Research, INFORMS, vol. 73(3), pages 1273-1288, May.
    2. Hyun-Soo Ahn & Christopher Thomas Ryan & Joline Uichanco & Mengzhenyu Zhang, 2026. "Certainty-Equivalent Pricing with Dependent Demand and Limited Price-Changing Opportunities," Mathematics of Operations Research, INFORMS, vol. 51(1), pages 498-541, January.
    3. Weiyuan Li & Paat Rusmevichientong & Huseyin Topaloglu, 2025. "Technical Note—Revenue Management with Calendar-Aware and Dependent Demands: Asymptotically Tight Fluid Approximations," Operations Research, INFORMS, vol. 73(3), pages 1260-1272, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pornpawee Bumpensanti & He Wang, 2020. "A Re-Solving Heuristic with Uniformly Bounded Loss for Network Revenue Management," Management Science, INFORMS, vol. 66(7), pages 2993-3009, July.
    2. Weiyuan Li & Paat Rusmevichientong & Huseyin Topaloglu, 2025. "Technical Note—Revenue Management with Calendar-Aware and Dependent Demands: Asymptotically Tight Fluid Approximations," Operations Research, INFORMS, vol. 73(3), pages 1260-1272, May.
    3. Yicheng Bai & Paat Rusmevichientong & Huseyin Topaloglu, 2025. "Joint Placement, Delivery Promise, and Fulfillment in Online Retail," Management Science, INFORMS, vol. 71(11), pages 9171-9192, November.
    4. Yuhang Ma & Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals," Operations Research, INFORMS, vol. 68(3), pages 834-855, May.
    5. Yongbo Xiao, 2018. "Dynamic pricing and replenishment: Optimality, bounds, and asymptotics," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(1), pages 3-25, February.
    6. Dan Zhang & Zhaosong Lu, 2013. "Assessing the Value of Dynamic Pricing in Network Revenue Management," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 102-115, February.
    7. Dan Zhang & Larry Weatherford, 2017. "Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 18-35, February.
    8. Yiwei Chen & Nikolaos Trichakis, 2021. "Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy," Operations Research, INFORMS, vol. 69(1), pages 175-187, January.
    9. Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
    10. David Simchi-Levi & Yunzong Xu & Jinglong Zhao, 2025. "Blind Network Revenue Management and Bandits with Knapsacks Under Limited Switches," Operations Research, INFORMS, vol. 73(5), pages 2496-2514, September.
    11. Xiaocheng Li & Zeyu Zheng, 2024. "Dynamic Pricing with External Information and Inventory Constraint," Management Science, INFORMS, vol. 70(9), pages 5985-6001, September.
    12. Zihao Qu & Milind Dawande & Ganesh Janakiraman, 2022. "Technical Note—A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services," Operations Research, INFORMS, vol. 70(4), pages 2213-2225, July.
    13. Christiane Barz & Simon Laumer & Marcel Freyschmidt & Jesús Martínez-Blanco, 2023. "Discrete dynamic pricing and application of network revenue management for FlixBus," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 22(1), pages 16-33, February.
    14. Jackie Baek & Will Ma, 2022. "Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources," Operations Research, INFORMS, vol. 70(4), pages 2226-2236, July.
    15. Stefanus Jasin & Amitabh Sinha, 2015. "An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment," Operations Research, INFORMS, vol. 63(6), pages 1336-1351, December.
    16. Stefanus Jasin, 2014. "Reoptimization and Self-Adjusting Price Control for Network Revenue Management," Operations Research, INFORMS, vol. 62(5), pages 1168-1178, October.
    17. Mika Sumida & Huseyin Topaloglu, 2019. "An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 83-99, February.
    18. Huseyin Topaloglu & S. Ilker Birbil & J. B. G. Frenk & Nilay Noyan, 2012. "Tractable Open Loop Policies for Joint Overbooking and Capacity Control Over a Single Flight Leg with Multiple Fare Classes," Transportation Science, INFORMS, vol. 46(4), pages 460-481, November.
    19. Murray Lei & Sheng Liu & Stefanus Jasin & Andrew Vakhutinsky, 2024. "Joint Inventory and Pricing for a One-Warehouse Multistore Problem: Spiraling Phenomena, Near Optimal Policies, and the Value of Dynamic Pricing," Operations Research, INFORMS, vol. 72(2), pages 738-762, March.
    20. Dan Zhang, 2011. "An Improved Dynamic Programming Decomposition Approach for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 13(1), pages 35-52, April.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:69:y:2023:i:7:p:4016-4026. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.