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 the w best contestants are, but they may be biased. We study conditions on the configuration of the jury so that it is possible to induce the...

We analyze the problem of a jury choosing the winner from a set of agents when the identity of the deserving winner is common knowledge amongst the jurors but each juror is biased in favor of one di¤erent agent. We propose a simple and natural mechanism that implements the socially optimal rule...

A high court has to decide whether a law is constitutional, un- constitutional, or interpretable. The voting system is runoff. Runoff voting systems can be interpreted both, as social choice functions or as mechanisms. It is known that, for universal domains of preferences, runoff voting systems...

This paper uses the complexity of non-competitive behaviour to provide a new justification for competitive equilibrium in the context of extensive-form market games with a finite number of agents. This paper demonstrates that if rational agents have (at least at the margin) an aversion for...

The traditional voting games are special transferable utility cooperative games, so-called simple games, where the players are the parties and the value of a coalition may be 1 or 0 depending on the ability of the coalition to pass a motion or not. In this paper we introduce general weighted...