IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this paper or follow this series

Dynamic Auctions: A Survey

  • Dirk Bergemann
  • Maher Said

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.)

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

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

Paper provided by David K. Levine in its series Levine's Working Paper Archive with number 661465000000000111.

as
in new window

Length:
Date of creation: 29 Jul 2010
Date of revision:
Handle: RePEc:cla:levarc:661465000000000111
Contact details of provider: Web page: http://www.dklevine.com/

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

as in new window
  1. Said, Maher, 2012. "Auctions with dynamic populations: Efficiency and revenue maximization," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2419-2438.
  2. Dirk Bergemann & Juuso Valimaki, 1998. "Dynamic Common Agency," Discussion Papers 1259, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  3. Simon Board, 2008. "Durable-Goods Monopoly with Varying Demand," Review of Economic Studies, Oxford University Press, vol. 75(2), pages 391-413.
  4. 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.
  5. d'ASPREMONT, Claude & GERARD-VARET, Louis-André, . "Incentives and incomplete information," CORE Discussion Papers RP -354, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  6. Kittsteiner, Thomas & Moldovanu, Benny, 2004. "Priority Auctions and Queue Disciplines that Depend on Processing Time," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 5, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
  7. Gershkov, Alex & Moldovanu, Benny, 2010. "Efficient sequential assignment with incomplete information," Games and Economic Behavior, Elsevier, vol. 68(1), pages 144-154, January.
  8. Péter Eső & Bal�zs Szentes, 2007. "Optimal Information Disclosure in Auctions and the Handicap Auction," Review of Economic Studies, Oxford University Press, vol. 74(3), pages 705-731.
  9. 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, 01.
  10. Pascal Courty & Li Hao, 1997. "Sequential screening," Economics Working Papers 224, Department of Economics and Business, Universitat Pompeu Fabra.
  11. M. Ali Khan, 2007. "Perfect Competition," PIDE-Working Papers 2007:15, Pakistan Institute of Development Economics.
  12. Said, Maher, 2008. "Information Revelation and Random Entry in Sequential Ascending Auctions," MPRA Paper 7160, University Library of Munich, Germany.
  13. Green, Jerry R & Laffont, Jean-Jacques, 1986. "Partially Verifiable Information and Mechanism Design," Review of Economic Studies, Wiley Blackwell, vol. 53(3), pages 447-56, July.
  14. Roger B. Myerson, 1984. "Multistage Games with Communication," Discussion Papers 590, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  15. S. Christian Albright, 1974. "Optimal Sequential Assignments with Random Arrival Times," Management Science, INFORMS, vol. 21(1), pages 60-67, September.
  16. 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-98, August.
  17. Alex Gershkov & Benny Moldovanu, 2009. "Learning about the Future and Dynamic Efficiency," American Economic Review, American Economic Association, vol. 99(4), pages 1576-87, September.
  18. Marco Battaglini, 2005. "Long-Term Contracting with Markovian Consumers," American Economic Review, American Economic Association, vol. 95(3), pages 637-658, June.
  19. Baron, David P. & Besanko, David, 1984. "Regulation and information in a continuing relationship," Information Economics and Policy, Elsevier, vol. 1(3), pages 267-302.
  20. 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.
Full references (including those not matched with items on IDEAS)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:cla:levarc:661465000000000111. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (David K. Levine)

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.