Unweighted coalitional manipulation under the borda rule is NP-hard

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 55-60

  Betzler, Nadja ^a   Niedermeier, Rolf ^a   Woeginger, Gerhard J ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BORDA RULE; COALITIONAL MANIPULATIONS; HARDNESS RESULT; NP-HARD; NP-HARDNESS; POSITIONAL SCORING RULES; VOTING RULES;

HARDNESS; MANIPULATORS;

ARTIFICIAL INTELLIGENCE;

EID: 84855604361     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-021     Document Type: Conference Paper

References (18)

1. J. J. Bartholdi III, C. A. Tovey, and M. A. Trick. The computational difficulty of manipulating an election. Social Choice and Welfare, 6:227-241, 1989.
2. N. Betzler, S. Hemmann, and R. Niedermeier. A multivariate complexity analysis of determining possible winners given incomplete votes. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), pages 53-58, 2009.
3. V. Conitzer, T. Sandholm, and J. Lang. When are elections with few candidates hard to manipulate? Journal of the ACM, 54(3):1-33, 2007.
4. J. Davies, G. Katsirelos, N. Narodytska, and T. Walsh. An empirical study of Borda manipulation. In Proceedings of the 3rd International Workshop on Computational Social Choice, pages 91-102, 2010.
5. J. Davies, G. Katsirelos, N. Narodytska, and T.Walsh. Complexity of and algorithms for Borda manipulation. Under review for AAAI 2011, 2011.
6. B. Dorn and I. Schlotter. Multivariate complexity analysis of swap bribery. In Proceedings of the 5th International Symposium on Parameterized and Exact Computation (IPEC), volume 6478 of LNCS, pages 107-122. Springer, 2010.
7. P. Faliszewski and A. Procaccia. AI's war on manipulation: Are we winning? AI Magazine, 31(4):53-64, 2010.
8. P. Faliszewski, E. Hemaspaandra, and L. A. Hemaspaandra. Using complexity to protect elections. Communications of the ACM, 53(1):74-82, 2010.
9. E. Hemaspaandra and L. A. Hemaspaandra. Dichotomy for voting systems. Journal of Computer and System Sciences, 73(1):73-83, 2007. (Pubitemid 44751003)
10. H. W. Lenstra. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8:538-548, 1983.
11. R. Niedermeier. Reflections on multivariate algorithmics and problem parameterization. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS'10), volume 5 of LIPIcs, pages 17-32, 2010.
12. A. Procaccia and J. S. Rosenschein. Junta distributions and the average-case complexity of manipulating elections. Journal of Artificial Intelligence Research, 28:157-181, 2007. (Pubitemid 46790302)
13. T. Walsh. Is computational complexity a barrier to manipulation? In Proceedings of the 11th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA), volume 6245 of LNCS, pages 1-7. Springer, 2010.
14. L. Xia and V. Conitzer. Generalized scoring rules and the frequency of coalitional manipulability. In Proceedings of the 9th ACM Conference on Electronic Commerce (EC), pages 109-118, 2008.
15. L. Xia, V. Conitzer, and A. D. Procaccia. A scheduling approach to coalitional manipulation. In Proceedings of the 11th ACM Conference on Electronic Commerce (EC), pages 275-284. ACM, 2010.
16. W. Yu, H. Hoogeveen, and J. K. Lenstra. Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. Journal of Scheduling, 7:333-348, 2004.
17. W. Yu. Personal communication. 1996.
18. M. Zuckerman, A. D. Procaccia, and J. S. Rosenschein. Algorithms for the coalitional manipulation problem. Artificial Intelligence, 173(2):392-412, 2009.