Fighting Collusion in Tournaments
AbstractThis paper proposes a new approach of fighting collusion in tournaments which sheds light on the principle of divide and conquer: the principal can benefit from manipulating information revelation, by which he brings asymmetric information between the agents and thus creates a distortion of efficiency in the coalition. We employ a simple tournament setting where, due to perfect collusion, the efficient effort levels are impossible to be implemented through simple mechanisms. We propose a sophisticated mechanism with a biased promotion rule that allows the principal to manipulate the revelation of information and make asymmetric information between the agents, which brings trade-offs between rent-extraction and distortion of efficiency into the coalition. We show that, it is possible to implement efficient effort levels under the sophisticated mechanism. JEL Classification: C72, D82
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 University Library of Munich, Germany in its series MPRA Paper with number 872.
Date of creation: Nov 2006
Date of revision:
Find related papers by JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
This paper has been announced in the following NEP Reports:
- NEP-ALL-2006-11-25 (All new papers)
- NEP-COM-2006-11-25 (Industrial Competition)
- NEP-GTH-2006-11-25 (Game Theory)
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.:
- Jean-Jacques Laffont & David Martimort, 1997.
"Collusion under Asymmetric Information,"
Econometric Society, vol. 65(4), pages 875-912, July.
- Lazear, Edward P & Rosen, Sherwin, 1981.
"Rank-Order Tournaments as Optimum Labor Contracts,"
Journal of Political Economy,
University of Chicago Press, vol. 89(5), pages 841-64, October.
- Jean-Jacques Laffont & David Martimort, 2000.
"Mechanism Design with Collusion and Correlation,"
Econometric Society, vol. 68(2), pages 309-342, March.
- Green, Jerry & Stokey, Nancy, 1983.
"A Comparison of Tournaments and Contracts,"
3203644, Harvard University Department of Economics.
- Ishiguro, Shingo, 2004. "Collusion and discrimination in organizations," Journal of Economic Theory, Elsevier, vol. 116(2), pages 357-369, June.
- Chen, Zhijun, 2006. "Private Enforcement against Collusion in Mechanism Design," MPRA Paper 873, University Library of Munich, Germany.
- Zhijun Chen, 2005. "Divide and Conquer," Labor and Demography 0504012, EconWPA.
- Itoh Hideshi, 1993. "Coalitions, Incentives, and Risk Sharing," Journal of Economic Theory, Elsevier, vol. 60(2), pages 410-427, August.
- Tirole, Jean, 1986. "Hierarchies and Bureaucracies: On the Role of Collusion in Organizations," Journal of Law, Economics and Organization, Oxford University Press, vol. 2(2), pages 181-214, Fall.
- Myerson, Roger B., 1982. "Optimal coordination mechanisms in generalized principal-agent problems," Journal of Mathematical Economics, Elsevier, vol. 10(1), pages 67-81, June.
- Oliver Gürtler, 2010. "Collusion in homogeneous and heterogeneous tournaments," Journal of Economics, Springer, vol. 100(3), pages 265-280, July.
- Kräkel, Matthias & Schöttner, Anja, 2010. "Technology choice, relative performance pay, and worker heterogeneity," Journal of Economic Behavior & Organization, Elsevier, vol. 76(3), pages 748-758, December.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht).
If references are entirely missing, you can add them using this form.