[39] C. Dwork and R. Numar and M. Naor and D. Sivakumar,Rank aggregation methods for the Web,10th International World Wide Web Conference,2001,613-622
[40] R. Fagin and R. Kumar and D. Sivakumar,Comparing top k lists,14th **annual Association for Computing**
Machinery symposium on Discrete algorithms,2003,28-36
[41] E. Hemaspaandra and H. Spakowski and J. Vogel,The Complexity **of Kemeny Elections,Theoretical**
Computer Science, Volume 349, Issue 3,2005,382-391
[42] P. Diaconis and R. Graham,Spearman's Footrule as a Measure of Disarray,Journal of the Royal Statistical Society, Series B,1977,262-268
[43] M. Ballester and G. Haeringer,A Characterization of Single-Peaked Preferences,UFAE and IAE Working Papers,2006
[44] P. Faliszewski and E. Hemaspaandra and L. Hemaspaandra and **J. Rothe,The shield that never was:**
societies with single-peaked preferences are more open to manipulation and control,12th **Conference on**
Theoretical Aspects of Rationality and Knowledge,2009,118-127
[45] E. Friedgut and G. Kalai and N. Nisan,Elections can be manipulated often,49th **Annual IEEE Symposium on Foundations of Computer Science,2008,243-249**
[46] T. Walsh,Where are the really hard manipulation problems? The phase transition in manipulating the veto rule.,28th **International Joint Conference on Artificial Intelligence,2009,324-329**
[47] S. Brams and D. Herschbach,The Science of Elections,Science,2001,1449 [48] C. List,Some Remarks on the Probability of Cycles,2001
[49] V. Conitzer,Eliciting Single-Peaked Preferences Using Comparison Queries,Sixth Conference on Autonomous Agents and Multi-Agent Systems,2007,420-427
[50] I. Tsetlin and M. Regenwetter and B. Grofman,The impartial culture maximizes the probability of majority cycles,Social Choice Welfare,2003,387-398
[51] W. Gehrlein,The probability of a Condorcet winner with a small number of voters,Elsevier Science,1998,317-321
[52] R. Korf,From approximate to optimal solutions: A case study of number partitioning,14th **International**
Joint Conference on Artificial Intelligence,1995,266-272
[53] A. Lin,The Complexity of Manipulating k-Approval Elections,arXiv:1005.4159,2010 [54] J. Pitt and L. Kamara and M. Sergot and A. Artikis,Voting in Multi-Agent Systems,The Computer Journal, 10.1093/comjnl/bxh164,2006
[55] M. Zuckerman and A. Procaccia and J. Rosenschein,Algorithms for the coalitional manipulation problem,Artificial Intelligence,2009
[56] J. Warners,A linear-time transformation of linear inequalities into **conjunctive normal form,Information**
Processing Letters,1998,63-69
[57] A. Lin,Solving Election Manipulation Using Partition Problems,AAMAS,To appear
[58] C. Connett,Manipulation of Elections by Minimal Coalitions,M.S. Thesis, Rochester Institute of Technology,2010
[59] L. Xia and V. Conitzer and A. Procaccia,A Scheduling Approach to **Coalitional Manipulation,11**th Association for Computing Machinery Conference on Electronic Commerce,275-284,2010