Complexity of and algorithms for Borda manipulation

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2011, Pages 657-662

  Davies, Jessica ^a   Katsirelos, George ^b   Narodytska, Nina ^c   Walsh, Toby ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITÉ PARIS SACLAY   (France)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; MANIPULATORS;

APPROXIMATION METHODS; APPROXIMATION PROBLEMS; BIN PACKING; BORDA RULE; MULTI PROCESSOR SCHEDULING; NP-HARD; NP-HARDNESS; VOTING RULES;

COMPUTATIONAL COMPLEXITY;

EID: 80055061484     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Bartholdi, J., and Orlin, J. 1991. Single transferable vote resists strategic voting. Social Choice and Welfare 8(4):341-354.
2. Bartholdi, J.; Tovey, C.; and Trick, M. 1989. The computational difficulty of manipulating an election. Social Choice and Welfare 6(3):227-241.
3. Brunetti, S.; Lungo, A.;A. Del; Gritzmann, P. and de Vries, S. 2008. On the reconstruction of binary and permutation matrices under (binary) tomographic constraints. Theor. Comput. Sci. 406(1-2):63-71.
4. Conitzer, V.; Sandholm, T.; and Lang, J. 2007. When are elections with few candidates hard to manipulate. JACM 54.
5. Davies, J.; Katsirelos, G.; Narodytska, N.; and Walsh, T. 2010. An empirical study of Borda manipulation. In COMSOC-10.
6. Hall, P. 1935. On representatives of subsets. Journal of the London Mathematical Society 26-30.
7. Krause, K. L.; Shen, V. Y.; and Schwetman, H. D. 1975. Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. JACM 22(4):522-550.
8. Nordh, G. 2010. A note on the hardness of Skolem-type sequences. Discrete Appl. Math. 158(8):63-71.
9. Walsh, T. 2010. An empirical study of the manipulability of single transferable voting. In Proc. of the 19th European Conf. on Artificial Intelligence (ECAI-2010). IOS Press.
10. Xia, L.; Zuckerman, M.; Procaccia, A.; Conitzer, V.; and Rosenschein, J. 2009. Complexity of unweighted coalitional manipulation under some common voting rules. In Proc. of 21st IJCAI, 348-353.
11. Xia, L.; Conitzer, V.; and Procaccia, A. 2010. A scheduling approach to coalitional manipulation. In Parkes, D.; Dellarocas, C.; and Tennenholtz, M., eds., Proc. 11th ACM Conference on Electronic Commerce (EC-2010), 275-284.
12. Yu, W.; Hoogeveen, H.; and Lenstra J.K. 2004. Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard. J. Scheduling 7(5): 333-348.
13. Zuckerman, M.; Procaccia, A.; and Rosenschein, J. 2009. Algorithms for the coalitional manipulation problem. Artificial Intelligence. 173(2):392-412.