Approximate Condorcet partitioning: solving large-scale rank aggregation problems

DOI10.1016/j.cor.2023.106164OpenAlexW4319017124MaRDI QIDQ6164371

Adolfo R. Escobedo, Sina Akbari

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

group decision-makingcomputational social choicerank aggregationCondorcet criterionKemeny-Snell distance

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
• Efficient algorithms using subiterative convergence for Kemeny ranking problem
• Voting schemes for which it can be difficult to tell who won the election
• Extending Condorcet's rule
• Tournament solutions and majority voting
• Partial evaluation in rank aggregation problems
• Exploring the median of permutations problem
• Iterative ranking aggregation using quality improvement of subgroup ranking
• Ensemble feature selection using election methods and ranker clustering
• An agglomerative hierarchical clustering algorithm for linear ordinal rankings
• Space reduction constraints for the median of permutations problem
• A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
• 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
• Distance-based and ad hoc consensus models in ordinal preference ranking
• A data-driven matching algorithm for ride pooling problem
• Preferential Arrangements
• A Consistent Extension of Condorcet’s Election Principle
• A new rank correlation coefficient with application to the consensus ranking problem
• Handbook of Computational Social Choice
• Rank Aggregation: Together We're Strong
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Preference–Approval Structures in Group Decision Making: Axiomatic Distance and Aggregation
• A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
• Aggregating inconsistent information

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