IDEAS home Printed from https://ideas.repec.org/p/cwl/cwldpp/1757.html
   My bibliography  Save this paper

Dynamic Auctions: A Survey

Author

Listed:

Abstract

We survey the recent literature on designing auctions and mechanisms for dynamic settings. Two settings are considered: those with a dynamic population of agents or buyers whose private information remains fixed throughout time; and those with a fixed population of agents or buyers whose private information changes across time. Within each of these settings, we discuss both efficient (welfare-maximizing) and optimal (revenue-maximizing) mechanisms.

Suggested Citation

  • Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Cowles Foundation Discussion Papers 1757, Cowles Foundation for Research in Economics, Yale University.
    • Handle: RePEc:cwl:cwldpp:1757
    Note: CFP 1325
    as

    Download full text from publisher

    File URL: https://cowles.yale.edu/sites/default/files/files/pub/d17/d1757.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. M. Ali Khan, 2007. "Perfect Competition," PIDE-Working Papers 2007:15, Pakistan Institute of Development Economics.
    2. Doepke, Matthias & Townsend, Robert M., 2006. "Dynamic mechanism design with hidden income and hidden actions," Journal of Economic Theory, Elsevier, vol. 126(1), pages 235-285, January.
    3. 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.
    4. Bergemann, Dirk & Valimaki, Juuso, 2003. "Dynamic common agency," Journal of Economic Theory, Elsevier, vol. 111(1), pages 23-48, July.
    5. Gershkov, Alex & Moldovanu, Benny, 2010. "Efficient sequential assignment with incomplete information," Games and Economic Behavior, Elsevier, vol. 68(1), pages 144-154, January.
    6. Pascal Courty & Li Hao, 2000. "Sequential Screening," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 67(4), pages 697-717.
    7. 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.
    8. Said, Maher, 2012. "Auctions with dynamic populations: Efficiency and revenue maximization," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2419-2438.
    9. Simon Board, 2008. "Durable-Goods Monopoly with Varying Demand," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 75(2), pages 391-413.
    10. Baron, David P. & Besanko, David, 1984. "Regulation and information in a continuing relationship," Information Economics and Policy, Elsevier, vol. 1(3), pages 267-302.
    11. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    12. Jérémie Gallien, 2006. "Dynamic Mechanism Design for Online Commerce," Operations Research, INFORMS, vol. 54(2), pages 291-310, April.
    13. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    14. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    15. Susan Athey & Ilya Segal, 2013. "An Efficient Dynamic Mechanism," Econometrica, Econometric Society, vol. 81(6), pages 2463-2485, November.
    16. Myerson, Roger B, 1986. "Multistage Games with Communication," Econometrica, Econometric Society, vol. 54(2), pages 323-358, March.
    17. d'Aspremont, Claude & Gerard-Varet, Louis-Andre, 1979. "Incentives and incomplete information," Journal of Public Economics, Elsevier, vol. 11(1), pages 25-45, February.
    18. Akan, Mustafa & Ata, Barış & Dana, James D., 2015. "Revenue management by sequential screening," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 728-774.
    19. Mark Satterthwaite & Artyom Shneyerov, 2007. "Dynamic Matching, Two-Sided Incomplete Information, and Participation Costs: Existence and Convergence to Perfect Competition," Econometrica, Econometric Society, vol. 75(1), pages 155-200, January.
    20. 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.
    21. Péter Eső & Balázs Szentes, 2007. "Optimal Information Disclosure in Auctions and the Handicap Auction," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 74(3), pages 705-731.
    22. Marco Battaglini, 2005. "Long-Term Contracting with Markovian Consumers," American Economic Review, American Economic Association, vol. 95(3), pages 637-658, June.
    23. S. Christian Albright, 1974. "Optimal Sequential Assignments with Random Arrival Times," Management Science, INFORMS, vol. 21(1), pages 60-67, September.
    24. Deb, Rahul, 2008. "Optimal Contracting Of New Experience Goods," MPRA Paper 9880, University Library of Munich, Germany.
    25. Said, Maher, 2008. "Information Revelation and Random Entry in Sequential Ascending Auctions," MPRA Paper 7160, University Library of Munich, Germany.
    26. 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.
    27. Gustavo Vulcano & Garrett van Ryzin & Costis Maglaras, 2002. "Optimal Dynamic Auctions for Revenue Management," Management Science, INFORMS, vol. 48(11), pages 1388-1407, November.
    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. Hitoshi Matsushima, 2012. "Optimal Multiunit Exchange Design," CARF F-Series CARF-F-279, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    2. Yoon, Kiho, 2015. "On budget balance of the dynamic pivot mechanism," Games and Economic Behavior, Elsevier, vol. 94(C), pages 206-213.
    3. Battaglini, Marco & Lamba, Rohit, 2019. "Optimal dynamic contracting: the first-order approach and beyond," Theoretical Economics, Econometric Society, vol. 14(4), November.
    4. Daniel F. Garrett & Alessandro Pavan, 2012. "Managerial Turnover in a Changing World," Journal of Political Economy, University of Chicago Press, vol. 120(5), pages 879-925.
    5. Hitoshi Matsushima, 2011. "Efficient Combinatorial Exchanges," CARF F-Series CARF-F-258, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    6. Kiho Yoon, 2015. "On the Uniqueness of Dynamic Groves Mechanisms," Discussion Paper Series 1505, Institute of Economic Research, Korea University.
    7. Hao Li & Xianwen Shi, 2017. "Discriminatory Information Disclosure," American Economic Review, American Economic Association, vol. 107(11), pages 3363-3385, November.
    8. Deepanshu Vasal, 2022. "Master equation of discrete-time Stackelberg mean field games with multiple leaders," Papers 2209.03186, arXiv.org.
    9. Garrett, Daniel F., 2017. "Dynamic mechanism design: Dynamic arrivals and changing values," Games and Economic Behavior, Elsevier, vol. 104(C), pages 595-612.
    10. Babaioff, Moshe & Blumrosen, Liad & Roth, Aaron, 2015. "Auctions with online supply," Games and Economic Behavior, Elsevier, vol. 90(C), pages 227-246.
    11. Kartikeya Puranam & Michael Katehakis, 2014. "On optimal bidding and inventory control in sequential procurement auctions: the multi period case," Annals of Operations Research, Springer, vol. 217(1), pages 447-462, June.
    12. Liu, Heng, 2018. "Efficient dynamic mechanisms in environments with interdependent valuations: the role of contingent transfers," Theoretical Economics, Econometric Society, vol. 13(2), May.
    13. Deepanshu Vasal & Randall Berry, 2022. "Master Equation for Discrete-Time Stackelberg Mean Field Games with single leader," Papers 2201.05959, arXiv.org.
    14. Katehakis, Michael N. & Puranam, Kartikeya S., 2012. "On bidding for a fixed number of items in a sequence of auctions," European Journal of Operational Research, Elsevier, vol. 222(1), pages 76-84.
    15. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2012. "Auctions for Online Display Advertising Exchanges: Approximations and Design," Working Papers 12-11, NET Institute.
    16. Mezzetti, Claudio & Renou, Ludovic, 2017. "Repeated Nash implementation," Theoretical Economics, Econometric Society, vol. 12(1), January.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    7. Vahab Mirrokni & Renato Paes Leme & Pingzhong Tang & Song Zuo, 2020. "Non‐Clairvoyant Dynamic Mechanism Design," Econometrica, Econometric Society, vol. 88(5), pages 1939-1963, September.
    8. 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.
    9. Garrett, Daniel F., 2017. "Dynamic mechanism design: Dynamic arrivals and changing values," Games and Economic Behavior, Elsevier, vol. 104(C), pages 595-612.
    10. Said, Maher, 2012. "Auctions with dynamic populations: Efficiency and revenue maximization," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2419-2438.
    11. Emil Temnyalov, 2019. "Points mechanisms and rewards programs," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 28(3), pages 436-457, June.
    12. Deb, Rahul & Said, Maher, 2015. "Dynamic screening with limited commitment," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 891-928.
    13. 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.
    14. Kruse, Thomas & Strack, Philipp, 2015. "Optimal stopping with private information," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 702-727.
    15. 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.
    16. Deb, Rahul, 2008. "Optimal Contracting Of New Experience Goods," MPRA Paper 9880, University Library of Munich, Germany.
    17. Dirk Bergemann & Juuso V‰lim‰ki, 2010. "The Dynamic Pivot Mechanism," Econometrica, Econometric Society, vol. 78(2), pages 771-789, March.
    18. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    19. Thomas D. Jeitschko & Pallavi Pal, 2021. "Curbing Price Fluctuations in Cap-and-Trade Auctions," CESifo Working Paper Series 9266, CESifo.
    20. Francesco Giovannoni & Toomas Hinnosaar, 2022. "Pricing Novel Goods," Papers 2208.04985, arXiv.org.

    More about this item

    Keywords

    Dynamic auctions and mechanisms; Random arrivals and departures; Changing private information; Incentive compatibility;
    All these keywords.

    JEL classification:

    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
    • D43 - Microeconomics - - Market Structure, Pricing, and Design - - - Oligopoly and Other Forms of Market Imperfection
    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:cwl:cwldpp:1757. 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: Brittany Ladd (email available below). General contact details of provider: https://edirc.repec.org/data/cowleus.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.