How similarity helps to efficiently compute Kemeny rankings

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 2, Issue , 2009, Pages 1030-1037

  Betzler, Nadja ^a   Fellows, Michael R ^b   Guo, Jiong ^a   Niedermeier, Rolf ^a   Rosamond, Frances A ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

Exact algorithm; Fixed parameter tractability; NP hard problem; Rank aggregation; Structural parameterization

Indexed keywords

AUTONOMOUS AGENTS; COMPUTATIONAL COMPLEXITY;

EXACT ALGORITHMS; FIXED-PARAMETER ALGORITHMS; FIXED-PARAMETER TRACTABILITY; MAXIMUM RANGES; PAIRWISE DISTANCES; PARAMETER TRACTABILITY; RANK AGGREGATION; RUNNING TIME;

MULTI AGENT SYSTEMS;

EID: 84899891115     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. Journal of the ACM, 55(5), 2008. Article 23 (October 20 2008).
2. J. Bartholdi, C. A. Tovey, and M. A. Trick. Voting [2i schemes for which it can be difficult to tell who won the election. Social Choice and Welfare, 6:157-165, 1989.
3. N. Betzler, M. R. Fellows, J. Guo, R. Niedermeier, and F. A. Rosamond. Fixed-parameter algorithms for Kemeny scores. In Proc. of 4th AAIM, volume 5034 of LNCS, pages 60-71. Springer, 2008.
4. N. Betzler, J. Guo, and R. Niedermeier. Parameterized computational complexity of Dodgson and Young elections. In Proc. of 11th SWAT, volume 5124 of LNCS, pages 402-413. Springer, 2008.
5. N. Betzler and J. Uhlmann. Parameterized complexity of candidate control in elections and related digraph problems. In Proc. of 2nd COCOA '08, volume 5165 of LNCS, pages 43-53. Springer, 2008.
6. R. Christian, M. R. Fellows, F. A. Rosamond, and A. Slinko. On complexity of lobbying in multiple referenda. Review of Economic Design, 2(3):217-224.
7. V. Conitzer. Computing Slater rankings using similarities among candidates. In Proc. 21st AAAI, pages 613-619. AAAI Press, 2006.
8. V. Conitzer, A. Davenport, and J. Kalagnanam. Improved bounds for computing Kemeny rankings. In Proc. 21st AAAI, pages 620-626. AAAI Press, 2006.
9. V. Conitzer, M. Rognlie, and L. Xia. Preference functions that score rankings and maximun likelihood estimation. In Proc. of 2nd COMSOC, pages 181-192.
10. V. Conitzer and T. Sandholm. Common voting rules as maximum likelihood estimators. In Proc. of 21st UAI, pages 145-152. AUAI Press, 2005.
11. A. Davenport and J. Kalagnanam. A computational study of the Kemeny rule for preference aggregation. In Proc. 19th AAAI, pages 697-702. AAAI Press, 2004.
12. M. J. A. N. de Caritat (Marquis de Condorcet). Essai sur ['application de Tanalyse a la probability des decisions redues a la pluralite des voix. Paris: L'Imprimerie Royal, 1785.
13. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
14. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the Web. In Proc. of 10th WWW, pages 613-622, 2001.
15. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation revisited, 2001. Manuscript.
16. P. Faliszewski, E. Hemaspaandra, L. A. Hemaspaandra, and J. Rothe. Llull and Copeland voting broadly resist bribery and control. In Proc. of 22nd AAAI, pages 724-730. AAAI Press, 2007.
17. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006.
18. E. Hemaspaandra, H. Spakowski, and J. Vogel. The complexity of Kemeny elections. Theoretical Computer Science, 349:382-391, 2005.
19. C. Kenyon-Mathieu and W. Schudy. How to rank with few errors. In Proc. 39th STOC, pages 95-103. ACM, 2007.
20. J. Kleinberg and E. Tardos. Algorithm Design. Addison Wesley, 2006.
21. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.
22. M. Truchon. An extension of the Condorcet criterion and Kemeny orders. Technical report, cahier 98-15 du Centre de Recherche en Economie et Finance Appliquees, Universite Laval, Quebec, Candada, 1998.
23. A. van Zuylen and D. P. Williamson. Deterministic algorithms for rank aggregation and other ranking and clustering problems. In Proc. 5th WAOA, volume 4927 of LNCS, pages 260-273. Springer, 2007.