Experiments with Kemeny ranking: What works when?

Mathematical Social Sciences

Volumn 64, Issue 1, 2012, Pages 28-40

  Ali, Alnur ^a   Meilǎ, Marina ^b  

^a MICROSOFT   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84861777150     PISSN: 01654896     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mathsocsci.2011.08.008     Document Type: Article

References (31)

1. Ailon N., Charikar M., Newman A. Aggregating inconsistent information: ranking and clustering. Proceedings of the 37th Annual ACM Symposium on Theory of Computing 2005, 684-693. Association for Computing Machinery (ACM).
2. Arrow K.J. Social Choice and Individual Values 1963, Yale University Press.
3. Bartholdi J., Tovey C.A., Trick M. Voting schemes for which it can be difficult to tell who won. Social Choice and Welfare 1989, 6:157-165.
4. Betzler N., Bredereck R., Niedermeier R. Partial kernelization for rank aggregation: theory and experiments. Lecture Notes in Computer Science 2010, Springer-Verlag.
5. Betzler N., Fellows M.R., Guo J., Niedermeier R., Rosamond F.A. Fixed-parameter algorithms for Kemeny rankings. Theoretical Computer Science 2009, 410:4554-4570.
6. Borda J. Memoire sur les Elections au Scrutin 1781, Histoire de l'Academie Royal des Sciences.
7. Chanas S., Kobylanski P. A new heuristic algorithm solving the linear ordering problem. Computational Optimization and Applications 1996, 6:191-205.
8. Cohen W.W., Schapire R.E., Singer Y. Learning to order things. Journal of Artificial Intelligence Research 1998, 10:243-270.
9. Coleman, T., Wirth, A., 2008. Ranking tournaments: local search and a new algorithm. In: Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX, pp. 133-141.
10. Conitzer, V., Davenport, A., Kalagnanam, J., 2006. Improved bounds for computing Kemeny rankings. In: Proceedings of the 21st National Conference on Artificial Intelligence, AAAI, Boston, MA, pp. 620-627.
11. Copeland, A., 1951. A 'reasonable' social welfare function. Technical Report. Seminar on Applications of Mathematics to Social Sciences, University of Michigan.
12. Davenport, A., Kalagnanam, J., 2004. A computational study of the Kemeny rule for preference aggregation. In: Proceedings of the 19th National Conference on Artificial Intelligence, AAAI, San Jose, CA, pp. 697-702.
13. Diaconis P., Graham R.L. Spearman's footrule as a measure of disarray. Journal of the Royal Statistical Society. Series B 1977, 39:262-268.
14. Dwork, C., Kumar, R., Naor, M., Sivakumar, D., 2001. Rank aggregation methods for the web. In: Proceedings of the 10th International World Wide Web Conference, WWW, pp. 613-622.
15. Efron B., Tibshirani R.J. An Introduction to the Bootstrap 1993, Chapman and Hall.
16. Ephrati E., Rosenschein J.S. Multi-agent planning as a dynamic search for social consensus. Proceedings of the 13th International Joint Conference on Artificial Intelligence 1993, 423-429. Morgan Kaufmann.
17. Fligner M.A., Verducci J.S. Distance based ranking models. Journal of the Royal Statistical Society. Series B 1986, 48:359-369.
18. Kemeny J.L., Snell J.G. Mathematical Models in the Social Sciences 1962, Blaisdell, New York.
19. Kenyon-Mathieu, C., Schudy, W., 2007. How to rank with few errors. In: Proceedings of the Thirty Ninth Annual ACM Symposium on Theory of Computing, STOC, pp. 95-103.
20. Luce R.D. Individual Choice and Behavior: A Theoretical Analysis 2005, Dover.
21. Mallows C.L. Non-null ranking models. Biometrika 1957, 44:114-130.
22. Mandhani, B., Meilǎ, M., 2009. Tractable search for learning exponential models of rankings. In: Proceedings of the 12th International Conference on Artificial Intelligence and Statistics, AISTATS, vol. 5, pp. 392-399.
23. Mao Y., Lebanon G. Non-parametric modelling of partially ranked data. Journal of Machine Learning Research 2008, 9:2401-2429.
24. Meilǎ M., Bao L. An exponential family model over infinite rankings. Journal of Machine Learning Research 2010, 10:3481-3518.
25. Meilǎ, M., Phadnis, K., Patterson, A., Bilmes, J., 2007. Consensus ranking under the exponential model. In: Proceedings of the 23rd Annual Conference on Uncertainty in Artificial Intelligence, UAI, pp. 285-294.
26. Pennock D.M., Horvitz E., Giles C.L. Social choice theory and recommender systems: analysis of the axiomatic foundations of collaborative filtering. Proceedings of the 17th National Conference on Artificial Intelligence 2000, 729-734. AAAI Press.
27. Plackett R.L. The analysis of permutations. Applied Statistics 1975, 24:193-202.
28. Schalekampf, F., van Zuylen, A., 2009. Rank aggregation: together we're strong. In: Proceedings of the 11th SIAM Workshop on Algorithm Engineering and Experiments, ALENEX, pp. 38-51.
29. Young P. Optimal voting rules. Journal of Economic Perspectives 1995, 9:51-64.
30. Young H.P., Levenglick A. A consistent extension of condorcet's election principle. SIAM Journal on Applied Mathematics, C 1978, 35:285-300.
31. van Zuylen, A., Williamson, D.P., 2007. Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Proceedings of the 5th Workshop on Approximation and Online Algorithms, WAOA, pp. 260-273.