Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Bartholdi III, J.J., Tovey, C.A., Trick, M.: The computational difficulty of manipulating an election. Social Choice and Welfare 6, 227–241 (1989)
2. Bartholdi III, J.J., Orlin, J.B.: Single transferable vote resists strategic voting. Social Choice and Welfare 8(4), 341–354 (1991)
3. Conitzer, V., Sandholm, T., Lang, J.: When ere elections with few candidates hard to manipulate? J. ACM 54, 1–33
4. Faliszewski, P., Hemaspaandra, E., Schnoor, H.: Copeland voting: ties matter. In: AAMAS 2008 (2008)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献