We analyze the problem of choosing the w contestants who will win a competition within a group of n>w competitors when all jurors commonly observe who are the w best contestants but may be biased. We study conditions on the configuration of the jury so that it is possible to induce the jurors to always choose the best contestants, whoever they are. If the equilibrium concept used by the jurors is dominant strategies, the necessary and sufficient conditions incorporate very strong informational requirements on the mechanism designer. If we relax the equilibrium concept to Nash or subgame perfect equilibria the necessary and sufficient conditions are less demanding. Moreover, these conditions are also necessary for any other equilibrium concept. Finally, we study one specific application: we propose a simple and natural mechanism for the case where each juror is biased in favor of one and only one (different) contestant.
In order to set up a list of libraries that you have access to,
you must first login
or sign up.
Then set up a personal list of libraries from your profile page by
clicking on your user name at the top right of any screen.