original papers : Who else is bidding? The Pareto optimality of disclosing bidder identities
AbstractThis paper examines whether the seller of an object should reveal the identities of the participating bidders before bids become due. It is shown that when bidders experience identity dependent externalities and auction participation is exogenous, then for a large class of standard auction mechanisms, a policy of revelation serves to realize a higher surplus because it improves the accuracy of each bidder's estimate of her ex-post willingness-to-pay, and therefore changes the auction allocation in a more ex-post efficient manner. Furthermore, it is shown that the policy of revelation increases both the expected seller revenues as well as ex-ante expected bidder payoffs.
Download InfoIf 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.
Bibliographic InfoArticle provided by Springer in its journal Review of Economic Design.
Volume (Year): 7 (2002)
Issue (Month): 2 ()
Note: Received: 4 February 2000 / Accepted: 15 November 2000
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/10058/index.htm
Find related papers by JEL classification:
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
- D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis
- D62 - Microeconomics - - Welfare Economics - - - Externalities
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.