Elections Can be Manipulated Often

Abstract

The Gibbard-Satterthwaite theorem states that every non-trivial voting method among 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 among 3 alternatives… (More)
DOI: 10.1109/FOCS.2008.87

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Statistics

0102020082009201020112012201320142015201620172018
Citations per Year

120 Citations

Semantic Scholar estimates that this publication has 120 citations based on the available data.

See our FAQ for additional information.