Citation:
Ehud Friedgut, G. K., & Nisan, N. . (2008). Elections Can Be Manipulated Often. Discussion Papers. presented at the 4. Retrieved from /files/dp481.pdf
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.