Approximate Condorcet partitioning: solving large-scale rank aggregation problems

DOI10.1016/J.COR.2023.106164MaRDI QIDQ6164371zbMATH OpenOpenAlexFDO

Authors Sina Akbari, Adolfo R. Escobedo

Publication date 4 July 2023

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2023.106164

zbMATH Keywords

computational social choiceCondorcet criteriongroup decision-makingKemeny-Snell distancerank aggregation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Experiments with Kemeny ranking: What works when?
• Efficient algorithms using subiterative convergence for Kemeny ranking problem
• An algorithm for rank aggregation problem
• Approximate rank aggregation (preliminary version)
• Partial kernelization for rank aggregation: theory and experiments

Cites work

• A Consistent Extension of Condorcet’s Election Principle
• A data-driven matching algorithm for ride pooling problem
• A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
• A new approach for identifying the Kemeny median ranking
• A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
• A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
• A new rank correlation coefficient with application to the consensus ranking problem
• Aggregating inconsistent information: ranking and clustering
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• An agglomerative hierarchical clustering algorithm for linear ordinal rankings
• Approaching the rank aggregation problem by local search-based metaheuristics
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Distance-based and ad hoc consensus models in ordinal preference ranking
• Efficient algorithms using subiterative convergence for Kemeny ranking problem
• Ensemble feature selection using election methods and ranker clustering
• Exploring the median of permutations problem
• Extending Condorcet's rule
• Handbook of Computational Social Choice
• scientific article; zbMATH DE number 5485441 (Why is no real title available?)
• scientific article; zbMATH DE number 3405712 (Why is no real title available?)
• Iterative ranking aggregation using quality improvement of subgroup ranking
• Partial evaluation in rank aggregation problems
• Preference–Approval Structures in Group Decision Making: Axiomatic Distance and Aggregation
• Preferential Arrangements
• Rank aggregation: together we're strong
• Space reduction constraints for the median of permutations problem
• Tournament solutions and majority voting
• Voting schemes for which it can be difficult to tell who won the election

Cited in

(6)

• A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
• Adaptive partitioning schemes for bipartite ranking
• Using balanced iterative reducing and clustering hierarchies to compute approximate rank statistics on massive datasets
• Consensus formation from heterogeneous rankings based on minimum variance
• Heuristic methods for top-k list aggregation under the generalized Kendall tau distance
• Particle swarm optimization for preference rankings

This page was built for publication: Approximate Condorcet partitioning: solving large-scale rank aggregation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164371)