1. Voting schemes for which it can be difficult to tell who won the election;Bartholdi;Social Choice and Welfare,1989
2. N. Betzler, M.R. Fellows, J. Guo, R. Niedermeier, F.A. Rosamond, Fixed-parameter algorithms for Kemeny rankings, Theoretical Computer Science 10, 4554-4570.
3. I. Caragiannis, J.A. Covey, M. Feldmann, C.M. Homan, C. Kaklamanis, N. Kramikolas, A.D. Procaccia, J.S. Rosenschein, On the approximability of Dodgson and Young elections, in: Proceedings of the 20th SODA, SIAM, 2009, pp. 1058–1067.
4. Y. Chevaleyre, U. Endriss, J. Lang, N. Maudet. A short introduction to computational social choice (invited paper), in: Proceedings of the 33rd SOFSEM, LNCS, vol. 4362, Springer, 2007, pp. 51–69.
5. On complexity of lobbying in multiple referenda;Christian;Review of Economic Design,2007