Gibbard-Satterthwaite theorem: Difference between revisions
Content added Content deleted
Dr. Edmonds (talk | contribs) No edit summary |
Dr. Edmonds (talk | contribs) No edit summary |
||
Line 1: | Line 1: | ||
{{Wikipedia}} |
{{Wikipedia}} |
||
The '''Gibbard-Satterthwaite theorem''' states that every unimposing [[voting system]] (one in which every preference order is achievable) which chooses between three or more candidates, must be either dictatorial or manipulable (i.e. susceptible to [[tactical voting]]). It |
The '''Gibbard-Satterthwaite theorem''' states that every unimposing [[voting system]] (one in which every preference order is achievable) which chooses between three or more candidates, must be either dictatorial or manipulable (i.e. susceptible to [[tactical voting]]). It is related to [[Arrow's impossibility theorem]] and the [[Balinski–Young theorem]]. |
||
==Statement== |
==Statement== |
Revision as of 23:59, 25 January 2020
The Gibbard-Satterthwaite theorem states that every unimposing voting system (one in which every preference order is achievable) which chooses between three or more candidates, must be either dictatorial or manipulable (i.e. susceptible to tactical voting). It is related to Arrow's impossibility theorem and the Balinski–Young theorem.
Statement
For every voting rule, one of the following three things must hold:
- The rule is dictatorial, i.e. there exists a distinguished voter who can choose the winner
- The rule limits the possible outcomes to only two alternatives
- The rule is susceptible to strategic voting: some voter's sincere ballot may not defend their opinion best.