Auctions with dynamic populations: Efficiency and revenue maximization
A seller has an uncertain number of perishable goods to sell in each period. Privately informed buyers arrive stochastically to the market. Buyers are risk neutral, patient, and have persistent private values for consuming a single unit. We show that the seller can implement the efficient allocation using a sequence of ascending auctions. The buyers use memoryless strategies to reveal all private information in every period, inducing symmetric behavior across different cohorts. We extend our results to revenue maximization, showing that a sequence of ascending auctions with asynchronous price clocks is an optimal mechanism.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- Dirk Bergemann & Juuso Välimäki, 2008.
"The Dynamic Pivot Mechanism,"
Levine's Working Paper Archive
122247000000002340, David K. Levine.
- Dirk Bergemann & Juuso Valimaki, 2008. "The Dynamic Pivot Mechanism," Cowles Foundation Discussion Papers 1672, Cowles Foundation for Research in Economics, Yale University.
- Dirk Bergemann & Juuso Valimaki, 2008. "The Dynamic Pivot Mechanism," Cowles Foundation Discussion Papers 1672R, Cowles Foundation for Research in Economics, Yale University, revised Dec 2009.
- Milgrom, Paul R & Weber, Robert J, 1982.
"A Theory of Auctions and Competitive Bidding,"
Econometric Society, vol. 50(5), pages 1089-1122, September.
- Robert J. Dolan, 1978. "Incentive Mechanisms for Priority Queuing Problems," Bell Journal of Economics, The RAND Corporation, vol. 9(2), pages 421-436, Autumn.
- Mallesh Pai & Rakesh Vohra, 2008. "Optimal Dynamic Auctions," Discussion Papers 1461, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Gershkov, Alex & Moldovanu, Benny, 2010. "Efficient sequential assignment with incomplete information," Games and Economic Behavior, Elsevier, vol. 68(1), pages 144-154, January.
- Susan Athey & Ilya Segal, 2007.
"An Efficient Dynamic Mechanism,"
122247000000001134, UCLA Department of Economics.
- Kagel, John H & Harstad, Ronald M & Levin, Dan, 1987. "Information Impact and Allocation Rules in Auctions with Affiliated Private Values: A Laboratory Study," Econometrica, Econometric Society, vol. 55(6), pages 1275-1304, November.
- Hendon, Ebbe & Jacobsen, Hans Jorgen & Sloth, Birgitte, 1996. "The One-Shot-Deviation Principle for Sequential Rationality," Games and Economic Behavior, Elsevier, vol. 12(2), pages 274-282, February.
- Rothkopf, Michael H & Teisberg, Thomas J & Kahn, Edward P, 1990. "Why Are Vickrey Auctions Rare?," Journal of Political Economy, University of Chicago Press, vol. 98(1), pages 94-109, February.
- Vijay Krishna & Motty Perry, 1997. "Efficient Mechanism Design," Game Theory and Information 9703010, EconWPA, revised 28 Apr 1998.
- Alessandro Pavan & Ilya Segal & Juuso Toikka, 2008.
"Dynamic Mechanism Design: Incentive Compatibility, Profit Maximization and Information Disclosure,"
Carlo Alberto Notebooks
84, Collegio Carlo Alberto.
- Alessandro Pavan & Ilya Segal & Juuso Toikka, 2009. "Dynamic Mechanism Design: Incentive Compatibility, Profit Maximization and Information Disclosure," Discussion Papers 1501, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Said, Maher, 2008. "Information Revelation and Random Entry in Sequential Ascending Auctions," MPRA Paper 7160, University Library of Munich, Germany.
- 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.
- Jeffrey S. Banks & John O. Ledyard & David P. Porter, 1989. "Allocating Uncertain and Unresponsive Resources: An Experimental Approach," RAND Journal of Economics, The RAND Corporation, vol. 20(1), pages 1-25, Spring.
- Perea, Andres, 2002. "A note on the one-deviation property in extensive form games," Games and Economic Behavior, Elsevier, vol. 40(2), pages 322-338, August.
- Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:147:y:2012:i:6:p:2419-2438. 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: (Zhang, Lei)
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.