A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
type: Item
instance of: scholarly article
title: A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
author: Pierre Andrieu
author: Sarah Cohen-Boulakia
author: Miguel Couceiro
author: Alain Denise
author: Adeline Pierrot
published in: International Journal of Approximate Reasoning
publication date: 2023-11-16T00:00:00Z
Mathematics Subject Classification ID: 91B14
zbMATH DE Number: 7766536
zbMATH Keywords: consensus ranking
zbMATH Keywords: Kemeny rank aggregation
zbMATH Keywords: incomplete rankings
zbMATH Keywords: rankings with ties
zbMATH Keywords: partitioning methods
MaRDI profile type: Publication
cites work: Handbook of social choice and welfare. Vol. 2
cites work: Handbook of Computational Social Choice
cites work: Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
cites work: Aggregating inconsistent information
cites work: Experiments with Kemeny ranking: What works when?
cites work: Median linear orders: Heuristics and a branch and bound algorithm
cites work: \(k\)-majority digraphs and the hardness of voting with a constant number of voters
cites work: Q3549601
cites work: On the complexity of crossings in permutations
cites work: Fixed-parameter algorithms for Kemeny rankings
cites work: Average parameterization and partial kernelization for computing medians
cites work: Heuristic, branch-and-bound solver and improved space reduction for the median of permutations problem
cites work: Space reduction constraints for the median of permutations problem
cites work: Fixed-Parameter Algorithms for Kemeny Scores
cites work: Approaching the rank aggregation problem by local search-based metaheuristics
cites work: Rank Aggregation: Together We're Strong
cites work: A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
cites work: A Consistent Extension of Condorcet’s Election Principle
cites work: A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
cites work: Weighted Tournament Solutions
cites work: The complexity of Kemeny elections
cites work: A Borda count for partially ordered ballots
cites work: Social choice and individual values
cites work: A new rank correlation coefficient with application to the consensus ranking problem
cites work: The median procedure in cluster analysis and social choice theory
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Topological sorting of large networks
cites work: A new approach for identifying the Kemeny median ranking
DOI: 10.1016/J.IJAR.2023.109035
description: scientific article; zbMATH DE number 7766536