A quantitative Gibbard-Satterthwaite theorem without neutrality
- 102 Downloads
Recently, quantitative versions of the Gibbard-Satterthwaite theorem were proven for k=3 alternatives by Friedgut, Kalai, Keller and Nisan and for neutral functions on k ≥ 4 alternatives by Isaksson, Kindler and Mossel.
We prove a quantitative version of the Gibbard-Satterthwaite theorem for general social choice functions for any number k ≥ 3 of alternatives. In particular we show that for a social choice function f on k ≥ 3 alternatives and n voters, which is ε-far from the family of nonmanipulable functions, a uniformly chosen voter profile is manipulable with probability at least inverse polynomial in n, k, and ε −1.
Ours is a unified proof which in particular covers all previous cases established before. The proof crucially uses reverse hypercontractivity in addition to several ideas from the two previous proofs. Much of the work is devoted to understanding functions of a single voter, and in particular we also prove a quantitative Gibbard-Satterthwaite theorem for one voter.
Mathematics Subject Classification (2000)05A05
Unable to display preview. Download preview PDF.
- K. Arrow: Social Choice and Individual Values, Yale University Press, 2nd edition, 19–3.Google Scholar
- V. Conitzer and T. Sandholm: Nonexistence of Voting Rules That Are Usually Hard to Manipulate, in: Proceedings of the 21st National Conference on Artificial Intelligence, volume 21, 627–634, 2006.Google Scholar
- P. Faliszewski and A. D. Procaccia: AI’sWar on Manipulation: AreWe Winning? AI Magazine 31 (2010), 53–64.Google Scholar
- E. Friedgut, G. Kalai and N. Nisan: Elections can be manipulated often, in: Proceedings of the 49th Annual Symposium on Foundations of Computer Science, 243–249. IEEE, 2008.Google Scholar
- A. Gibbard: Manipulation of Voting Schemes: A General Result, Econometrica: Journal of the Econometric Society, 587–601, 1993.Google Scholar
- J. H. Lindsey: Assignment of Numbers to Vertices, American Mathematical Monthly, 508–516, 1994.Google Scholar
- E. Mossel and M. Z. Rácz: A quantitative Gibbard-Satterthwaite theorem without neutrality, in: Proceedings of the 44th ACM Symposium on Theory of Computing (STOC), 1041–1060. ACM, 2002.Google Scholar
- H. Moulin: The Strategy of Social Choice, North-Holland, 1993.Google Scholar
- L. Xia and V. Conitzer: A Sufficient Condition for Voting Rules to be Frequently Manipulable, in: Proceedings of the 9th ACM Conference on Electronic Commerce, 99–108. ACM, 2008.Google Scholar