Abstract
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, called votes, over a set of alternatives, called candidates, into a single preference list that has the minimum total τ-distance from the votes. The τ-distance between two preference lists is the number of pairs of candidates that are ordered differently in the two lists. We study the problem for preference lists that are total orders. We develop algorithms of running times \(O^*(1.403^{k_t})\), \(O^*(5.823^{k_t/m})\leq O^*(5.823^{k_{avg}})\) and \(O^*(4.829^{k_{max}})\) for the problem, ignoring the polynomial factors in the O * notation, where k t is the optimum total τ-distance, m is the number of votes, and k avg (resp. k max ) is the average (resp. maximum) over pairwise τ-distances of votes. Our algorithms improve the best previously known running times of \(O^*(1.53^{k_t})\) and \(O^*(16^{k_{avg}})\leq O^*(16^{k_{max}})\) [3,4], which also implies an \(O^*(16^{2k_t/m})\) running time. We also show how to enumerate all optimal solutions in \(O^*(36^{k_t/m}) \leq O^*(36^{k_{avg}})\) time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. Journal of the ACM 55(5), 1–27 (2008)
Bartholdi, J.J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare 6(2), 157–165 (1989)
Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: Fixed-parameter algorithms for Kemeny scores. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 60–71. Springer, Heidelberg (2008)
Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: How similarity helps to efficiently compute Kemeny rankings. In: AAMAS 2009: Proc. of the 8th Int. Conf. on Autonomous Agents and Multiagent Systems, pp. 657–664 (2009)
Biedl, T., Brandenburg, F.J., Deng, X.: Crossings and permutations. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 1–12. Springer, Heidelberg (2006)
Charon, I., Hudry, O.: A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR 5(1), 5–60 (2007)
Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. In: AAAI 2004: Proc. of the 19th National Conf. on Artificial Intelligence, pp. 697–702 (2004)
Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: WWW 2001: Proc. of the 10th Int. Conf. on World Wide Web, pp. 613–622 (2001)
Kemeny, J.G.: Mathematics without numbers. Daedalus 88, 575–591 (1959)
Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: STOC 2007: Proc. of the 39th Annual ACM Symp. on Theory of Computing, pp. 95–103 (2007)
Monjardet, B.: Tournois et ordres m\(\acute{e}\)dians pour une opinion. Math\(\acute{e}\)matiques et Sciences humaines, 55–73 (1973)
Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theoretical Computer Science 351(3), 446–458 (2006)
Williamson, D.P., van Zuylen, A.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 260–273. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Simjour, N. (2009). Improved Parameterized Algorithms for the Kemeny Aggregation Problem. In: Chen, J., Fomin, F.V. (eds) Parameterized and Exact Computation. IWPEC 2009. Lecture Notes in Computer Science, vol 5917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11269-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-11269-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11268-3
Online ISBN: 978-3-642-11269-0
eBook Packages: Computer ScienceComputer Science (R0)