IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v64y2018i5p2031-2046.html
   My bibliography  Save this article

Revenue-Maximizing Mechanisms with Strategic Customers and Unknown, Markovian Demand

Author

Listed:
  • Alex Gershkov

    (Department of Economics and Center for the Study of Rationality, Hebrew University of Jerusalem, Jerusalem 91905, Israel; School of Economics, University of Surrey, Guildford, Surrey GU2 7XH, United Kingdom)

  • Benny Moldovanu

    (Department of Economics, University of Bonn, Bonn D-53012, Germany)

  • Philipp Strack

    (Department of Economics, University of California, Berkeley, Berkeley, California 94720)

Abstract

We show that appropriate dynamic pricing strategies can be used to draw benefits from the presence of consumers who strategically time their purchase even if the arrival process is not known. In our model, a seller sells a stock of objects to a stream of randomly arriving long-lived agents. Agents are privately informed about their values, and about their arrival time to the market. The seller needs to learn about future demand from past arrivals. We characterize the revenue-maximizing direct mechanism. While the optimal mechanism cannot be reduced to posted prices (and requires personalized prices), we also present a simple, “learn and then sell” mechanism that is able to extract a large fraction of the maximal revenue. In this mechanism, the seller first charges a relatively low price that allows learning about the arrival process, and in a second stage, the seller charges the optimal posted price given the previously obtained information.

Suggested Citation

  • Alex Gershkov & Benny Moldovanu & Philipp Strack, 2018. "Revenue-Maximizing Mechanisms with Strategic Customers and Unknown, Markovian Demand," Management Science, INFORMS, vol. 64(5), pages 2031-2046, May.
    • Handle: RePEc:inm:ormnsc:v:64:y:2018:i:5:p:2031-2046
    DOI: mnsc.2017.2724
    as

    Download full text from publisher

    File URL: https://doi.org/mnsc.2017.2724
    Download Restriction: no
    File URL: https://libkey.io/mnsc.2017.2724?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. repec:cwl:cwldpp:1953rrr is not listed on IDEAS
    2. repec:cwl:cwldpp:1953rr is not listed on IDEAS
    3. Bergemann, Dirk & Strack, Philipp, 2015. "Dynamic revenue maximization: A continuous time approach," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 819-853.
    4. Pascal Courty & Li Hao, 2000. "Sequential Screening," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 67(4), pages 697-717.
    5. Diego Escobari, 2012. "Dynamic Pricing, Advance Sales and Aggregate Demand Learning in Airlines," Journal of Industrial Economics, Wiley Blackwell, vol. 60(4), pages 697-724, December.
    6. Sham M. Kakade & Ilan Lobel & Hamid Nazerzadeh, 2013. "Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism," Operations Research, INFORMS, vol. 61(4), pages 837-854, August.
    7. Guillermo Gallego & S. G. Kou & Robert Phillips, 2008. "Revenue Management of Callable Products," Management Science, INFORMS, vol. 54(3), pages 550-564, March.
    8. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    9. Jerry R. Green & Jean-Jacques Laffont, 1986. "Partially Verifiable Information and Mechanism Design," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 53(3), pages 447-456.
    10. Victor F. Araman & René Caldentey, 2009. "Dynamic Pricing for Nonperishable Products with Demand Learning," Operations Research, INFORMS, vol. 57(5), pages 1169-1188, October.
    11. Jérémie Gallien, 2006. "Dynamic Mechanism Design for Online Commerce," Operations Research, INFORMS, vol. 54(2), pages 291-310, April.
    12. Christian Borgs & Ozan Candogan & Jennifer Chayes & Ilan Lobel & Hamid Nazerzadeh, 2014. "Optimal Multiperiod Pricing with Service Guarantees," Management Science, INFORMS, vol. 60(7), pages 1792-1811, July.
    13. 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.
    14. Omar Besbes & Assaf Zeevi, 2015. "On the (Surprising) Sufficiency of Linear Models for Dynamic Pricing with Demand Learning," Management Science, INFORMS, vol. 61(4), pages 723-739, April.
    15. Xuanming Su, 2007. "Intertemporal Pricing with Strategic Customer Behavior," Management Science, INFORMS, vol. 53(5), pages 726-741, May.
    16. Susan Athey & Ilya Segal, 2013. "An Efficient Dynamic Mechanism," Econometrica, Econometric Society, vol. 81(6), pages 2463-2485, November.
    17. Zuckerman, Dror, 1988. "Job search with general stochastic offer arrival rates," Journal of Economic Dynamics and Control, Elsevier, vol. 12(4), pages 679-684, November.
    18. Mallesh Pai & Rakesh Vohra, 2008. "Optimal Dynamic Auctions," Discussion Papers 1461, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    19. Alex Gershkov & Benny Moldovanu, 2009. "Learning about the Future and Dynamic Efficiency," American Economic Review, American Economic Association, vol. 99(4), pages 1576-1587, September.
    20. Gustavo Vulcano & Garrett van Ryzin & Costis Maglaras, 2002. "Optimal Dynamic Auctions for Revenue Management," Management Science, INFORMS, vol. 48(11), pages 1388-1407, November.
    21. Rui Yin & Yossi Aviv & Amit Pazgal & Christopher S. Tang, 2009. "Optimal Markdown Pricing: Implications of Inventory Display Formats in the Presence of Strategic Customers," Management Science, INFORMS, vol. 55(8), pages 1391-1408, August.
    22. Gershkov, Alex & Moldovanu, Benny, 2012. "Optimal search, learning and implementation," Journal of Economic Theory, Elsevier, vol. 147(3), pages 881-909.
    23. Said, Maher, 2012. "Auctions with dynamic populations: Efficiency and revenue maximization," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2419-2438.
    24. Kinshuk Jerath & Serguei Netessine & Senthil K. Veeraraghavan, 2010. "Revenue Management with Strategic Customers: Last-Minute Selling and Opaque Selling," Management Science, INFORMS, vol. 56(3), pages 430-448, March.
    25. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    26. Alessandro Pavan & Ilya Segal & Juuso Toikka, 2014. "Dynamic Mechanism Design: A Myersonian Approach," Econometrica, Econometric Society, vol. 82(2), pages 601-653, March.
    27. Mason, Robin & Välimäki, Juuso, 2011. "Learning about the arrival of sales," Journal of Economic Theory, Elsevier, vol. 146(4), pages 1699-1711, July.
    28. Yossi Aviv & Yuri Levin & Mikhail Nediak, 2009. "Counteracting Strategic Consumer Behavior in Dynamic Pricing Systems," International Series in Operations Research & Management Science, in: Christopher S. Tang & Serguei Netessine (ed.), Consumer-Driven Demand and Operations Management Models, edition 1, chapter 0, pages 323-352, Springer.
    29. Omar Besbes & Ilan Lobel, 2015. "Intertemporal Price Discrimination: Structure and Computation of Optimal Policies," Management Science, INFORMS, vol. 61(1), pages 92-110, January.
    30. Myerson, Roger B, 1986. "Multistage Games with Communication," Econometrica, Econometric Society, vol. 54(2), pages 323-358, March.
    31. Jun Li & Nelson Granados & Serguei Netessine, 2014. "Are Consumers Strategic? Structural Estimation from the Air-Travel Industry," Management Science, INFORMS, vol. 60(9), pages 2114-2137, September.
    32. Yossi Aviv & Amit Pazgal, 2008. "Optimal Pricing of Seasonal Products in the Presence of Forward-Looking Consumers," Manufacturing & Service Operations Management, INFORMS, vol. 10(3), pages 339-359, December.
    33. Gonca P. Soysal & Lakshman Krishnamurthi, 2012. "Demand Dynamics in the Seasonal Goods Industry: An Empirical Analysis," Marketing Science, INFORMS, vol. 31(2), pages 293-316, March.
    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. Ling Zhao & Anquan Zou & Minghua Xiong & Jun Liu, 2023. "Supply Chain Performance with a Downside-Risk-Averse Retailer and Strategic Customers," Sustainability, MDPI, vol. 15(4), pages 1-18, February.
    2. Kevin R. Williams, 2022. "The Welfare Effects of Dynamic Pricing: Evidence From Airline Markets," Econometrica, Econometric Society, vol. 90(2), pages 831-858, March.
    3. Daniel Garcia & Maarten C. W. Janssen & Radostina Shopova, 2023. "Dynamic Pricing with Uncertain Capacities," Management Science, INFORMS, vol. 69(9), pages 5275-5297, September.
    4. Kevin R. Williams, 2017. "Dynamic Airline Pricing and Seat Availability," Cowles Foundation Discussion Papers 2103R, Cowles Foundation for Research in Economics, Yale University, revised May 2020.
    5. Nahla Dhib & Arvind Ashta, 2020. "How far can we go? Determining the optimal loan size in progressive lending," Working Papers hal-03001840, HAL.
    6. Kevin R. Williams, 2017. "The Welfare Effects of Dynamic Pricing: Evidence from Airline Markets," Cowles Foundation Discussion Papers 2103R2, Cowles Foundation for Research in Economics, Yale University, revised Jun 2021.
    7. Chaves, Isaías N. & Ichihashi, Shota, 2024. "Auction timing and market thickness," Games and Economic Behavior, Elsevier, vol. 143(C), pages 161-178.
    8. Gregorio Curello & Ludvig Sinander, 2020. "Screening for breakthroughs," Papers 2011.10090, arXiv.org, revised Feb 2024.
    9. Emil Temnyalov, 2019. "Points mechanisms and rewards programs," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 28(3), pages 436-457, June.

    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. Yiwei Chen & Vivek F. Farias, 2018. "Robust Dynamic Pricing with Strategic Customers," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1119-1142, November.
    2. Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Levine's Working Paper Archive 661465000000000035, David K. Levine.
    3. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    4. Yiwei Chen & Vivek F. Farias & Nikolaos Trichakis, 2019. "On the Efficacy of Static Prices for Revenue Management in the Face of Strategic Customers," Management Science, INFORMS, vol. 65(12), pages 5535-5555, December.
    5. Negin Golrezaei & Hamid Nazerzadeh & Ramandeep Randhawa, 2020. "Dynamic Pricing for Heterogeneous Time-Sensitive Customers," Manufacturing & Service Operations Management, INFORMS, vol. 22(3), pages 562-581, May.
    6. Bergemann, Dirk & Pavan, Alessandro, 2015. "Introduction to Symposium on Dynamic Contracts and Mechanism Design," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 679-701.
    7. Tao Zhang & Quanyan Zhu, 2019. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Papers 1909.13720, arXiv.org, revised May 2021.
    8. René Caldentey & Ying Liu & Ilan Lobel, 2017. "Intertemporal Pricing Under Minimax Regret," Operations Research, INFORMS, vol. 65(1), pages 104-129, February.
    9. Vibhanshu Abhishek & Mustafa Dogan & Alexandre Jacquillat, 2021. "Strategic Timing and Dynamic Pricing for Online Resource Allocation," Management Science, INFORMS, vol. 67(8), pages 4880-4907, August.
    10. Ken Moon & Kostas Bimpikis & Haim Mendelson, 2018. "Randomized Markdowns and Online Monitoring," Management Science, INFORMS, vol. 64(3), pages 1271-1290, March.
    11. René Caldentey & Ying Liu & Ilan Lobel, 2017. "Intertemporal Pricing Under Minimax Regret," Operations Research, INFORMS, vol. 65(1), pages 104-129, February.
    12. Tao Zhang & Quanyan Zhu, 2022. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Dynamic Games and Applications, Springer, vol. 12(2), pages 701-745, June.
    13. 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.
    14. Yossi Aviv & Mike Mingcheng Wei & Fuqiang Zhang, 2019. "Responsive Pricing of Fashion Products: The Effects of Demand Learning and Strategic Consumer Behavior," Management Science, INFORMS, vol. 65(7), pages 2982-3000, July.
    15. Alderighi, Marco & Gaggero, Alberto A. & Piga, Claudio A., 2022. "Hidden prices with fixed inventory: Evidence from the airline industry," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 42-61.
    16. Sham M. Kakade & Ilan Lobel & Hamid Nazerzadeh, 2013. "Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism," Operations Research, INFORMS, vol. 61(4), pages 837-854, August.
    17. Ilan Lobel, 2021. "Revenue Management and the Rise of the Algorithmic Economy," Management Science, INFORMS, vol. 67(9), pages 5389-5398, September.
    18. Kruse, Thomas & Strack, Philipp, 2015. "Optimal stopping with private information," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 702-727.
    19. Arve, Malin & Zwart, Gijsbert, 2023. "Optimal procurement and investment in new technologies under uncertainty," Journal of Economic Dynamics and Control, Elsevier, vol. 147(C).
    20. Emil Temnyalov, 2019. "Points mechanisms and rewards programs," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 28(3), pages 436-457, June.

    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:64:y:2018:i:5:p:2031-2046. 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.