Ranked voting

For the voting rule often called ranked-choice voting in the United States, see Instant-runoff voting.

Ranked voting is any voting system that uses voters' rankings of candidates to choose a single winner or multiple winners. More formally, a ranked system is one that depends only on which of two candidates is preferred by a voter, and as such does not incorporate any information about intensity of preferences. Ranked voting systems vary dramatically in how preferences are tabulated and counted, which gives them very different properties. In instant-runoff voting (IRV) and the single transferable vote system (STV), lower preferences are used as contingencies (back-up preferences) and are only applied when all higher-ranked preferences on a ballot have been eliminated.

Ovals

Names

Numbers

Various types of ranked voting ballot

Some ranked vote systems use ranks as weights; this type of system is called positional voting. In the Borda method, the 1st, 2nd, 3rd... candidates on each ballot receive 1, 2, 3... points, and the candidate with the fewest points is elected. Thus intensity of preference is assumed to be at ratios of 1 to 2, 2 to 3, etc. Although not typically described as such, the well-known plurality rule can be seen as a ranked voting system where a voter gives a single point to the candidate marked as their choice and zero points to all others, and the candidate with the most points is elected. Taking the ranked ballots of instant-runoff voting and the single transferable vote system as indicating one choice at a time (that is, giving one point to the preference in use and zero points to all others), instant-runoff voting and the single transferable vote system can be seen as the most common non-degenerate ranked voting systems. They operate as staged variants of the plurality system that repeatedly eliminate last-place plurality winners if necessary to determine a majority or quota winner.

In the United States and Australia, the terms ranked-choice voting and preferential voting, respectively, almost always refer to instant-runoff voting; however, because these terms have also been used to mean ranked systems in general, many social choice theorists recommend the use of instant-runoff voting in contexts where it could cause confusion. Ranked voting systems, such as Borda count, are usually contrasted with rated voting methods, which allow voters to indicate how strongly they support different candidates (e.g. on a scale from 0 to 10). Ranked vote systems produce more information than X voting systems such as first-past-the-post voting. Rated voting systems produce more information than ordinal ballots; as a result, they are not subject to many of the problems with weighted rank voting (including results like Arrow's theorem).

History of ranked voting

Main articles: Electoral system and Social choice theory

The earliest known proposals for a ranked voting system other than plurality can be traced to the works of Ramon Llull in the late 13th century, who developed what would later be known as Copeland's method. Copeland's method was devised by Ramon Llull in his 1299 treatise Ars Electionis, which was discussed by Nicholas of Cusa in the fifteenth century.

A second wave of analysis began when Jean-Charles de Borda published a paper in 1781, advocating for the Borda count, which he called the "order of merit". This methodology drew criticism from the Marquis de Condorcet, who developed his own methods after arguing Borda's approach did not accurately reflect group preferences, because it was vulnerable to spoiler effects and did not always elect the majority-preferred candidate.

Interest in ranked voting continued throughout the 19th century. Danish pioneer Carl Andræ formulated the single transferable vote system, which was adopted by his native Denmark in 1855. This used the contingent ranked vote system. Condorcet had previously considered the single-winner version of it, the instant-runoff system, but immediately rejected it as pathological. The contingent ranked transferable vote later found common use in cities in North America, Ireland and other parts of the English-speaking world.

Theoretical exploration of electoral processes was revived by a 1948 paper from Duncan Black and Kenneth Arrow's investigations into social choice theory, a branch of welfare economics that extends rational choice to include community decision-making processes.

Adoption

Plurality voting is the most common ranked voting system, and has been in widespread use since the earliest democracies. As plurality voting has exhibited weaknesses from its start, especially as soon as a third party joins the race, some individuals turned to transferable votes (facilitated by contingent ranked ballots) to reduce the incidence of wasted votes and unrepresentative election results. A form of the single transferable vote system was invented by Carl Andræ in Denmark, where it was used briefly before being abandoned for direct elections in favor of the simpler open list rules. The single transferable vote system was still used in indirect elections in the Danish government until 1953.

At approximately the same time, the single transferable vote system was independently devised by British lawyer Thomas Hare, whose writings soon spread the method throughout the British Empire. Tasmania adopted the Hare method in government elections the 1890s, with broader adoption throughout Australia beginning in the 1910s and 1920s. The single transferable vote system, using contingent ranked votes, has been adopted in Ireland, South Africa, Malta, and approximately 20 cities each in the United States and Canada.[1] The single transferable vote system has also been used to elect legislators in Canada, South Africa and India.

In more recent years, the use of contingent ranked votes has seen a comeback in the United States. In the United States, single-winner ranked voting (specifically, instant-runoff voting) is used to elect politicians in Maine and Alaska. In November 2016, the voters of Maine narrowly passed Question 5, approving ranked-choice voting (instant-runoff voting) for all elections. This was first put to use in 2018, marking the inaugural use of ranked votes in a statewide election in the United States. In November 2020, Alaska voters passed Measure 2, bringing ranked choice voting (instant-runoff voting) into effect from 2022. However, as before, the system has faced strong opposition. After a series of electoral pathologies in Alaska's 2022 congressional special election, a poll found 54% of Alaskans supported a repeal of the system; this included a third of the voters who had supported Peltola, the ultimate winner in the election.

Some local elections in New Zealand and in the U.S. use the multi-winner single transferable vote. Nauru uses a rank-weighted positional method called the Dowdall system.

Equal-ranked ballots

In voting with ranked ballots, a tied or equal-rank ballot is one where multiple candidates receive the same rank or rating. In instant runoff and first-preference plurality, such ballots are generally rejected; however, in social choice theory some election systems assume equal-ranked ballots are "split" evenly between all equal-ranked candidates (e.g. in a two-way tie, each candidate receives half a vote). Meanwhile, other election systems, the Borda count and the Condorcet method, can use different rules for handling equal-rank ballots. These rules produce different mathematical properties and behaviors, particularly under strategic voting.

Theoretical foundations of ranked voting

Majority-rule

Main articles: Condorcet efficiency and Condorcet winner criterion

Many concepts formulated by the Marquis de Condorcet in the 18th century continue to significantly impact the field. One of these concepts is the Condorcet winner, a candidate who would win against any other candidate in a two-way race. A voting system that always elects this candidate is called a Condorcet method; however, it is possible for an election to have no Condorcet winner, a situation called a Condorcet cycle. Suppose an election with 3 candidates A, B, and C has 3 voters. One votes A > C > B, one votes B > A > C, and one votes C > B > A. In this case, no Condorcet winner exists: A cannot be a Condorcet winner as two-thirds of voters prefer B over A. Similarly, B cannot be the winner as two-thirds prefer C over B, and C cannot win as two-thirds prefer A over C. This forms a rock-paper-scissors style cycle with no Condorcet winner.

Social well-being

Main articles: Social utility efficiency and Implicit utilitarian voting

Voting systems can also be judged on their ability to deliver results that maximize the overall well-being of society, i.e. to choose the best candidate for society as a whole.

Spatial voting models

Main article: Median voter theorem

Spatial voting models, initially proposed by Duncan Black and further developed by Anthony Downs, provide a theoretical framework for understanding electoral behavior. In these models, each voter and candidate is positioned within an ideological space that can span multiple dimensions. It is assumed that voters tend to favor candidates who closely align with their ideological position over those more distant. A political spectrum is an example of a one-dimensional spatial model.

A spatial model of voting

The accompanying diagram presents a simple one-dimensional spatial model, illustrating the voting methods discussed in subsequent sections of this article. It is assumed that supporters of candidate A cast their votes in the order of A > B > C, while candidate C's supporters vote in the sequence of C > B > A. Supporters of candidate B are equally divided between listing A or C as their second preference. From the data in the accompanying table, if there are 100 voters, the distribution of ballots will reflect the positioning of voters and candidates along the ideological spectrum.

Spatial models offer significant insights because they provide an intuitive visualization of voter preferences. These models give rise to an influential theorem—the median voter theorem—attributed to Duncan Black. This theorem stipulates that within a broad range of spatial models, including all one-dimensional models and all symmetric models across multiple dimensions, a Condorcet winner is guaranteed to exist. Moreover, this winner is the candidate closest to the median of the voter distribution. Empirical research has generally found that spatial voting models give a highly accurate explanation of most voting behavior.

Other theorems

Main articles: Arrow's impossibility theorem and Gibbard's theorem

Arrow's impossibility theorem is a generalization of Condorcet's result on the impossibility of majority rule. It demonstrates that every ranked voting algorithm is susceptible to the spoiler effect. Gibbard's theorem provides a closely-related corollary, that no voting rule can have a single, always-best strategy that does not depend on other voters' ballots.

Examples

Borda count

Main articles: Borda count and Positional voting

The Borda count is a weighted-rank system that assigns scores to each candidate based on their position in each ballot. If m is the total number of candidates, the candidate ranked first on a ballot receives m − 1 points, the second receives m − 2, and so on, until the last-ranked candidate who receives zero. In the given example, candidate B emerges as the winner with 130 out of a total 300 points. While the Borda count is simple to administer, it does not meet the Condorcet criterion. Also, it is heavily affected by the entry of candidates who have no real chance of winning.

Other positional systems

Systems that award points in a similar way but possibly with a different formula are called positional systems. The score vector (m − 1, m − 2, ..., 0) is associated with the Borda count, (1, 1/2, 1/3, ..., 1/m) defines the Dowdall system and (1, 0, ..., 0) equates to first-past-the-post.

Instant-runoff voting

Main article: Instant-runoff voting

Instant-runoff voting, often conflated with ranked-choice voting in general, is a contingent ranked-vote voting method that recursively eliminates the plurality loser of an election until one candidate has the majority of the remaining votes. In the given example, Candidate A is declared winner in the third round, having received a majority of votes through the accumulation of first-choice votes and redistributed votes from Candidate B. This system embodies the voters' preferences between the final candidates, stopping when a candidate garners the preference of a majority of voters. Instant-runoff voting does not fulfill the Condorcet winner criterion.

Defeat-dropping Condorcet

Main article: Round-robin voting

The defeat-dropping Condorcet methods all look for a Condorcet winner, i.e. a candidate who is not defeated by any other candidate in a one-on-one majority vote. If there is no Condorcet winner, they repeatedly drop (set the margin to zero) for the one-on-one matchups that are closest to being tied, until there is a Condorcet winner. How "closest to being tied" is defined depends on the specific rule. For minimax, the elections with the smallest margin of victory are dropped, whereas in ranked pairs only elections that create a cycle are eligible to be dropped (with defeats being dropped based on the margin of victory).

See also

• Approval voting
• Comparison of electoral systems
• Group voting ticket
• History and use of instant-runoff voting
• Implicit utilitarian voting
• List of electoral systems by country
• Matrix vote
• Preferential block voting
• Spoiler effect
• Voting methods in deliberative assemblies

External links

• Explainer video: How does ranked-choice voting work?, Minnesota Public Radio MPR.org
• Ballotpedia: "Ranked Choice Voting"
• Examples from RCV123.org
  • US State of Maine, 2020 Ballot
  • US State of Alaska, 2021 Ballot
• FairVote.Org