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.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
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.
Publisher Info
Paper provided by Iowa State University, Department of Economics in its series Staff General Research Papers with number
12663.
Length: 10 pages Date of creation: 24 Aug 2006 Date of revision: Publication status: Published in Economics Letters, October 2006, Vol. 93, No. 1, pp. 94-100. Handle: RePEc:isu:genres:12663
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 Email: Web page: http://www.econ.iastate.edu More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Stephanie Bridges).
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,"
Discussion Papers
1421, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
[Downloadable!]
Cited by: (explanations, 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.)