Optimal Collusion-Proof Auctions
We study an optimal weak collusion-proof auction in an environment where a subset (or subsets) of bidders may collude not just on their bids but also on their participation. Despite their ability to collude on participation, informational asymmetry facing the potential colluders can be exploited significantly to weaken their collusive power. The second-best outcome - i.e., the noncollusive optimum - can be made weak collusion-proof, if at least one bidder is not collusive, or there are multiple bidding rings, or the second-best outcome involves a nontrivial probability of the object not being sold. In case the second-best is not weak collusion proof, we characterize an optimal weak collusion-proof auction. This auction involves nontrivial exclusion of collusive bidders - i.e., the object is not sold to any collusive bidder with positive probability.
|Date of creation:||2006|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: (212) 854-3680
Fax: (212) 854-8059
Web page: http://www.econ.columbia.edu/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:clu:wpaper:0506-22. 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: (Discussion Paper Coordinator)
If references are entirely missing, you can add them using this form.