Computational social choice: the first four centuries

Authors:
Ariel D. Procaccia
Affiliations:
Carnegie Mellon University
Venue:
XRDS: Crossroads, The ACM Magazine for Students - Computer Science in Service of Democracy
Year:
2011

When are elections with few candidates hard to manipulate?

Journal of the ACM (JACM)
Improved bounds for computing Kemeny rankings

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Junta distributions and the average-case complexity of manipulating elections

Journal of Artificial Intelligence Research
How hard is bribery in elections?

Journal of Artificial Intelligence Research
Socially desirable approximations for Dodgson's voting rule

Proceedings of the 11th ACM conference on Electronic commerce
The Geometry of Manipulation: A Quantitative Proof of the Gibbard-Satterthwaite Theorem

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Approximately strategy-proof voting

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One

Hi-index	0.00

Making the right decision.