Abstract
Rank Aggregation is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem Kemeny Score is NP-complete even in case of four input rankings to be aggregated into a “median ranking”. We study efficient polynomial-time data reduction rules that allow us to find optimal median rankings. On the theoretical side, we improve a result for a “partial problem kernel” from quadratic to linear size. On the practical side, we provide encouraging experimental results with data based on web search and sport competitions, e.g., computing optimal median rankings for real-world instances with more than 100 candidates within milliseconds.
This is a preview of subscription content, log in via an institution to check access.
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), Article 23 (2008)
Bartholdi III, 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, 157–165 (1989)
Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: Fixed-parameter algorithms for Kemeny rankings. Theoretical Computer Science 410(45), 4554–4570 (2009)
Betzler, N., Guo, J., Komusiewicz, C., Niedermeier, R.: Average parameterization and partial kernelization for computing medians. Journal of Computer and System Sciences (2010), doi:10.1016/j.jcss.2010.07.005
Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. In: Proc. of 21st AAAI, pp. 620–626. AAAI Press, Menlo Park (2006)
Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. In: Proc. of 19th AAAI, pp. 697–702. AAAI Press, Menlo Park (2004)
Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the Web. In: Proc. of 10th WWW, pp. 613–622 (2001)
Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: Proc. of 22nd ACM SIGMOD, pp. 301–312. ACM, New York (2003)
Jackson, B.N., Schnable, P.S., Aluru, S.: Consensus genetic maps as median orders from inconsistent sources. IEEE/ACM Transactions on Computational Biology and Bioinformatics 5(2), 161–171 (2008)
Karpinski, M., Schudy, W.: Approximation schemes for the betweenness problem in tournaments and related ranking problems. In: Proc. of 21st ISAAC (to appear, 2010)
Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Proc. of 39th STOC, pp. 95–103. ACM, New York (2007)
Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. Journal of Computer and System Sciences 75, 137–153 (2009)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
Raman, V., Saurabh, S.: Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG. Information Processing Letters 104(2), 65–72 (2007)
Schalekamp, F., van Zuylen, A.: Rank aggregation: Together we’re strong. In: Proc. of 11th ALENEX, pp. 38–51. SIAM, Philadelphia (2009)
Simjour, N.: Improved parameterized algorithms for the Kemeny aggregation problem. In: Proc. of 4th IWPEC. LNCS, vol. 5917, pp. 312–323. Springer, Heidelberg (2009)
van Zuylen, A., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. Mathematics of Operations Research 34, 594–620 (2009)
Young, H., Levenglick, A.: A consistent extension of Condorcet’s election principle. SIAM Journal on Applied Mathematics 35(2), 285–300 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Betzler, N., Bredereck, R., Niedermeier, R. (2010). Partial Kernelization for Rank Aggregation: Theory and Experiments. In: Raman, V., Saurabh, S. (eds) Parameterized and Exact Computation. IPEC 2010. Lecture Notes in Computer Science, vol 6478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17493-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-17493-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17492-6
Online ISBN: 978-3-642-17493-3
eBook Packages: Computer ScienceComputer Science (R0)