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.:
- William Thomson, 2004.
RCER Working Papers
510, University of Rochester - Center for Economic Research (RCER).
- John Duggan & Cesar Martinelli, 1998.
"A Bayesian Model of Voting in Juries,"
Wallis Working Papers
WP14, University of Rochester - Wallis Institute of Political Economy.
- 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.
- Matthew 0. Jackson, 1989.
"Implementation in Undominated Strategies - A Look at Bounded Mechanisms,"
833, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Matthew O. Jackson, 1992. "Implementation in Undominated Strategies: A Look at Bounded Mechanisms," Review of Economic Studies, Oxford University Press, vol. 59(4), pages 757-775.
- Vijay Krishna & John Morgan, 1999.
"A Model of Expertise,"
154, Princeton University, Woodrow Wilson School of Public and International Affairs, Discussion Papers in Economics.
- Eric Maskin, 1999. "Nash Equilibrium and Welfare Optimality," Review of Economic Studies, Oxford University Press, vol. 66(1), pages 23-38.
- Amoros, Pablo & Corchon, Luis C. & Moreno, Bernardo, 2002. "The Scholarship Assignment Problem," Games and Economic Behavior, Elsevier, vol. 38(1), pages 1-18, January.
- Wolinsky, Asher, 2002.
"Eliciting information from multiple experts,"
Games and Economic Behavior,
Elsevier, vol. 41(1), pages 141-160, October.
- Peyton Young, 1995. "Optimal Voting Rules," Journal of Economic Perspectives, American Economic Association, vol. 9(1), pages 51-64, Winter.
- 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.
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: (Shamier, Wendy)
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.