Ranked pairs (original) (raw)
From Wikipedia, the free encyclopedia
(Redirected from Ranked Pairs)
Single-winner electoral system
Ranked Pairs (RP), also known as the Tideman method, is a ranked voting method that determines a single winner from ballots that rank candidates in order of preference. The method is like a round-robin tournament in that it examines every possible pairing of one candidate against another.
The ballots are used to determine the winner in any race with just two candidates, based upon which of the two candidates is ranked higher on each ballot. If there is a candidate who wins regardless of whom they are paired against then that candidate is elected the winner. If there is no candidate who wins every pairing then the pairings with a more decisive win dominate those that are less decisive. For example, if Paper beats Rock, Rock beats Scissors, and Scissors beats Paper; and it is the case that the first two wins are more decisive than the third, then the third is ignored and Paper is elected the winner by virtue of winning their remaining pairings.
This system of ranked voting was first proposed by Nicolaus Tideman in 1987.[1][2]Unlike Instant Runoff Voting, Ranked Pairs is guaranteed to satisfy the Condorcet winner criterion, meaning that any candidate who beats every other candidate, in a one-on-one race between the two, will be elected the winner.[3]
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 pairing.
- Sort the pairs by the absolute margin of victory, going from largest to smallest.
- Going down the list, check whether adding each pairing 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).[note 1]
At the end of this procedure, all cycles will be eliminated, leaving a unique winner who wins all of their remaining one-on-one pairings. The lack of cycles means that candidates can be ranked directly based on the pairings that have been left behind.
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 votersFar-West | 26% of votersCenter | 15% of votersCenter-East | 17% of votersFar-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% |
- [A] indicates voters who preferred the candidate listed in the column caption to the candidate listed in the row caption
- [B] indicates voters who preferred the candidate listed in the row caption to the candidate listed in the column caption
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% |
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.
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.
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
[edit]
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.
The following table compares ranked pairs with other single-winner election methods:
^ 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.
^ 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.
- 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