Fixed-parameter algorithms for Kemeny rankings

@article{Betzler2009FixedparameterAF,
  title={Fixed-parameter algorithms for Kemeny rankings},
  author={Nadja Betzler and Michael R. Fellows and Jiong Guo and Rolf Niedermeier and Frances A. Rosamond},
  journal={Theor. Comput. Sci.},
  year={2009},
  volume={410},
  pages={4554-4570}
}
The computation of Kemeny rankings is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “consensus permutation” that is “closest” to the given set of permutations. Unfortunately, the problem is NP-hard. We provide a broad study of the parameterized complexity for computing optimal Kemeny rankings. Beside the three obvious parameters “number of votes”, “number of candidates”, and solution size (called… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 36 references

Parameterized Complexity Theory

Texts in Theoretical Computer Science. An EATCS Series • 2006
View 5 Excerpts
Highly Influenced

and D

C. Dwork, R. Kumar, M. Naor
Sivakumar. Rank aggregation revisited • 2001
View 6 Excerpts
Highly Influenced

Preference functions that score rankings and maximun likelihood estimation

V. Conitzer, M. Rognlie, L. Xia
Proc. of 21st IJCAI • 2009
View 1 Excerpt

Similar Papers

Loading similar papers…