A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings

Cites Work

Unnamed Item
Unnamed Item
A Borda count for partially ordered ballots
Experiments with Kemeny ranking: What works when?
Median linear orders: Heuristics and a branch and bound algorithm
Average parameterization and partial kernelization for computing medians
The complexity of Kemeny elections
On the complexity of crossings in permutations
Fixed-parameter algorithms for Kemeny rankings
The median procedure in cluster analysis and social choice theory
Heuristic, branch-and-bound solver and improved space reduction for the median of permutations problem
Space reduction constraints for the median of permutations problem
A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
Handbook of social choice and welfare. Vol. 2
\(k\)-majority digraphs and the hardness of voting with a constant number of voters
A new approach for identifying the Kemeny median ranking
Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
Approaching the rank aggregation problem by local search-based metaheuristics
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
Topological sorting of large networks
Fixed-Parameter Algorithms for Kemeny Scores
A Consistent Extension of Condorcet’s Election Principle
A new rank correlation coefficient with application to the consensus ranking problem
Weighted Tournament Solutions
Handbook of Computational Social Choice
Rank Aggregation: Together We're Strong
Depth-First Search and Linear Graph Algorithms
Aggregating inconsistent information

This page was built for publication: A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings