A quantitative gibbard-satterthwaite theorem without neutrality

DOI10.1145/2213977.2214071zbMath1286.91046arXiv1110.5888OpenAlexW2144211415MaRDI QIDQ5415534

Miklós Z. Rácz, Elchanan Mossel

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.5888

zbMATH Keywords

isoperimetric inequalitiesvotingcomputational social choicemanipulationreverse hypercontractivityGibbard-Satterthwaite

Mathematics Subject Classification ID

Voting theory (91B12) Social choice (91B14)

Related Items

A quantitative Gobbard-Satterthwaite theorem without neutrality, Probabilistic view of voting, paradoxes, and manipulation, Normalized range voting broadly resists control, A topological proof of the Gibbard-Satterthwaite theorem, Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey, Control complexity in Bucklin and fallback voting: a theoretical analysis, Hypercontractive inequalities via SOS, and the Frankl--Rödl graph