Ranked pairs - Misplaced Pages

Single-winner electoral system

Social choice and electoral systems
A joint Politics and Economics series

Social choice Mechanism design Comparative politics Comparison List (By country)
Single-winner methodsSingle vote - plurality methods First preference plurality (FPP) Two-round (US: Jungle primary) Partisan primary Instant-runoff UK: Alternative vote (AV) US: Ranked-choice (RCV) Condorcet methods Condorcet-IRV Round-robin voting Minimax Schulze Ranked pairs Maximal lottery Positional voting Plurality (el. IRV) Borda count (el. Baldwin) Antiplurality (el. Coombs) Cardinal voting Score voting Approval voting Majority judgment STAR voting
Proportional representationParty-list Apportionment Highest averages Largest remainders National remnant Biproportional List type Closed list Open list Panachage List-free PR Localized list Quota-remainder methods Hare STV Schulze STV CPO-STV Quota Borda Approval-based committees Thiele's method Phragmen's method Expanding approvals rule Method of equal shares Fractional social choice Direct representation Interactive representation Liquid democracy Fractional approval voting Maximal lottery Random ballot Semi-proportional representation Cumulative SNTV Limited voting
Mixed systemsBy results of combination Mixed-member majoritarian Mixed-member proportional By mechanism of combination Non-compensatory Parallel (superposition) Coexistence Conditional Fusion (majority bonus) Compensatory Seat linkage system UK: 'AMS' NZ: 'MMP' Vote linkage system Negative vote transfer Mixed ballot Supermixed systems Dual-member proportional Rural–urban proportional Majority jackpot By ballot type Single vote Double simultaneous vote Dual-vote
Paradoxes and pathologiesSpoiler effects Spoiler effect Cloning paradox Frustrated majorities paradox Center squeeze Pathological response Perverse response Best-is-worst paradox No-show paradox Multiple districts paradox Strategic voting Lesser evil voting Exaggeration Truncation Turkey-raising Paradoxes of majority rule Tyranny of the majority Discursive dilemma Conflicting majorities paradox
Social and collective choiceImpossibility theorems Arrow's theorem Majority impossibility Moulin's impossibility theorem McKelvey–Schofield chaos theorem Gibbard's theorem Positive results Median voter theorem Condorcet's jury theorem May's theorem Condorcet dominance theorems Harsanyi's utilitarian theorem
Politics portal Economics portal Mathematics portal
v t e

Ranked Pairs (RP), also known as the Tideman method, is a tournament-style system of ranked voting first proposed by Nicolaus Tideman in 1987.

If there is a candidate who is preferred over the other candidates, when compared in turn with each of the others, the ranked-pairs procedure guarantees that candidate will win. Therefore, the ranked-pairs procedure complies with the Condorcet winner criterion (and as a result is considered to be a Condorcet method).

Ranked pairs begins with a round-robin tournament, where the one-on-one margins of victory for each possible pair of candidates are compared to find a majority-preferred candidate; if such a candidate exists, they are immediately elected. Otherwise, if there is a Condorcet cycle—a rock-paper-scissors-like sequence A > B > C > A—the cycle is broken by dropping the "weakest" elections in the cycle, i.e. the ones that are closest to being tied.

Procedure

The ranked pairs procedure is as follows:

Consider each pair of candidates round-robin style, and calculate the pairwise margin of victory for each in a one-on-one matchup.
Sort the pairs by the (absolute) margin of victory, going from largest to smallest.
Going down the list, check whether adding each matchup would create a cycle. If it would, cross out the election; this will be the election(s) in the cycle with the smallest margin of victory (near-ties).

At the end of this procedure, all cycles will be eliminated, leaving a unique winner who wins all of the remaining one-on-one matchups. The lack of cycles means that candidates can be ranked directly based on the matchups that have been left behind.

Example

The situation

Suppose that Tennessee is holding an election on the location of its capital. The population is concentrated around four major cities. All voters want the capital to be as close to them as possible. The options are:

Memphis, the largest city, but far from the others (42% of voters)
Nashville, near the center of the state (26% of voters)
Chattanooga, somewhat east (15% of voters)
Knoxville, far to the northeast (17% of voters)

The preferences of each region's voters are:

42% of voters Far-West	26% of voters Center	15% of voters Center-East	17% of voters Far-East
Memphis Nashville Chattanooga Knoxville	Nashville Chattanooga Knoxville Memphis	Chattanooga Knoxville Nashville Memphis	Knoxville Chattanooga Nashville Memphis

The results are tabulated as follows:

Pairwise election results
AB	Memphis	Nashville	Chattanooga	Knoxville
Memphis		58% 42%	58% 42%	58% 42%
Nashville	42% 58%		32% 68%	32% 68%
Chattanooga	42% 58%	68% 32%		17% 83%
Knoxville	42% 58%	68% 32%	83% 17%

indicates voters who preferred the candidate listed in the column caption to the candidate listed in the row caption
indicates voters who preferred the candidate listed in the row caption to the candidate listed in the column caption

Tally

First, list every pair, and determine the winner:

Pair	Winner
Memphis (42%) vs. Nashville (58%)	Nashville 58%
Memphis (42%) vs. Chattanooga (58%)	Chattanooga 58%
Memphis (42%) vs. Knoxville (58%)	Knoxville 58%
Nashville (68%) vs. Chattanooga (32%)	Nashville 68%
Nashville (68%) vs. Knoxville (32%)	Nashville 68%
Chattanooga (83%) vs. Knoxville (17%)	Chattanooga 83%

The votes are then sorted. The largest majority is "Chattanooga over Knoxville"; 83% of the voters prefer Chattanooga. Thus, the pairs from above would be sorted this way:

Pair	Winner
Chattanooga (83%) vs. Knoxville (17%)	Chattanooga 83%
Nashville (68%) vs. Knoxville (32%)	Nashville 68%
Nashville (68%) vs. Chattanooga (32%)	Nashville 68%
Memphis (42%) vs. Nashville (58%)	Nashville 58%
Memphis (42%) vs. Chattanooga (58%)	Chattanooga 58%
Memphis (42%) vs. Knoxville (58%)	Knoxville 58%

Lock

The pairs are then locked in order, skipping any pairs that would create a cycle:

Lock Chattanooga over Knoxville.
Lock Nashville over Knoxville.
Lock Nashville over Chattanooga.
Lock Nashville over Memphis.
Lock Chattanooga over Memphis.
Lock Knoxville over Memphis.

In this case, no cycles are created by any of the pairs, so every single one is locked in.

Every "lock in" would add another arrow to the graph showing the relationship between the candidates. Here is the final graph (where arrows point away from the winner).

In this example, Nashville is the winner using the ranked-pairs procedure. Nashville is followed by Chattanooga, Knoxville, and Memphis in second, third, and fourth places respectively.

Summary

In the example election, the winner is Nashville. This would be true for any Condorcet method.

Under first-past-the-post and some other systems, Memphis would have won the election by having the most people, even though Nashville won every simulated pairwise election outright. Using instant-runoff voting in this example would result in Knoxville winning even though more people preferred Nashville over Knoxville.

Criteria

Of the formal voting criteria, the ranked pairs method passes the majority criterion, the monotonicity criterion, the Smith criterion (which implies the Condorcet criterion), the Condorcet loser criterion, and the independence of clones criterion. Ranked pairs fails the consistency criterion and the participation criterion. While ranked pairs is not fully independent of irrelevant alternatives, it still satisfies local independence of irrelevant alternatives and independence of Smith-dominated alternatives, meaning it is likely to roughly satisfy IIA "in practice."

Independence of irrelevant alternatives

Ranked pairs fails independence of irrelevant alternatives, like all other ranked voting systems. However, the method adheres to a less strict property, sometimes called independence of Smith-dominated alternatives (ISDA). It says that if one candidate (X) wins an election, and a new alternative (Y) is added, X will win the election if Y is not in the Smith set. ISDA implies the Condorcet criterion.

Comparison table

The following table compares ranked pairs with other single-winner election methods:

Comparison of single-winner voting systems
Criterion Method	Majority winner	Majority loser	Mutual majority	Condorcet winner	Condorcet loser	Smith	Smith-IIA	IIA/LIIA	Cloneproof	Monotone	Participation	Later-no-harm	Later-no-help	No favorite betrayal	Ballot type
First-past-the-post voting	Yes	No	No	No	No	No	No	No	No	Yes	Yes	Yes	Yes	No	Single mark
Anti-plurality	No	Yes	No	No	No	No	No	No	No	Yes	Yes	No	No	Yes	Single mark
Two round system	Yes	Yes	No	No	Yes	No	No	No	No	No	No	Yes	Yes	No	Single mark
Instant-runoff	Yes	Yes	Yes	No	Yes	No	No	No	Yes	No	No	Yes	Yes	No	Ranking
Coombs	Yes	Yes	Yes	No	Yes	No	No	No	No	No	No	No	No	Yes	Ranking
Nanson	Yes	Yes	Yes	Yes	Yes	Yes	No	No	No	No	No	No	No	No	Ranking
Baldwin	Yes	Yes	Yes	Yes	Yes	Yes	No	No	No	No	No	No	No	No	Ranking
Tideman alternative	Yes	Yes	Yes	Yes	Yes	Yes	Yes	No	Yes	No	No	No	No	No	Ranking
Minimax	Yes	No	No	Yes	No	No	No	No	No	Yes	No	No	No	No	Ranking
Copeland	Yes	Yes	Yes	Yes	Yes	Yes	Yes	No	No	Yes	No	No	No	No	Ranking
Black	Yes	Yes	No	Yes	Yes	No	No	No	No	Yes	No	No	No	No	Ranking
Kemeny–Young	Yes	Yes	Yes	Yes	Yes	Yes	Yes	LIIA Only	No	Yes	No	No	No	No	Ranking
Ranked pairs	Yes	Yes	Yes	Yes	Yes	Yes	Yes	LIIA Only	Yes	Yes	No	No	No	No	Ranking
Schulze	Yes	Yes	Yes	Yes	Yes	Yes	Yes	No	Yes	Yes	No	No	No	No	Ranking
Borda	No	Yes	No	No	Yes	No	No	No	No	Yes	Yes	No	Yes	No	Ranking
Bucklin	Yes	Yes	Yes	No	No	No	No	No	No	Yes	No	No	Yes	No	Ranking
Approval	Yes	No	No	No	No	No	No	Yes	Yes	Yes	Yes	No	Yes	Yes	Approvals
Majority Judgement	No	No	No	No	No	No	No	Yes	Yes	Yes	No	No	Yes	Yes	Scores
Score	No	No	No	No	No	No	No	Yes	Yes	Yes	Yes	No	Yes	Yes	Scores
STAR	No	Yes	No	No	Yes	No	No	No	No	Yes	No	No	No	No	Scores
Random ballot	No	No	No	No	No	No	No	Yes	Yes	Yes	Yes	Yes	Yes	Yes	Single mark
Sortition	No	No	No	No	No	No	No	Yes	No	Yes	Yes	Yes	Yes	Yes	None
Table Notes	^ Condorcet's criterion is incompatible with the consistency, participation, later-no-harm, later-no-help, and sincere favorite criteria. ^ A variant of Minimax that counts only pairwise opposition, not opposition minus support, fails the Condorcet criterion and meets later-no-harm. ^ In Highest median, Ranked Pairs, and Schulze voting, there is always a regret-free, semi-honest ballot for any voter, holding all other ballots constant and assuming they know enough about how others will vote. Under such circumstances, there is always at least one way for a voter to participate without grading any less-preferred candidate above any more-preferred one. ^ Approval voting, score voting, and majority judgment satisfy IIA if it is assumed that voters rate candidates independently using their own absolute scale. For this to hold, in some elections, some voters must use less than their full voting power despite having meaningful preferences among viable candidates. Majority Judgment may elect a candidate uniquely least-preferred by over half of voters, but it never elects the candidate uniquely bottom-rated by over half of voters. Majority Judgment fails the mutual majority criterion, but satisfies the criterion if the majority ranks the mutually favored set above a given absolute grade and all others below that grade. A randomly chosen ballot determines winner. This and closely related methods are of mathematical interest and included here to demonstrate that even unreasonable methods can pass voting method criteria. Where a winner is randomly chosen from the candidates, sortition is included to demonstrate that even non-voting methods can pass some criteria.

Notes

Rather than crossing out near-ties, step 3 is sometimes described as going down the list and confirming ("locking in") the largest victories that do not create a cycle, then ignoring any victories that are not locked-in.

References

Tideman, T. N. (1987-09-01). "Independence of clones as a criterion for voting rules". Social Choice and Welfare. 4 (3): 185–206. doi:10.1007/BF00433944. ISSN 1432-217X. S2CID 122758840.
Schulze, Markus (October 2003). "A New Monotonic and Clone-Independent Single-Winner Election Method". Voting matters (www.votingmatters.org.uk). 17. McDougall Trust. Archived from the original on 2020-07-11. Retrieved 2021-02-02.
Munger, Charles T. (2022). "The best Condorcet-compatible election method: Ranked Pairs". Constitutional Political Economy. doi:10.1007/s10602-022-09382-w.
Munger, Charles T. (2022). "The best Condorcet-compatible election method: Ranked Pairs". Constitutional Political Economy. 34 (3): 434–444. doi:10.1007/s10602-022-09382-w.

External links

Descriptions of ranked-ballot voting methods by Rob LeGrand
Example JS implementation by Asaf Haddad
Pair Ranking Ruby Gem by Bala Paranj
A margin-based PHP Implementation of Tideman's Ranked Pairs
Rust implementation of Ranked Pairs by Cory Dickson

Electoral systems

Part of the politics and Economics series

Single-winner

Proportional

Systems	Mixed-member Mixed single vote Party-list Proportional approval voting Rural–urban Sequential proportional approval voting Single transferable vote CPO-STV Hare-Clark Schulze STV Spare vote Indirect single transferable voting
Allocation	Highest averages method Webster/Sainte-Laguë D'Hondt Largest remainders method
Quotas	Droop quota Hagenbach-Bischoff quota Hare quota Imperiali quota

Mixed

Semi-proportional

Criteria

Other

Comparison

Portal — Project

Categories: