Optimal search auctions with correlated bidder types
We study optimal auctions when contacting prospective bidders is costly and the biddersï¾’ values are correlated. Although full surplus extraction is in general impossible, we can construct a search mechanism that fully extracts the surplus with an arbitrarily high probability.
(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.
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.:
- Jacques Cremer & Yossi Spiegel & Charles Z. Zheng, 2005.
"Optimal Search Auctions,"
1421, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Charles Zhoucheng Zheng & Jacques Cremer & Yossef Spiegel, 2004. "Optimal search auctions," Econometric Society 2004 North American Summer Meetings 615, Econometric Society.
- CrÃ©mer, Jacques & Spiegel, Yossi & Zheng, Charles Zhoucheng, 2007. "Optimal Search Auctions," Staff General Research Papers 12662, Iowa State University, Department of Economics.
- Crémer, Jacques & Spiegel, Yossi & Zheng, Charles, 2005. "Optimal Search Auctions," IDEI Working Papers 293, Institut d'Économie Industrielle (IDEI), Toulouse.
- Cremer, Jacques & McLean, Richard P, 1985. "Optimal Selling Strategies under Uncertainty for a Discriminating Monopolist When Demands Are Interdependent," Econometrica, Econometric Society, vol. 53(2), pages 345-61, March.
- Dirk Bergemann & Juuso Valimaki, 2002.
"Information Acquisition and Efficient Mechanism Design,"
Econometric Society, vol. 70(3), pages 1007-1033, May.
- Dirk Bergemann & Juuso Vaimaki, 2000. "Information Acquisition and Efficient Mechanism Design," Cowles Foundation Discussion Papers 1248, Cowles Foundation for Research in Economics, Yale University.
- Dirk Bergemann & Martin Pesendorfer, 2001.
"Information Structures in Optimal Auctions,"
Cowles Foundation Discussion Papers
1323, Cowles Foundation for Research in Economics, Yale University.
- Cremer, Jacques & McLean, Richard P, 1988. "Full Extraction of the Surplus in Bayesian and Dominant Strategy Auctions," Econometrica, Econometric Society, vol. 56(6), pages 1247-57, November.
- Ye Lixin, 2004. "Optimal Auctions with Endogenous Entry," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 4(1), pages 1-29, October.
- Burguet, Roberto, 1996. "Optimal Repeated Purchases When Sellers Are Learning about Costs," Journal of Economic Theory, Elsevier, vol. 68(2), pages 440-455, February.
- Preston McAfee, R. & McMillan, John, 1988. "Search mechanisms," Journal of Economic Theory, Elsevier, vol. 44(1), pages 99-123, February.
When requesting a correction, please mention this item's handle: RePEc:eee:ecolet:v:93:y:2006:i:1:p:94-100. 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.