K.J. Arrow, A.K. Sen and K. Suzumura. Handbook of Social Choice and Welfare. North Holland, Elsevier, 2002 [OpenAIRE]
 J. Bartholdi and J. Orlin. Single transferable vote resists strategic voting. In Social Choice and Welfare, 8(4):341-354, 1991. [OpenAIRE]
 J.J. Bartholdi, C. A. Tovey and M. A. Trick, The computational difficulty of manipulating an election. In Social Choice and Welfare 6(3):227-241, 1989. [OpenAIRE]
 V. Conitzer and T. Sandholm. Nonexistence of voting rules that are usually hard to manipulate. InProc. AAAI'06, 2006.
 V. Conitzer and T. Sandholm. Universal Voting Protocol Tweaks to Make Manipulation Hard. In Proc. IJCAI'03: 781-788, 2003. [OpenAIRE]
 G. Demange, D. Gale, and M. Sotomayor. A further note on the stable matching problem. In Discrete Applied Mathematics, 16:217-222, 1987. [OpenAIRE]
 L. Dubins and D. Freedman. Machiavelli and the Gale-Shapley algorithm. In American Mathematical Monthly, 88:485-494, 1981.
 D. Gale, L. S. Shapley. College Admissions and the Stability of Marriage. In Amer. Math. Monthly, 69:9-14, 1962.
 D. Gale and M. Sotomayor. Some remarks on the stable matching prob- lem. Discrete Applied Mathematics, 11:223-232, 1985. [OpenAIRE]
 D. Gale and M. Sotomayor. Machiavelli and the stable matching problem. American Mathematical Monthly, 92:261-268, 1985. [OpenAIRE]
 A. Gibbard. Manipulation of Voting Schemes: A General Result. In Econometrica, 41(3):587-601, 1973. [OpenAIRE]
 D. Gusfield and R. W. Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Boston, Mass.,1989.
 D. Gusfield. Three fast algorithms for four problems in stable marriage. In SIAM J. of Computing, 16(1), 1987. [OpenAIRE]
 C.-C. Huang. Cheating by men in the Gale-Shapley stable matching algorithm. In ESA'06, pages 418-431, Springer-Verlag, 2006.
 Robert W. Irving, P. Leather and D. Gusfield, An efficient algorithm for the “optimal” stable marriage, In JACM 34(3):532-543,1987. [OpenAIRE]