The Gibbard-Satterthwaite theorem is a well-known theorem from the field of social choice theory. It states that every voting scheme with at least 3 possible outcomes is dictatorial or manipulable. Later work on the Gibbard-Satterthwaite theorem frequently does not distinguish between alternatives and outcomes, thereby leading to a less general statement that requires the voting scheme to be onto. We show how the Gibbard-Satterthwaite theorem can be derived from the seemingly less general formulation
A voting rule is manipulable if it is sometimes possible for a voter to change the election’s outcom...
In this paper, we examine the existence of strict strategy-proof voting mechanisms. Using Arrow’s Im...
Friedgut, Kalai, and Nisan have proved that social choice functions can be successfully manipulated ...
The Gibbard-Satterthwaite theorem is a well-known theorem from the field of social choice theory. I...
Abstract: We extend the Gibbard-Satterthwaite theorem in the following way. We prove that an onto, n...
Recent papers by Barber~i and Peleg and by Zhou have established that the Gibbard-Satterthwaite Theo...
The Gibbard-Satterthwaite theorem states that every non-trivial voting method among at least 3 alter...
The Gibbard-Satterthwaite theorem states that every non-trivial voting method between at least 3 alt...
The Gibbard–Satterthwaite (GS) theorem is generalized in three ways: First, it is proved that the th...
A decision scheme (Gibbard (1977)) is a function mapping profiles of strict preferences over a set o...
This thesis gives a contribution to strategy-proof social choice theory, in which one investigates t...
The Gibbard-Satterthwaite Theorem on the manipulability of collective-choice procedures treats only ...
Recent papers by Barberá and Peleg and by Zhou have established that the Gibbard-Satterthwaite Theor...
This thesis consists of two separate papers in strategy-proof social choice theory. The first paper,...
Arrow’s and the Gibbard-Satterthwaite theorems are proved using a common proof strategy based on a d...
A voting rule is manipulable if it is sometimes possible for a voter to change the election’s outcom...
In this paper, we examine the existence of strict strategy-proof voting mechanisms. Using Arrow’s Im...
Friedgut, Kalai, and Nisan have proved that social choice functions can be successfully manipulated ...
The Gibbard-Satterthwaite theorem is a well-known theorem from the field of social choice theory. I...
Abstract: We extend the Gibbard-Satterthwaite theorem in the following way. We prove that an onto, n...
Recent papers by Barber~i and Peleg and by Zhou have established that the Gibbard-Satterthwaite Theo...
The Gibbard-Satterthwaite theorem states that every non-trivial voting method among at least 3 alter...
The Gibbard-Satterthwaite theorem states that every non-trivial voting method between at least 3 alt...
The Gibbard–Satterthwaite (GS) theorem is generalized in three ways: First, it is proved that the th...
A decision scheme (Gibbard (1977)) is a function mapping profiles of strict preferences over a set o...
This thesis gives a contribution to strategy-proof social choice theory, in which one investigates t...
The Gibbard-Satterthwaite Theorem on the manipulability of collective-choice procedures treats only ...
Recent papers by Barberá and Peleg and by Zhou have established that the Gibbard-Satterthwaite Theor...
This thesis consists of two separate papers in strategy-proof social choice theory. The first paper,...
Arrow’s and the Gibbard-Satterthwaite theorems are proved using a common proof strategy based on a d...
A voting rule is manipulable if it is sometimes possible for a voter to change the election’s outcom...
In this paper, we examine the existence of strict strategy-proof voting mechanisms. Using Arrow’s Im...
Friedgut, Kalai, and Nisan have proved that social choice functions can be successfully manipulated ...