A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives

05/25/2011
by   Ehud Friedgut, et al.
0

The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three 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 a non-negligible probability for any election rule among three alternatives that is far from being a dictatorship and from having only two alternatives in its range.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/14/2021

A Smoothed Impossibility Theorem on Condorcet Criterion and Participation

In 1988, Moulin proved an insightful and surprising impossibility theore...
research
04/27/2020

A Phase Transition in Arrow's Theorem

Arrow's Theorem concerns a fundamental problem in social choice theory: ...
research
12/14/2019

The Crawler: Two Equivalence Results for Object (Re)allocation Problems when Preferences Are Single-peaked

For object reallocation problems, if preferences are strict but otherwis...
research
04/08/2018

Robust Bounds on Choosing from Large Tournaments

Tournament solutions provide methods for selecting the "best" alternativ...
research
05/01/2021

Generalized Kings and Single-Elimination Winners in Random Tournaments

Tournaments can be used to model a variety of practical scenarios includ...
research
06/02/2023

Coding information into all infinite subsets of a dense set

Suppose you have an uncomputable set X and you want to find a set A, all...
research
09/28/2022

Quantitative Khintchine in Simultaneous Approximation

In a ground-breaking work <cit.>, Beresnevich and Yang recently proved K...

Please sign up or login with your details

Forgot password? Click here to reset