Rank Aggregation: Together We're Strong

DOI10.1137/1.9781611972894.4zbMath1430.68476MaRDI QIDQ5233564

Anke van Zuylen, Frans Schalekamp

Publication date: 11 September 2019

Published in: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972894.4

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R05: Combinatorics in computer science

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms

Related Items

Robust Learning of Consumer Preferences, A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings, Solving the Kemeny ranking aggregation problem with quantum optimization algorithms, Approximate Condorcet partitioning: solving large-scale rank aggregation problems, Experiments with Kemeny ranking: What works when?, Rank aggregation in cyclic sequences, A note on permutations and rank aggregation, Average parameterization and partial kernelization for computing medians, Photo sequencing, Fixed-parameter algorithms for Kemeny rankings, Rank aggregation: new bounds for MCx, Robust Plackett-Luce model for \(k\)-ary crowdsourced preferences, Exploring the median of permutations problem, Using extension sets to aggregate partial rankings in a flexible setting, Recursive inversion models for permutations, Space reduction constraints for the median of permutations problem, Automedian sets of permutations: direct sum and shuffle, A new approach for identifying the Kemeny median ranking, A data-driven matching algorithm for ride pooling problem, An Algorithmic View of Voting