Condorcet loser criterion

Last updated

In single-winner voting system theory, the Condorcet loser criterion (CLC) is a measure for differentiating voting systems. It implies the majority loser criterion but does not imply the Condorcet winner criterion.

Contents

A voting system complying with the Condorcet loser criterion will never allow a Condorcet loser to win. A Condorcet loser is a candidate who can be defeated in a head-to-head competition against each other candidate. [1] (Not all elections will have a Condorcet loser since it is possible for three or more candidates to be mutually defeatable in different head-to-head competitions.)

Compliance

Compliant methods include: two-round system, instant-runoff voting (AV), contingent vote, borda count, Schulze method, ranked pairs, and Kemeny-Young method. Any voting method that ends in a runoff passes the criterion, so long as all voters are able to express their preferences in that runoff i.e. STAR voting passes only when voters can always indicate their ranked preference in their scores; if there are more than 6 candidates, then this is impossible.

Noncompliant methods include: plurality voting, supplementary voting, Sri Lankan contingent voting, approval voting, range voting, Bucklin voting and minimax Condorcet.

The Smith criterion implies the Condorcet loser criterion, because no candidate in the Smith set can lose a head-to-head matchup against a candidate not in the Smith set.

Examples

Approval voting

The ballots for Approval voting do not contain the information to identify the Condorcet loser. Thus, Approval Voting cannot prevent the Condorcet loser from winning in some cases. The following example shows that Approval voting violates the Condorcet loser criterion.

Assume four candidates A, B, C and L with 3 voters with the following preferences:

# of votersPreferences
1A > B > L > C
1B > C > L > A
1C > A > L > B

The Condorcet loser is L, since every other candidate is preferred to him by 2 out of 3 voters.

There are several possibilities how the voters could translate their preference order into an approval ballot, i.e. where they set the threshold between approvals and disapprovals. For example, the first voter could approve (i) only A or (ii) A and B or (iii) A, B and L or (iv) all candidates or (v) none of them. Let's assume, that all voters approve three candidates and disapprove only the last one. The approval ballots would be:

# of votersApprovalsDisapprovals
1A, B, LC
1B, C, LA
1A, C, LB

Result: L is approved by all three voters, whereas the three other candidates are approved by only two voters. Thus, the Condorcet loser L is elected Approval winner.

Note, that if any voter would set the threshold between approvals and disapprovals at any other place, the Condorcet loser L would not be the (single) Approval winner. However, since Approval voting elects the Condorcet loser in the example, Approval voting fails the Condorcet loser criterion.

Majority Judgment

This example shows that Majority Judgment violates the Condorcet loser criterion. Assume three candidates A, B and L and 3 voters with the following opinions:

Candidates/
# of voters
ABL
1ExcellentBadGood
1BadExcellentGood
1FairPoorBad

The sorted ratings would be as follows:

Candidate   
 Median point
L
 
A
  
B
  
  
 
        Excellent    Good    Fair    Poor    Bad  

L has the median rating "Good", A has the median rating "Fair" and B has the median rating "Poor". Thus, L is the Majority Judgment winner.

Now, the Condorcet loser is determined. If all informations are removed that are not considered to determine the Condorcet loser, we have:

# of votersPreferences
1A > L > B
1B > L > A
1A > B > L

A is preferred over L by two voters and B is preferred over L by two voters. Thus, L is the Condorcet loser.

Result: L is the Condorcet loser. However, while the voter least preferring L also rates A and B relatively low, the other two voters rate L close to their favorites. Thus, L is elected Majority Judgment winner. Hence, Majority Judgment fails the Condorcet loser criterion.

Minimax

This example shows that the Minimax method violates the Condorcet loser criterion. Assume four candidates A, B, C and L with 9 voters with the following preferences:

# of votersPreferences
1A > B > C > L
1A > B > L > C
3B > C > A > L
1C > L > A > B
1L > A > B > C
2L > C > A > B

Since all preferences are strict rankings (no equals are present), all three Minimax methods (winning votes, margins and pairwise opposite) elect the same winners:

Pairwise election results
X
ABCL
YA[X] 3
[Y] 6
[X] 6
[Y] 3
[X] 4
[Y] 5
B[X] 6
[Y] 3
[X] 3
[Y] 6
[X] 4
[Y] 5
C[X] 3
[Y] 6
[X] 6
[Y] 3
[X] 4
[Y] 5
L[X] 5
[Y] 4
[X] 5
[Y] 4
[X] 5
[Y] 4
Pairwise election results (won-tied-lost):2-0-12-0-12-0-10-0-3
worst pairwise defeat (winning votes):6665
worst pairwise defeat (margins):3331
worst pairwise opposition:6665

Result: L loses against all other candidates and, thus, is Condorcet loser. However, the candidates A, B and C form a cycle with clear defeats. L benefits from that since it loses relatively closely against all three and therefore L's biggest defeat is the closest of all candidates. Thus, the Condorcet loser L is elected Minimax winner. Hence, the Minimax method fails the Condorcet loser criterion.

Plurality voting

Tennessee map for voting example.svg

Imagine that Tennessee is having an election on the location of its capital. The population of Tennessee is concentrated around its four major cities, which are spread throughout the state. For this example, suppose that the entire electorate lives in these four cities and that everyone wants to live as near to the capital as possible.

The candidates for the capital are:

The preferences of the voters would be divided like this:

42% of voters
(close to Memphis)
26% of voters
(close to Nashville)
15% of voters
(close to Chattanooga)
17% of voters
(close to Knoxville)
  1. Memphis
  2. Nashville
  3. Chattanooga
  4. Knoxville
  1. Nashville
  2. Chattanooga
  3. Knoxville
  4. Memphis
  1. Chattanooga
  2. Knoxville
  3. Nashville
  4. Memphis
  1. Knoxville
  2. Chattanooga
  3. Nashville
  4. Memphis

Here, Memphis has a plurality (42%) of the first preferences, so would be the winner under simple plurality voting. However, the majority (58%) of voters have Memphis as their fourth preference, and if two of the remaining three cities were not in the running to become the capital, Memphis would lose all of the contests 58–42. Hence, Memphis is the Condorcet loser.

Range voting

This example shows that Range voting violates the Condorcet loser criterion. Assume two candidates A and L and 3 voters with the following opinions:

Scores
# of votersAL
265
1010

The total scores would be:

Scores
candidateSumAverage
A124
L206.7

Hence, L is the Range voting winner.

Now, the Condorcet loser is determined. If all informations are removed that are not considered to determine the Condorcet loser, we have:

# of votersPreferences
2A > L
1L > A

Thus, L would be the Condorcet loser.

Result: L is preferred only by one of the three voters, so L is the Condorcet loser. However, while the two voters preferring A over L rate both candidates nearly equal and L's supporter rates him clearly over A, L is elected Range voting winner. Hence, Range voting fails the Condorcet loser criterion.

Alternatives

The Condorcet winner criterion is a stronger form of this criterion, since any method that passes the Condorcet winner criterion will also pass the Condorcet loser criterion.

A slightly weaker (easier to pass) version is the majority Condorcet loser criterion (MCLC), which requires that a candidate who can be defeated by a majority in a head-to-head competition against each other candidate, lose. It is possible for a system, such as Majority Judgment, which allows voters not to state a preference between two candidates, to pass the MCLC but not the CLC.[ citation needed ]

See also

Related Research Articles

Approval voting Single-winner electoral system

Approval voting is an electoral system in which voters can select many candidates instead of selecting only one candidate.

Condorcet method Pairwise-comparison electoral system

A Condorcet method is an election method that elects the candidate who wins a majority of the vote in every head-to-head election against each of the other candidates, that is, a candidate preferred by more voters than any others, whenever there is such a candidate. A candidate with this property, the pairwise champion or beats-all winner, is formally called the Condorcet winner. The head-to-head elections need not be done separately; a voter's choice within any given pair can be determined from the ranking.

Copeland's method is a ranked voting method based on a scoring system of pairwise "wins", "losses", and "ties". The method has a long history:

The independence of irrelevant alternatives (IIA), also known as binary independence or the independence axiom, is an axiom of decision theory and various social sciences. The term is used in different connotation in several contexts. Although it always attempts to provide an account of rational individual behavior or aggregation of individual preferences, the exact formulation differs widely in both language and exact content.

Bucklin voting is a class of voting methods that can be used for single-member and multi-member districts. As in highest median rules like the majority judgment, the Bucklin winner will be one of the candidates with the highest median ranking or rating. It is named after its original promoter, the Georgist politician James W. Bucklin of Grand Junction, Colorado, and is also known as the Grand Junction system.

Ranked pairs (RP) or the Tideman method is an electoral system developed in 1987 by Nicolaus Tideman that selects a single winner using votes that express preferences. RP can also be used to create a sorted list of winners.

An electoral system satisfies the Condorcet winner criterion if it always chooses the Condorcet winner when one exists. The candidate who wins a majority of the vote in every head-to-head election against each of the other candidates – that is, a candidate preferred by more voters than any others – is the Condorcet winner, although Condorcet winners do not exist in all cases. It is sometimes simply referred to as the "Condorcet criterion", though it is very different from the "Condorcet loser criterion". Any voting method conforming to the Condorcet winner criterion is known as a Condorcet method. The Condorcet winner is the person who would win a two-candidate election against each of the other candidates in a plurality vote. For a set of candidates, the Condorcet winner is always the same regardless of the voting system in question, and can be discovered by using pairwise counting on voters' ranked preferences.

The Smith criterion is a voting systems criterion defined such that it's satisfied when a voting system always elects a candidate that is in the Smith set, which is the smallest non-empty subset of the candidates such that every candidate in the subset is majority-preferred over every candidate not in the subset. The Smith set is named for mathematician John H Smith, whose version of the Condorcet criterion is actually stronger than that defined above for social welfare functions. Benjamin Ward was probably the first to write about this set, which he called the "majority set".

The participation criterion is a voting system criterion. Voting systems that fail the participation criterion are said to exhibit the no show paradox and allow a particularly unusual strategy of tactical voting: abstaining from an election can help a voter's preferred choice win. The criterion has been defined as follows:

The majority criterion is a single-winner voting system criterion, used to compare such systems. The criterion states that "if one candidate is ranked first by a majority of voters, then that candidate must win".

A voting system is consistent if, whenever the electorate is divided (arbitrarily) into several parts and elections in those parts garner the same result, then an election of the entire electorate also garners that result. Smith calls this property separability and Woodall calls it convexity.

The mutual majority criterion is a criterion used to compare voting systems. It is also known as the majority criterion for solid coalitions and the generalized majority criterion. The criterion states that if there is a subset S of the candidates, such that more than half of the voters strictly prefer every member of S to every candidate outside of S, this majority voting sincerely, the winner must come from S. This is similar to but stricter than the majority criterion, where the requirement applies only to the case that S contains a single candidate. This is also stricter than the majority loser criterion, where the requirement applies only to the case that S contains all but one candidate. The mutual majority criterion is the single-winner case of the Droop proportionality criterion.

In voting systems, the Minimax Condorcet method is one of several Condorcet methods used for tabulating votes and determining a winner when using ranked voting in a single-winner election. It is sometimes referred to as the Simpson–Kramer method, and the successive reversal method.

Reversal symmetry is a voting system criterion which requires that if candidate A is the unique winner, and each voter's individual preferences are inverted, then A must not be elected. Methods that satisfy reversal symmetry include Borda count, ranked pairs, Kemeny-Young method, and Schulze method. Methods that fail include Bucklin voting, instant-runoff voting and Condorcet methods that fail the Condorcet loser criterion such as Minimax.

The later-no-harm criterion is a voting system criterion formulated by Douglas Woodall. Woodall defined the criterion as "[a]dding a later preference to a ballot should not harm any candidate already listed." For example, a ranked voting method in which a voter adding a 3rd preference could reduce the likelihood their 1st preference being selected, fails later-no-harm.

In voting systems theory, the independence of clones criterion measures an election method's robustness to strategic nomination. Nicolaus Tideman was the first to formulate this criterion, which states that the winner must not change due to the addition of a non-winning candidate who is similar to a candidate already present. To be more precise, a subset of the candidates, called a set of clones, exists if no voter ranks any candidate outside the set between any candidates that are in the set. If a set of clones contains at least two candidates, the criterion requires that deleting one of the clones must not increase or decrease the winning chance of any candidate not in the set of clones.

Ranked voting Election voting system

The term ranked voting refers to any voting system in which voters rank their candidates in a sequence of first or second on their respective ballots. The purpose of the ranking is to allow the voter to determine how the vote is to be transferred if the first preference is found to be un-electable or if is elected with surplus votes.

The later-no-help criterion is a voting system criterion formulated by Douglas Woodall. The criterion is satisfied if, in any election, a voter giving an additional ranking or positive rating to a less-preferred candidate can not cause a more-preferred candidate to win. Voting systems that fail the later-no-help criterion are vulnerable to the tactical voting strategy called mischief voting, which can deny victory to a sincere Condorcet winner.

Electoral systems are the rules for conducting elections, a main component of which is the algorithm for determining the winner from the ballots cast. This article discusses methods and results of comparing different electoral systems, both those which elect a unique candidate in a 'single-winner' election and those which elect a group of representatives in a multiwinner election.

STAR voting Single-winner electoral system

STAR voting is an electoral system for single-seat elections. Variations also exist for multi-winner and proportional representation elections. The name stands for "Score then Automatic Runoff", referring to the fact that this system is a combination of score voting, to pick two finalists with the highest total scores, followed by a "virtual runoff" in which the finalist who is preferred on more ballots wins. It is a type of cardinal voting electoral system.

References

  1. https://arxiv.org/pdf/1801.05911 "We say that an alternative is a Condorcet loser if it would be defeated by every other alternative in a kind of one-on-one contest that takes place in a sequential pairwise voting with a fixed agenda4.– Condorcet loser criterion (CLC), [...] we say that a social choice procedure satisfies the Condorcet loser criterion (CLC) provided that a Condorcet loser is never among the social choices."