Gibbard-Satterthwaite theorem: Difference between revisions

From electowiki
Content added Content deleted
imported>WikipediaBot
m (importing text from Wikipedia)
 
imported>DanKeshet
(rm wpisms)
Line 1: Line 1:
In [[voting system]]s, the '''Gibbard-Satterthwaite theorem''' states that every unimposing [[voting method]] (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]].


{{math-stub}}
[[Category:Voting theory]]
[[Category:Voting theory]]
{{stub}}
[[Category:Theorems]]

{{fromwikipedia}}
{{fromwikipedia}}

Revision as of 00:03, 14 February 2005

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.

This page uses Creative Commons Licensed content from Wikipedia (view authors).