A Quantitative Version of the Gibbard–Satterthwaite Theorem for Three Alternatives
From MaRDI portal
Publication:3093629
DOI10.1137/090756740zbMath1229.05264arXiv1105.5129OpenAlexW2006063189MaRDI QIDQ3093629
Gil Kalai, Ehud Friedgut, Noam Nisan, Nathan Keller
Publication date: 18 October 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.5129
Social choice (91B14) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (9)
A quantitative Gobbard-Satterthwaite theorem without neutrality ⋮ Probabilistic view of voting, paradoxes, and manipulation ⋮ Iterative voting and acyclic games ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ The probability of intransitivity in dice and close elections ⋮ Between Arrow and Gibbard-Satterthwaite. A representation theoretic approach ⋮ Distance restricted manipulation in voting ⋮ Comments on: ``Remarkable polyhedra related to set functions, games and capacities ⋮ Gaussian bounds for noise correlation of resilient functions
This page was built for publication: A Quantitative Version of the Gibbard–Satterthwaite Theorem for Three Alternatives
