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.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||01 Oct 2006|
|Publication status:||Published in Economics Letters, October 2006, vol. 93 no. 1, pp. 94-100|
|Contact details of provider:|| Postal: Iowa State University, Dept. of Economics, 260 Heady Hall, Ames, IA 50011-1070|
Phone: +1 515.294.6741
Fax: +1 515.294.0221
Web page: http://www.econ.iastate.edu
More information through EDIRC
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.:
- Crémer, Jacques & Spiegel, Yossi & Zheng, Charles, 2005.
"Optimal Search Auctions,"
IDEI Working Papers
293, Institut d'Économie Industrielle (IDEI), Toulouse.
- 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 Archive 12662, Iowa State University, Department of Economics.
- Jacques Cremer & Yossi Spiegel & Charles Z. Zheng, 2005. "Optimal Search Auctions," Discussion Papers 1421, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Bergemann, Dirk & Pesendorfer, Martin, 2007.
"Information structures in optimal auctions,"
Journal of Economic Theory,
Elsevier, vol. 137(1), pages 580-609, November.
- Bergemann, Dirk & Pesendorfer, Martin, 2001. "Information Structures in Optimal Auctions," CEPR Discussion Papers 2991, C.E.P.R. Discussion Papers.
- Dirk Bergemann & Martin Pesendorfer, 2001. "Information Structures in Optimal Auctions," Cowles Foundation Discussion Papers 1323, Cowles Foundation for Research in Economics, Yale University.
- 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 & Juuso Valimaki, 2002. "Information Acquisition and Efficient Mechanism Design," Econometrica, Econometric Society, vol. 70(3), pages 1007-1033, May.
- 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.
- 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-361, March.
- 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-1257, November.
When requesting a correction, please mention this item's handle: RePEc:isu:genres:12663. 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: (Curtis Balmer)
If references are entirely missing, you can add them using this form.