Gibbard-Satterthwaite theorem: Difference between revisions
Content added Content deleted
imported>DanKeshet (rm wpisms) |
Psephomancy (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
''This should just be a soft-redirect to 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 follows from [[Arrow's impossibility theorem]]. |
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 follows from [[Arrow's impossibility theorem]]. |
||
| ⚫ | |||
{{stub}} |
{{stub}} |
||
| ⚫ | |||
{{fromwikipedia}} |
{{fromwikipedia}} |
||
Revision as of 17:06, 8 September 2019
This should just be a soft-redirect to 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 follows from Arrow's impossibility theorem.
This page is a stub - please add to it.