Recent literature has made significant progress in characterizing those social choice functions that can arise, or be “implemented,” as the equilibria of an underlying noncooperative game. This paper studies the implementability of social choice functions via cooperative games. Specifically, we show that if a social choice function arises, in each environment, as a Von Neumann-Morgenstern solution of an underlying cooperative game, whose dominance structure is monotonic and neutral, then the social choice function is essentially oligarchic, in exactly the same sense that “core” selecting choice functions are oligarchic
We analyze the preference aggregation problem without the assumption that individuals and society ha...
A social choice correspondence is Nash self-implementable if it can be implemented in Nash equilibri...
The Muller-Satterthwaite theorem states that social choice functions that satisfy unanimity and mono...
Recent literature has made significant progress in characterizing those social choice functions that...
Recently two game theoretic interpretations of social choice procedures have been offered. First, Wi...
A social choice function is said to be implementable if and only if there exists a game form such th...
Given n agents with von Neumann-Morgenstern utility functions who wish to divide m commodities, cons...
Consider a social choice correspondence as a mapping from preference profiles to lotteries over some...
We consider voting games as procedures to aggregate individual preferences. We survey positive resul...
In [6], Guha gave a complete characterization of path independent social decision functions which sa...
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desir...
Haake C-J, Trockel W. On Maskin monotonicity of solution based social choice rules. Working Papers. ...
We consider agents who do not have any information about others' preferences. In this situation they...
We prove a representation formula that gives a new characterization of the coali- tionally strategy ...
We consider Nash implementation of social choice rules with restricted ranges and show that the appr...
We analyze the preference aggregation problem without the assumption that individuals and society ha...
A social choice correspondence is Nash self-implementable if it can be implemented in Nash equilibri...
The Muller-Satterthwaite theorem states that social choice functions that satisfy unanimity and mono...
Recent literature has made significant progress in characterizing those social choice functions that...
Recently two game theoretic interpretations of social choice procedures have been offered. First, Wi...
A social choice function is said to be implementable if and only if there exists a game form such th...
Given n agents with von Neumann-Morgenstern utility functions who wish to divide m commodities, cons...
Consider a social choice correspondence as a mapping from preference profiles to lotteries over some...
We consider voting games as procedures to aggregate individual preferences. We survey positive resul...
In [6], Guha gave a complete characterization of path independent social decision functions which sa...
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desir...
Haake C-J, Trockel W. On Maskin monotonicity of solution based social choice rules. Working Papers. ...
We consider agents who do not have any information about others' preferences. In this situation they...
We prove a representation formula that gives a new characterization of the coali- tionally strategy ...
We consider Nash implementation of social choice rules with restricted ranges and show that the appr...
We analyze the preference aggregation problem without the assumption that individuals and society ha...
A social choice correspondence is Nash self-implementable if it can be implemented in Nash equilibri...
The Muller-Satterthwaite theorem states that social choice functions that satisfy unanimity and mono...