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

Dynamic Auctions: A Survey

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

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://cowles.econ.yale.edu/P/cd/d17b/d1757-r.pdf
Download Restriction: no

Paper provided by Cowles Foundation for Research in Economics, Yale University in its series Cowles Foundation Discussion Papers with number 1757R.

as
in new window

Length: 16 pages
Date of creation: Mar 2010
Date of revision: May 2010
Publication status: Published in J.J. Cochran, L.A. Cox, P. Keskinocak, J.P. Kharoufeh, and J.C. Smith, eds. Wiley Encyclopedia of Operations Research and Management Science, Vol. 2, Wiley, 2011, pp. 1511-1522
Handle: RePEc:cwl:cwldpp:1757r
Note: CFP 1325
Contact details of provider: Postal: Yale University, Box 208281, New Haven, CT 06520-8281 USA
Phone: (203) 432-3702
Fax: (203) 432-6167
Web page: http://cowles.econ.yale.edu/

More information through EDIRC

Order Information: Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA

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. 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.
  2. S. Christian Albright, 1974. "Optimal Sequential Assignments with Random Arrival Times," Management Science, INFORMS, vol. 21(1), pages 60-67, September.
  3. d'Aspremont, Claude & Gerard-Varet, Louis-Andre, 1979. "Incentives and incomplete information," Journal of Public Economics, Elsevier, vol. 11(1), pages 25-45, February.
  4. Said, Maher, 2008. "Auctions with Dynamic Populations: Efficiency and Revenue Maximization," MPRA Paper 11456, University Library of Munich, Germany.
  5. Pascal Courty & Li Hao, 1997. "Sequential screening," Economics Working Papers 224, Department of Economics and Business, Universitat Pompeu Fabra.
  6. 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.
  7. Dirk Bergemann & Juuso Valimaki, 1998. "Dynamic Common Agency," Discussion Papers 1259, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  8. Doepke, Matthias & Townsend, Robert M, 2004. "Dynamic Mechanism Design with Hidden Income and Hidden Auctions," CEPR Discussion Papers 4455, C.E.P.R. Discussion Papers.
  9. Gershkov, Alex & Moldovanu, Benny, 2010. "Efficient sequential assignment with incomplete information," Games and Economic Behavior, Elsevier, vol. 68(1), pages 144-154, January.
  10. M. Ali Khan, 2007. "Perfect Competition," PIDE-Working Papers 2007:15, Pakistan Institute of Development Economics.
  11. Simon Board, 2008. "Durable-Goods Monopoly with Varying Demand," Review of Economic Studies, Oxford University Press, vol. 75(2), pages 391-413.
  12. 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.
  13. Roger B. Myerson, 1984. "Multistage Games with Communication," Discussion Papers 590, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  14. 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.
  15. 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.
  16. 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.
  17. Marco Battaglini, 2003. "Long-Term Contracting with Markovian Consumers," Theory workshop papers 505798000000000048, UCLA Department of Economics.
  18. 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.
  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. Said, Maher, 2008. "Information Revelation and Random Entry in Sequential Ascending Auctions," MPRA Paper 7160, University Library of Munich, Germany.
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:cwl:cwldpp:1757r. 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: (Glena Ames)

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.