Gibbard-Satterthwaite theorem

Revision as of 20:10, 26 January 2005 by imported>WikipediaBot (importing text from Wikipedia)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

In voting systems, 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.

Template:Math-stub

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