Rank Aggregation: Together We're Strong

DOI10.1137/1.9781611972894.4zbMath1430.68476OpenAlexW182456511MaRDI 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

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (20)

Rank aggregation: new bounds for MCx ⋮ Robust Plackett-Luce model for \(k\)-ary crowdsourced preferences ⋮ Recursive inversion models for permutations ⋮ Robust Learning of Consumer Preferences ⋮ A data-driven matching algorithm for ride pooling problem ⋮ Space reduction constraints for the median of permutations problem ⋮ A note on permutations and rank aggregation ⋮ 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 ⋮ Photo sequencing ⋮ Exploring the median of permutations problem ⋮ Experiments with Kemeny ranking: What works when? ⋮ Automedian sets of permutations: direct sum and shuffle ⋮ Using extension sets to aggregate partial rankings in a flexible setting ⋮ Rank aggregation in cyclic sequences ⋮ Average parameterization and partial kernelization for computing medians ⋮ An Algorithmic View of Voting ⋮ Fixed-parameter algorithms for Kemeny rankings ⋮ A new approach for identifying the Kemeny median ranking

This page was built for publication: Rank Aggregation: Together We're Strong