Author:
Fitzsimmons Zack,Hemaspaandra Edith
Publisher
Springer Nature Switzerland
Reference34 articles.
1. Bartholdi, J., Tovey, C., Trick, M.: The computational difficulty of manipulating an election. Soc. Choice Welfare 6(3), 227–241 (1989)
2. Bartholdi, J., Tovey, C., Trick, M.: How hard is it to control an election? Math. Comput. Model. 16(8/9), 27–40 (1992)
3. Baumeister, D., Roos, M., Rothe, J., Schend, L., Xia, L.: The possible winner problem with uncertain weights. In: Proceedings of the 20th European Conference on Artificial Intelligence, pp. 133–138 (2012)
4. Betzler, N., Dorn, B.: Towards a dichotomy of finding possible winners in elections based on scoring rules. J. Comput. Syst. Sci. 76(8), 812–836 (2010)
5. Betzler, N., Niedermeier, R., Woeginger, G.: Unweighted coalitional manipulation under the Borda rule is NP-hard. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 55–60 (2011)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献