IDEAS home Printed from https://ideas.repec.org/a/eee/indorg/v30y2012i3p283-286.html
   My bibliography  Save this article

Dynamic allocation and pricing: A mechanism design approach

Author

Listed:
  • Gershkov, Alex
  • Moldovanu, Benny

Abstract

This paper illustrates the benefits of applying mechanism design techniques to questions in revenue management, in particular to dynamic allocation and pricing problems. It is demonstrated that the solution to a sequential stochastic assignment problem under complete information can also be implemented under incomplete information by a variation of the Vickrey–Clarke–Groves mechanism. More generally, we argue that the mechanism design focus on implementable allocations rather than on prices yields many valuable insights about dynamic RM models. Finally, we also briefly survey some of the recent literature on dynamic mechanism design.

Suggested Citation

  • Gershkov, Alex & Moldovanu, Benny, 2012. "Dynamic allocation and pricing: A mechanism design approach," International Journal of Industrial Organization, Elsevier, vol. 30(3), pages 283-286.
    • Handle: RePEc:eee:indorg:v:30:y:2012:i:3:p:283-286
    DOI: 10.1016/j.ijindorg.2011.12.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167718711001160
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijindorg.2011.12.008?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pascal Courty & Li Hao, 2000. "Sequential Screening," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 67(4), pages 697-717.
    2. Jehiel, Philippe & Moldovanu, Benny, 2001. "Efficient Design with Interdependent Valuations," Econometrica, Econometric Society, vol. 69(5), pages 1237-1259, September.
    3. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721, October.
    4. Gale, Ian L & Holmes, Thomas J, 1993. "Advance-Purchase Discounts and Monopoly Allocation of Capacity," American Economic Review, American Economic Association, vol. 83(1), pages 135-146, March.
    5. Jérémie Gallien, 2006. "Dynamic Mechanism Design for Online Commerce," Operations Research, INFORMS, vol. 54(2), pages 291-310, April.
    6. John Riley & Richard Zeckhauser, 1983. "Optimal Selling Strategies: When to Haggle, When to Hold Firm," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 98(2), pages 267-289.
    7. , & , & ,, 2011. "Revenue maximization in the dynamic knapsack problem," Theoretical Economics, Econometric Society, vol. 6(2), May.
    8. 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.
    9. Alex Gershkov & Benny Moldovanu, 2009. "Dynamic Revenue Maximization with Heterogeneous Objects: A Mechanism Design Approach," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 168-198, August.
    10. Nocke, Volker & Peitz, Martin & Rosar, Frank, 2011. "Advance-purchase discounts as a price discrimination device," Journal of Economic Theory, Elsevier, vol. 146(1), pages 141-162, January.
    11. Partha Dasgupta & Eric Maskin, 2000. "Efficient Auctions," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 115(2), pages 341-388.
    12. Susan Athey & Ilya Segal, 2013. "An Efficient Dynamic Mechanism," Econometrica, Econometric Society, vol. 81(6), pages 2463-2485, November.
    13. Gershkov, Alex & Moldovanu, Benny, 2010. "Efficient sequential assignment with incomplete information," Games and Economic Behavior, Elsevier, vol. 68(1), pages 144-154, January.
    14. S. Christian Albright, 1974. "Optimal Sequential Assignments with Random Arrival Times," Management Science, INFORMS, vol. 21(1), pages 60-67, September.
    15. 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.
    16. Wang, Ruqu, 1993. "Auctions versus Posted-Price Selling," American Economic Review, American Economic Association, vol. 83(4), pages 838-851, September.
    17. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    18. James D. Dana Jr., 1998. "Advance-Purchase Discounts and Price Discrimination in Competitive Markets," Journal of Political Economy, University of Chicago Press, vol. 106(2), pages 395-422, April.
    19. Becker, Gary S, 1973. "A Theory of Marriage: Part I," Journal of Political Economy, University of Chicago Press, vol. 81(4), pages 813-846, July-Aug..
    20. Robert J. Dolan, 1978. "Incentive Mechanisms for Priority Queuing Problems," Bell Journal of Economics, The RAND Corporation, vol. 9(2), pages 421-436, Autumn.
    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. Hao Li & Xianwen Shi, 2017. "Discriminatory Information Disclosure," American Economic Review, American Economic Association, vol. 107(11), pages 3363-3385, November.
    2. 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.
    3. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    4. Philippe Choné & Romain De Nijs & Lionel Wilner, 2012. "Intertemporal Pricing with Unobserved Consumer Arrival Times," Working Papers 2012-23, Center for Research in Economics and Statistics.
    5. Qingmin Liu & Konrad Mierendorff & Xianwen Shi & Weijie Zhong, 2019. "Auctions with Limited Commitment," American Economic Review, American Economic Association, vol. 109(3), pages 876-910, March.

    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. Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Levine's Working Paper Archive 661465000000000035, David K. Levine.
    2. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    3. Gershkov, Alex & Moldovanu, Benny, 2012. "Optimal search, learning and implementation," Journal of Economic Theory, Elsevier, vol. 147(3), pages 881-909.
    4. 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.
    5. Said, Maher, 2012. "Auctions with dynamic populations: Efficiency and revenue maximization," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2419-2438.
    6. Mallesh M. Pai & Rakesh Vohra, 2013. "Optimal Dynamic Auctions and Simple Index Rules," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 682-697, November.
    7. 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.
    8. Akan, Mustafa & Ata, Barış & Dana, James D., 2015. "Revenue management by sequential screening," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 728-774.
    9. Hamid Nazerzadeh & Amin Saberi & Rakesh Vohra, 2013. "Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising," Operations Research, INFORMS, vol. 61(1), pages 98-111, February.
    10. 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.
    11. Kruse, Thomas & Strack, Philipp, 2015. "Optimal stopping with private information," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 702-727.
    12. 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.
    13. Dinard van der Laan & Zaifu Yang, 2019. "Efficient Sequential Assignments with Randomly Arriving Multi-Item Demand Agents," Discussion Papers 19/13, Department of Economics, University of York.
    14. 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.
    15. Boaz Zik, 2023. "Efficient sequential screening with informational externalities," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 75(2), pages 567-590, February.
    16. Marco Sahm, 2020. "Advance-Purchase Financing of Projects with Few Buyers," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 57(4), pages 909-933, December.
    17. Nocke, Volker & Peitz, Martin & Rosar, Frank, 2011. "Advance-purchase discounts as a price discrimination device," Journal of Economic Theory, Elsevier, vol. 146(1), pages 141-162, January.
    18. Peter Postl, 2013. "Efficiency versus optimality in procurement," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 53(2), pages 425-472, June.
    19. Jeremy Bulow & Paul Klemperer, 2007. "When are Auctions Best?," Economics Papers 2007-W03, Economics Group, Nuffield College, University of Oxford.
    20. Condorelli, Daniele, 2013. "Market and non-market mechanisms for the optimal allocation of scarce resources," Games and Economic Behavior, Elsevier, vol. 82(C), pages 582-591.

    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:eee:indorg:v:30:y:2012:i:3:p:283-286. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505551 .

    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.