Condorcet Winner

The Condorcet winner is a benchmark concept in social choice theory, named after the 18th-century French mathematician and philosopher Marie Jean Antoine Nicolas de Caritat, Marquis de Condorcet. In his 1785 Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix, Condorcet proposed that the legitimate winner of an election is the candidate who defeats every rival in a pairwise majority comparison.

To find a Condorcet winner, analysts construct a matrix of pairwise contests using ranked ballots. If candidate A is preferred to B by a majority, and also preferred to C by a majority, and so on against every other candidate, then A is the Condorcet winner. Such a candidate does not always exist: preferences can produce the Condorcet paradox, in which majorities cycle (A beats B, B beats C, C beats A), leaving no undefeated candidate.

A voting method is called Condorcet-consistent if it always elects the Condorcet winner when one exists. Examples include the Schulze method (used by Wikimedia, the Pirate Party of Sweden, and Debian for internal elections), Ranked Pairs, and Copeland's method. By contrast, plurality (first-past-the-post), instant-runoff voting (IRV), and the Borda count can all fail this criterion. A frequently cited real-world example is the 2009 mayoral election in Burlington, Vermont, where IRV elected Bob Kiss even though Andy Montroll would have beaten every other candidate head-to-head.

The concept matters in institutional design because it offers a principled answer to "who should win?" when voters have rich preferences over more than two options. It is also central to Arrow's impossibility theorem (1951) and the Gibbard–Satterthwaite theorem, which show that no ranked voting rule can simultaneously satisfy all desirable fairness criteria. Delegates evaluating electoral reform proposals — from ranked-choice ballots to approval voting — often invoke Condorcet efficiency as one criterion among several.