Eliciting socially optimal rankings from unfair jurors
A jury must provide a ranking of contestants (students applying for scholarships or Ph.D. programs, gymnasts in a competition, etc.). There exists a true ranking which is common knowledge among the jurors, but is not verifiable. The socially optimal rule is that the contestants be ranked according to the true ranking. The jurors are partial and, for example, may have friends (contestants that they would like to benefit) and enemies (contestants that they would like to prejudice). We study necessary and sufficient conditions on the jury under which the socially optimal rule is implementable. These conditions incorporate strong informational requirements, particularly with respect to mechanism designer.
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- Eric Maskin, 1998.
"Nash Equilibrium and Welfare Optimality,"
Harvard Institute of Economic Research Working Papers
1829, Harvard - Institute of Economic Research.
- John Duggan & Cesar Martinelli, 1999.
"A Bayesian Model of Voting in Juries,"
9904, Centro de Investigacion Economica, ITAM.
- Jackson, Matthew O, 1992.
"Implementation in Undominated.Strategies: A Look at Bounded Mechanisms,"
Review of Economic Studies,
Wiley Blackwell, vol. 59(4), pages 757-75, October.
- Matthew 0. Jackson, 1989. "Implementation in Undominated Strategies - A Look at Bounded Mechanisms," Discussion Papers 833, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Saijo, Tatsuyoshi, 1988. "Strategy Space Reduction in Maskin's Theorem: Sufficient Conditions for Nash Implementation," Econometrica, Econometric Society, vol. 56(3), pages 693-700, May.
- Peyton Young, 1995. "Optimal Voting Rules," Journal of Economic Perspectives, American Economic Association, vol. 9(1), pages 51-64, Winter.
- Vijay Krishna & John Morgan, 2001.
"A Model Of Expertise,"
The Quarterly Journal of Economics,
MIT Press, vol. 116(2), pages 747-775, May.
- Vijay Krishna & John Morgan, 1999. "A Model of Expertise," Working Papers 154, Princeton University, Woodrow Wilson School of Public and International Affairs, Discussion Papers in Economics..
- Krishna, V. & Morgan, J., 1999. "A Model of Expertise," Papers 206, Princeton, Woodrow Wilson School - Public and International Affairs.
- Vijay Krishna & John Morgan, 1999. "A Model of Expertise," Game Theory and Information 9902003, EconWPA.
- Thomson, William, 2005.
Games and Economic Behavior,
Elsevier, vol. 52(1), pages 186-200, July.
- Timothy Feddersen & Wolfgang Pesendorfer, 1996. "Convicting the Innocent: The Inferiority of Unanimous Jury Verdicts," Discussion Papers 1170, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Asher Wolinsky, 1999.
"Eliciting Information From Multiple Experts,"
1277, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Amoros, Pablo & Corchon, Luis C. & Moreno, Bernardo, 2002. "The Scholarship Assignment Problem," Games and Economic Behavior, Elsevier, vol. 38(1), pages 1-18, January.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:144:y:2009:i:3:p:1211-1226. 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: (Zhang, Lei)
If references are entirely missing, you can add them using this form.