Fixed-parameter algorithms for Kemeny rankings

Theoretical Computer Science

Volumn 410, Issue 45, 2009, Pages 4554-4570

  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

Computational social choice; Consensus finding; Fixed parameter tractability; Rank aggregation; Voting systems; Winner determination

Indexed keywords

COMPUTATIONAL SOCIAL CHOICE; CONSENSUS FINDING; FIXED-PARAMETER TRACTABILITY; RANK AGGREGATION; VOTING SYSTEMS; WINNER DETERMINATION;

COMPUTATIONAL COMPLEXITY; MATHEMATICAL OPERATORS; VOTING MACHINES;

COMPUTATIONAL EFFICIENCY;

EID: 70349404431     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.08.033     Document Type: Article

References (34)

1. Ailon N., Charikar M., and Newman A. Aggregating inconsistent information: Ranking and clustering. Journal of the ACM 55 5 (2008) Article 23 (October 2008)
2. Bartholdi III J., Tovey C.A., and Trick M.A. Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare 6 (1989) 157-165
3. Betzler N., Fellows M.R., Guo J., Niedermeier R., and Rosamond F.A. Fixed-parameter algorithms for Kemeny scores. Proc. of 4th AAIM. LNCS vol. 5034 (2008), Springer 60-71
4. Betzler N., Guo J., and Niedermeier R. Parameterized computational complexity of Dodgson and Young elections. Proc. of 11th SWAT. LNCS vol. 5124 (2008), Springer 402-413
5. N. Betzler, J. Uhlmann, Parameterized complexity of candidate control in elections and related digraph problems, Theoretical Computer Science, in press (doi:10.1016/j.tcs.2009.05.029), Available online 31 May 2009
6. J. Chen, Personal communication, December 2007
7. Chen J., Liu Y., Lu S., O'Sullivan B., and Razgon I. A fixed-parameter algorithm for the directed feedback vertex set problem. Journal of the ACM 55 5 (2008) Article No. 21
8. Christian R., Fellows M.R., Rosamond F.A., and Slinko A. On complexity of lobbying in multiple referenda. Review of Economic Design 11 3 (2007) 217-224
9. Conitzer V. Computing Slater rankings using similarities among candidates. Proc. of 21st AAAI (2006), AAAI Press 613-619
10. Conitzer V., Davenport A., and Kalagnanam J. Improved bounds for computing Kemeny rankings. Proc. of 21st AAAI (2006), AAAI Press 620-626
11. V. Conitzer, M. Rognlie, L. Xia, Preference functions that score rankings and maximun likelihood estimation, in: Proc. of 21st IJCAI, 2009, pp. 109-115
12. Conitzer V., and Sandholm T. Common voting rules as maximum likelihood estimators. Proc. of 21st UAI (2005), AUAI Press 145-152
13. Davenport A., and Kalagnanam J. A computational study of the Kemeny rule for preference aggregation. Proc. of 19th AAAI (2004), AAAI Press 697-702
14. de Caritat (Marquis de Condorcet) M.J.A.N. Essai sur l'application de l'analyse à la probabilité des décisions redues à la pluralité des voix (1785), L'Imprimerie Royal, Paris
15. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
16. C. Dwork, R. Kumar, M. Naor, D. Sivakumar, Rank aggregation methods for the Web, in: Proc. of 10th WWW, 2001, pp. 613-622
17. C. Dwork, R. Kumar, M. Naor, D. Sivakumar, Rank aggregation revisited, Manuscript, 2001
18. Faliszewski P., Hemaspaandra E., Hemaspaandra L.A., and Rothe J. Llull and Copeland voting broadly resist bribery and control. Proc. of 22nd AAAI (2007), AAAI Press 724-730
19. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer
20. Guo J., and Niedermeier R. Invitation to data reduction and problem kernelization. ACM SIGACT News 38 1 (2007) 31-45
21. Hemaspaandra E., Spakowski H., and Vogel J. The complexity of Kemeny elections. Theoretical Computer Science 349 (2005) 382-391
22. Hüffner F., Niedermeier R., and Wernicke S. Techniques for practical fixed-parameter algorithms. The Computer Journal 51 1 (2008) 7-25
23. Kemeny J. Mathematics without numbers. Daedalus 88 (1959) 571-591
24. Kenyon-Mathieu C., and Schudy W. How to rank with few errors. Proc. of 39th STOC (2007), ACM 95-103
25. Kleinberg J., and Tardos É. Algorithm Design (2006), Addison Wesley
26. Komusiewicz C., Niedermeier R., and Uhlmann J. Deconstructing intractability-A case study for Interval Constrained Coloring. Proc. of 20th CPM. Lecture Notes in Computer Science vol. 5577 (2009), Springer 207-220
27. Levenglick A. Fair and reasonable election systems. Behavioral Science 20 1 (1975) 34-46
28. Mahajan M., and Raman V. Parameterizing about guaranteed values: MaxSat and MaxCut. Journal of Algorithms 31 2 (1999) 335-354
29. Niedermeier R. Invitation to Fixed-Parameter Algorithms (2006), Oxford University Press
30. Niedermeier R., and Rossmanith P. A general method to speed up fixed-parameter-tractable algorithms. Information Processing Letters 73 (2000) 125-129
31. Raman V., and Saurabh S. Improved fixed parameter tractable algorithms for two edge problems: MAXCUT and MAXDAG. Information Processing Letters 104 2 (2007) 65-72
32. Schalekamp F., and van Zuylen A. Rank aggregation: Together we're strong. Proc. of 11th ALENEX (2009), SIAM 38-51
33. M. Truchon, An extension of the Condorcet criterion and Kemeny orders. Technical Report, cahier 98-15 du Centre de Recherche en Économie et Finance Appliquées, Université Laval, Québec, Candada, 1998
34. van Zuylen A., and Williamson D.P. Deterministic algorithms for rank aggregation and other ranking and clustering problems. Proc. of 5th WAOA. LNCS vol. 4927 (2007), Springer 260-273