| Elections Can be Manipulated Often Draft – Comments Welcome (2009) | |||||||||||||||
Abstract | |||||||||||||||
| The Gibbard-Satterthwaite theorem states that every non-trivial voting method between at least 3 alternatives can be strategically manipulated. We prove a quantitative version of the Gibbard-Satterthwaite theorem: a random manipulation by a single random voter will succeed with non-negligible probability for every neutral voting method between 3 alternatives that is far from being a dictatorship. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||