A. Gibbard, Manipulation of Voting Schemes: A General Result, Econometrica, vol.41, issue.4, pp.587-602, 1973.
DOI : 10.2307/1914083

M. Satterthwaite, Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions, Journal of Economic Theory, vol.10, issue.2, pp.187-217, 1975.
DOI : 10.1016/0022-0531(75)90050-2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.471.9842

O. Lev and J. S. Rosenschein, Convergence of Iterative Voting, the Eleventh International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2012), pp.611-618, 2012.

M. Zuckerman, A. D. Procaccia, and J. S. Rosenschein, Algorithms for the coalitional manipulation problem, Artificial Intelligence, vol.173, issue.2, pp.392-412, 2009.
DOI : 10.1016/j.artint.2008.11.005
URL : http://doi.org/10.1016/j.artint.2008.11.005

N. Betzler, R. Niedermeier, and G. Woeginger, Unweighted coalitional manipulation under the Borda rule is NP-hard, Proceedings of the 22nd International Joint Conference on Artificial Intelligence International Joint Conference on Artificial Intelligence, 2011.

J. Bartholdi, C. A. Tovey, and M. A. Trick, The computational difficulty of manipulating an election, Social Choice and Welfare, vol.8, issue.3, pp.157-165, 1989.
DOI : 10.1007/BF00295861

V. Conitzer, T. Sandholm, and J. Lang, When are elections with few candidates hard to manipulate?, Journal of the ACM, vol.54, issue.3, pp.1-33, 2007.
DOI : 10.1145/1236457.1236461