IDEAS home Printed from https://ideas.repec.org/p/cla/levarc/661465000000000111.html

Dynamic Auctions: A Survey

Author

Listed:
  • Dirk Bergemann
  • Maher Said

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.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Levine's Working Paper Archive 661465000000000111, David K. Levine.
    • Handle: RePEc:cla:levarc:661465000000000111
    as

    Download full text from publisher

    File URL: http://www.dklevine.com/archive/refs4661465000000000111.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    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. 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.
    5. 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.
    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. Guo, Jiantao & Deng, Lan & Gong, Baichuan, 2024. "An online auction-based mechanism for pricing and allocation of instant delivery services," Transportation Research Part B: Methodological, Elsevier, vol. 190(C).
    12. 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.
    13. Liu, Heng, 2018. "Efficient dynamic mechanisms in environments with interdependent valuations: the role of contingent transfers," Theoretical Economics, Econometric Society, vol. 13(2), May.
    14. Deepanshu Vasal & Randall Berry, 2022. "Master Equation for Discrete-Time Stackelberg Mean Field Games with single leader," Papers 2201.05959, arXiv.org.
    15. 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.
    16. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2012. "Auctions for Online Display Advertising Exchanges: Approximations and Design," Working Papers 12-11, NET Institute.
    17. Mezzetti, Claudio & Renou, Ludovic, 2017. "Repeated Nash implementation," Theoretical Economics, Econometric Society, vol. 12(1), January.

    More about this item

    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

    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:cla:levarc:661465000000000111. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: David K. Levine (email available below). General contact details of provider: http://www.dklevine.com/ .

    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.