Approximate Condorcet Partitioning: Solving large-scale rank aggregation problems

Sina Akbari, Adolfo R. Escobedo

Research output: Contribution to journalArticlepeer-review


Rank aggregation has ubiquitous applications in computer science, operations research, and various other fields. Most attention on this problem has focused on an NP-hard variant known as Kemeny aggregation, for which solution approaches with provable guarantees that can handle difficult high-dimensional instances remain elusive. This work introduces exact and approximate methodologies inspired by the social choice foundations of the problem, namely the Condorcet Criterion. We formalize the concept of the finest-Condorcet partition for rankings that may contain ties and specify its required conditions. We prove that this partition is unique and devise an efficient algorithm to obtain it. To deal with instances where it does not yield many subsets, we propose Approximate Condorcet Partitioning (ACP), with which larger subsets can be further broken down and more easily solved. ACP is a scalable solution technique capable of handling large instances while still providing provable guarantees. Although ACP approximation factors are instance-specific, their values were lower than those offered by all known constant-factor approximation schemes — inexact algorithms whose resulting objective values are guaranteed to be within a specified fixed percent of the optimal objective value — for all 113 instances tested herein (containing up to 2,820 items). What is more, ACP obtained solutions that deviated by at most two percent from the optimal objective function values for a large majority of these instances.

Original languageEnglish (US)
Article number106164
JournalComputers and Operations Research
StatePublished - May 2023
Externally publishedYes


  • Computational social choice
  • Condorcet criterion
  • Group decision-making
  • Kemeny–Snell distance
  • Rank aggregation

ASJC Scopus subject areas

  • General Computer Science
  • Modeling and Simulation
  • Management Science and Operations Research


Dive into the research topics of 'Approximate Condorcet Partitioning: Solving large-scale rank aggregation problems'. Together they form a unique fingerprint.

Cite this