Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard
暂无分享,去创建一个
Gerhard J. Woeginger | Rolf Niedermeier | Nadja Betzler | G. Woeginger | R. Niedermeier | Nadja Betzler
[1] Ildikó Schlotter,et al. Multivariate Complexity Analysis of Swap Bribery , 2010, Algorithmica.
[2] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[3] Toby Walsh,et al. Complexity of and Algorithms for Borda Manipulation , 2011, AAAI.
[4] Rolf Niedermeier,et al. Reflections on Multivariate Algorithmics and Problem Parameterization , 2010, STACS.
[5] Vincent Conitzer,et al. Generalized scoring rules and the frequency of coalitional manipulability , 2008, EC '08.
[6] Rolf Niedermeier,et al. A logic for causal reasoning , 2003, IJCAI 2003.
[7] Piotr Faliszewski,et al. Using complexity to protect elections , 2010, Commun. ACM.
[8] Toby Walsh,et al. Is computational complexity a barrier to manipulation? , 2010, Annals of Mathematics and Artificial Intelligence.
[9] Vincent Conitzer,et al. When are elections with few candidates hard to manipulate? , 2007, J. ACM.
[10] Edith Hemaspaandra,et al. Dichotomy for voting systems , 2005, J. Comput. Syst. Sci..
[11] Toby Walsh,et al. An Empirical Study of Borda Manipulation , 2010, ArXiv.
[12] Ariel D. Procaccia,et al. Junta Distributions and the Average-Case Complexity of Manipulating Elections , 2007, J. Artif. Intell. Res..
[13] Han Hoogeveen,et al. Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard , 2004, J. Sched..
[14] M. Trick,et al. The computational difficulty of manipulating an election , 1989 .
[15] Vincent Conitzer,et al. A scheduling approach to coalitional manipulation , 2010, EC '10.
[16] Ariel D. Procaccia,et al. Algorithms for the coalitional manipulation problem , 2008, SODA '08.
[17] Piotr Faliszewski,et al. AI's War on Manipulation: Are We Winning? , 2010, AI Mag..