Mechanism design with tacit collusion
AbstractIn the mechanism design literature, collusion is often modelled as agents signing side contracts. This modelling approach is in turn implicitly justified by some unspecified repeated-interaction story. In this paper, we first second-guess what kind of repeated-interaction story these side-contract theorists (would admit that they) are having in mind. We then show that, within this repeated-interaction story, there is a big difference between communicative and tacit collusion. While communicative collusion hurts the mechanism designer, tacit collusion is exploitable.
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 InfoPaper provided by Columbia University, Department of Economics in its series Discussion Papers with number 0102-68.
Length: 26 pages
Date of creation: 2002
Date of revision:
Contact details of provider:
Postal: 1022 International Affairs Building, 420 West 118th Street, New York, NY 10027
Phone: (212) 854-3680
Fax: (212) 854-8059
Web page: http://www.econ.columbia.edu/
More information through EDIRC
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.:
- Susan Athey & Kyle Bagwell & Chris Sanchirico, 1998.
"Collusion and Price Rigidity,"
98-23, Massachusetts Institute of Technology (MIT), Department of Economics.
- Jeffrey C. Ely & Juuso Valimaki, 1999.
"A Robust Folk Theorem for the Prisoner's Dilemma,"
1264, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Jeffrey Ely, 2000. "A Robust Folk Theorem for the Prisoners' Dilemma," Econometric Society World Congress 2000 Contributed Papers 0210, Econometric Society.
- McAfee, R. Preston & McMillan, John., 1990.
726, California Institute of Technology, Division of the Humanities and Social Sciences.
- Che,Y.K. & Yoo,S.W., 1998.
"Optimal incentives for teams,"
8, Wisconsin Madison - Social Systems.
- Hitoshi Matsushima, 2001. "The Folk Theorem with Private Monitoring," CIRJE F-Series CIRJE-F-123, CIRJE, Faculty of Economics, University of Tokyo.
- Susan Athey & Kyle Bagwell, 1999.
"Optimal Collusion with Private Information,"
99-17, Massachusetts Institute of Technology (MIT), Department of Economics.
- Jean-Jacques Laffont & David Martimort, 2000.
"Mechanism Design with Collusion and Correlation,"
Econometric Society, vol. 68(2), pages 309-342, March.
- Peter Cramton, 1995.
"Money Out of Thin Air: The Nationwide Narrowband PCS Auction,"
Papers of Peter Cramton
95jems, University of Maryland, Department of Economics - Peter Cramton, revised 09 Jun 1998.
- Cramton, Peter C, 1995. "Money Out of Thin Air: The Nationwide Narrowband PCS Auction," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 4(2), pages 267-343, Summer.
- Andreas Blume & Paul Heidhues, 2001. "Tacit Collusion in Repeated Auctions," CIG Working Papers FS IV 01-23, Wissenschaftszentrum Berlin (WZB), Research Unit: Competition and Innovation (CIG).
- Hopenhayn, Hugo A. & Skrzypacz, Andrzej, 2001.
"Tacit Collusion in Repeated Auctions,"
1698r2, Stanford University, Graduate School of Business.
- Aoyagi, Masaki, 2003. "Bid rotation and collusion in repeated auctions," Journal of Economic Theory, Elsevier, vol. 112(1), pages 79-105, September.
- Jean-Jacques Laffont & David Martimort, 1997.
"Collusion under Asymmetric Information,"
Econometric Society, vol. 65(4), pages 875-912, July.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Discussion Paper Coordinator).
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.