Reinforcement criterion

Last updated

A voting system satisfies join-consistency (also called the reinforcement criterion) if combining two sets of votes, both electing A over B, always results in a combined electorate that ranks A over B. It is a stronger form of the participation criterion, which only requires join-consistency when one of the sets of votes unanimously prefers A over B.

Contents

A voting system is join-consistent if and only if it is a point-summing method; in other words, it must be positional voting, score voting, or approval voting. [1]

As shown below under Kemeny-Young, whether a system passes reinforcement can depend on whether the election selects a single winner or a full ranking of the candidates (sometimes referred to as ranking consistency): in some methods, two electorates with the same winner but different rankings may, when added together, lead to a different winner. Kemeny-Young is the only ranking-consistent Condorcet method, and no Condorcet method can be winner-consistent (or satisfy the weaker participation criterion in case of a four-way tie). [2]

Examples

Copeland

This example shows that Copeland's method violates the consistency criterion. Assume five candidates A, B, C, D and E with 27 voters with the following preferences:

PreferencesVoters
A > D > B > E > C3
A > D > E > C > B2
B > A > C > D > E3
C > D > B > E > A3
E > C > B > A > D3
A > D > C > E > B3
A > D > E > B > C1
B > D > C > E > A3
C > A > B > D > E3
E > B > C > A > D3

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

First group of voters

In the following the Copeland winner for the first group of voters is determined.

PreferencesVoters
A > D > B > E > C3
A > D > E > C > B2
B > A > C > D > E3
C > D > B > E > A3
E > C > B > A > D3

The results would be tabulated as follows:

Pairwise preferences
X
ABCDE
YA[X] 9
[Y] 5
[X] 6
[Y] 8
[X] 3
[Y] 11
[X] 6
[Y] 8
B[X] 5
[Y] 9
[X] 8
[Y] 6
[X] 8
[Y] 6
[X] 5
[Y] 9
C[X] 8
[Y] 6
[X] 6
[Y] 8
[X] 5
[Y] 9
[X] 8
[Y] 6
D[X] 11
[Y] 3
[X] 6
[Y] 8
[X] 9
[Y] 5
[X] 3
[Y] 11
E[X] 8
[Y] 6
[X] 9
[Y] 5
[X] 6
[Y] 8
[X] 11
[Y] 3
Pairwise election results (won-tied-lost):3-0-12-0-22-0-22-0-21-0-3
  • [X] indicates voters who preferred the candidate listed in the column caption to the candidate listed in the row caption
  • [Y] indicates voters who preferred the candidate listed in the row caption to the candidate listed in the column caption

Result: With the votes of the first group of voters, A can defeat three of the four opponents, whereas no other candidate wins against more than two opponents. Thus, A is elected Copeland winner by the first group of voters.

Second group of voters

Now, the Copeland winner for the second group of voters is determined.

PreferencesVoters
A > D > C > E > B3
A > D > E > B > C1
B > D > C > E > A3
C > A > B > D > E3
E > B > C > A > D3

The results would be tabulated as follows:

Pairwise election results
X
ABCDE
YA[X] 6
[Y] 7
[X] 9
[Y] 4
[X] 3
[Y] 10
[X] 6
[Y] 7
B[X] 7
[Y] 6
[X] 6
[Y] 7
[X] 4
[Y] 9
[X] 7
[Y] 6
C[X] 4
[Y] 9
[X] 7
[Y] 6
[X] 7
[Y] 6
[X] 4
[Y] 9
D[X] 10
[Y] 3
[X] 9
[Y] 4
[X] 6
[Y] 7
[X] 3
[Y] 10
E[X] 7
[Y] 6
[X] 6
[Y] 7
[X] 9
[Y] 4
[X] 10
[Y] 3
Pairwise election results (won-tied-lost):3-0-12-0-22-0-22-0-21-0-3

Result: Taking only the votes of the second group in account, again, A can defeat three of the four opponents, whereas no other candidate wins against more than two opponents. Thus, A is elected Copeland winner by the second group of voters.

All voters

Finally, the Copeland winner of the complete set of voters is determined.

PreferencesVoters
A > D > B > E > C3
A > D > C > E > B3
A > D > E > B > C1
A > D > E > C > B2
B > A > C > D > E3
B > D > C > E > A3
C > A > B > D > E3
C > D > B > E > A3
E > B > C > A > D3
E > C > B > A > D3

The results would be tabulated as follows:

Pairwise election results
X
ABCDE
YA[X] 15
[Y] 12
[X] 15
[Y] 12
[X] 6
[Y] 21
[X] 12
[Y] 15
B[X] 12
[Y] 15
[X] 14
[Y] 13
[X] 12
[Y] 15
[X] 12
[Y] 15
C[X] 12
[Y] 15
[X] 13
[Y] 14
[X] 12
[Y] 15
[X] 12
[Y] 15
D[X] 21
[Y] 6
[X] 15
[Y] 12
[X] 15
[Y] 12
[X] 6
[Y] 21
E[X] 15
[Y] 12
[X] 15
[Y] 12
[X] 15
[Y] 12
[X] 21
[Y] 6
Pairwise election results (won-tied-lost):2-0-23-0-14-0-01-0-30-0-4

Result: C is the Condorcet winner, thus Copeland chooses C as winner.

Conclusion

A is the Copeland winner within the first group of voters and also within the second group of voters. However, both groups combined elect C as the Copeland winner. Thus, Copeland fails the consistency criterion.

Instant-runoff voting

This example shows that Instant-runoff voting violates the consistency criterion. Assume three candidates A, B and C and 23 voters with the following preferences:

PreferencesVoters
A > B > C4
B > A > C2
C > B > A4
A > B > C4
B > A > C6
C > A > B3

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

First group of voters

In the following the instant-runoff winner for the first group of voters is determined.

PreferencesVoters
A > B > C4
B > A > C2
C > B > A4

B has only 2 votes and is eliminated first. Its votes are transferred to A. Now, A has 6 votes and wins against C with 4 votes.

CandidateVotes in round
1st2nd
A46
B2
C44

Result: A wins against C, after B has been eliminated.

Second group of voters

Now, the instant-runoff winner for the second group of voters is determined.

PreferencesVoters
A > B > C4
B > A > C6
C > A > B3

C has the fewest votes, a count of 3, and is eliminated. A benefits from that, gathering all the votes from C. Now, with 7 votes A wins against B with 6 votes.

CandidateVotes in round
1st2nd
A47
B66
C3

Result: A wins against B, after C has been eliminated.

All voters

Finally, the instant runoff winner of the complete set of voters is determined.

PreferencesVoters
A > B > C8
B > A > C8
C > A > B3
C > B > A4

C has the fewest first preferences and so is eliminated first, its votes are split: 4 are transferred to B and 3 to A. Thus, B wins with 12 votes against 11 votes of A.

CandidateVotes in round
1st2nd
A811
B812
C7

Result: B wins against A, after C is eliminated.

Conclusion

A is the instant-runoff winner within the first group of voters and also within the second group of voters. However, both groups combined elect B as the instant-runoff winner. Thus, instant-runoff voting fails the consistency criterion.

Kemeny-Young method

This example shows that the Kemeny–Young method violates the consistency criterion. Assume three candidates A, B and C and 38 voters with the following preferences:

GroupPreferencesVoters
1stA > B > C7
B > C > A6
C > A > B3
2ndA > C > B8
B > A > C7
C > B > A7

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

First group of voters

In the following the Kemeny-Young winner for the first group of voters is determined.

PreferencesVoters
A > B > C7
B > C > A6
C > A > B3

The Kemeny–Young method arranges the pairwise comparison counts in the following tally table:

Pairs of choicesVoters who prefer
XYX over YNeitherY over X
AB1006
AC709
BC1303

The ranking scores of all possible rankings are:

Preferences1 vs 21 vs 32 vs 3Total
A > B > C1071330
A > C > B710320
B > A > C613726
B > C > A136928
C > A > B931022
C > B > A39618

Result: The ranking A > B > C has the highest ranking score. Thus, A wins ahead of B and C.

Second group of voters

Now, the Kemeny-Young winner for the second group of voters is determined.

PreferencesVoters
A > C > B8
B > A > C7
C > B > A7

The Kemeny–Young method arranges the pairwise comparison counts in the following tally table:

Pairs of choicesVoters who prefer
XYX over YNeitherY over X
AB8014
AC1507
BC7015

The ranking scores of all possible rankings are:

Preferences1 vs 21 vs 32 vs 3Total
A > B > C815730
A > C > B1581538
B > A > C1471536
B > C > A714728
C > A > B715830
C > B > A1571436

Result: The ranking A > C > B has the highest ranking score. Hence, A wins ahead of C and B.

All voters

Finally, the Kemeny-Young winner of the complete set of voters is determined.

PreferencesVoters
A > B > C7
A > C > B8
B > A > C7
B > C > A6
C > A > B3
C > B > A7

The Kemeny–Young method arranges the pairwise comparison counts in the following tally table:

Pairs of choicesVoters who prefer
XYX over YNeitherY over X
AB18020
AC22016
BC20018

The ranking scores of all possible rankings are:

Preferences1 vs 21 vs 32 vs 3Total
A > B > C18222060
A > C > B22181858
B > A > C20202262
B > C > A20201656
C > A > B16181852
C > B > A18162054

Result: The ranking B > A > C has the highest ranking score. So, B wins ahead of A and C.

Conclusion

A is the Kemeny-Young winner within the first group of voters and also within the second group of voters. However, both groups combined elect B as the Kemeny-Young winner. Thus, the Kemeny–Young method fails the consistency criterion.

Ranking consistency

The Kemeny-Young method satisfies ranking consistency; that is, if the electorate is divided arbitrarily into two parts and separate elections in each part result in the same ranking being selected, an election of the entire electorate also selects that ranking.

Informal proof

The Kemeny-Young score of a ranking is computed by summing up the number of pairwise comparisons on each ballot that match the ranking . Thus, the Kemeny-Young score for an electorate can be computed by separating the electorate into disjoint subsets (with ), computing the Kemeny-Young scores for these subsets and adding it up:

.

Now, consider an election with electorate . The premise of the consistency criterion is to divide the electorate arbitrarily into two parts , and in each part the same ranking is selected. This means, that the Kemeny-Young score for the ranking in each electorate is bigger than for every other ranking :

Now, it has to be shown, that the Kemeny-Young score of the ranking in the entire electorate is bigger than the Kemeny-Young score of every other ranking :

Thus, the Kemeny-Young method is consistent with respect to complete rankings.

Majority Judgment

This example shows that majority judgment violates the consistency criterion. Assume two candidates A and B and 10 voters with the following ratings:

CandidateVoters
AB
ExcellentFair3
PoorFair2
FairPoor3
PoorFair2

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

First group of voters

In the following the majority judgment winner for the first group of voters is determined.

CandidatesVoters
AB
ExcellentFair3
PoorFair2

The sorted ratings would be as follows:

Candidate   
 Median point
A
 
B
 
  
 

  Excellent  Good  Fair  Poor

Result: With the votes of the first group of voters, A has the median rating of "Excellent" and B has the median rating of "Fair". Thus, A is elected majority judgment winner by the first group of voters.

Second group of voters

Now, the majority judgment winner for the second group of voters is determined.

CandidatesVoters
AB
FairPoor3
PoorFair2

The sorted ratings would be as follows:

Candidate   
 Median point
A
 
B
 
  
 

  Excellent  Good  Fair  Poor

Result: Taking only the votes of the second group in account, A has the median rating of "Fair" and B the median rating of "Poor". Thus, A is elected majority judgment winner by the second group of voters.

All voters

Finally, the majority judgment winner of the complete set of voters is determined.

CandidatesVoters
AB
ExcellentFair3
FairPoor3
PoorFair4

The sorted ratings would be as follows:

Candidate   
 Median point
A
  
B
 
  
 

  Excellent  Good  Fair  Poor

The median ratings for A and B are both "Fair". Since there is a tie, "Fair" ratings are removed from both, until their medians become different. After removing 20% "Fair" ratings from the votes of each, the sorted ratings are now:

Candidate   
 Median point
A
   
B
 

Result: Now, the median rating of A is "Poor" and the median rating of B is "Fair". Thus, B is elected majority judgment winner.

Conclusion

A is the majority judgment winner within the first group of voters and also within the second group of voters. However, both groups combined elect B as the Majority Judgment winner. Thus, Majority Judgment fails the consistency criterion.

Minimax

This example shows that the minimax method violates the consistency criterion. Assume four candidates A, B, C and D with 43 voters with the following preferences:

PreferencesVoters
A > B > C > D1
A > D > B > C6
B > C > D > A5
C > D > B > A6
A > B > D > C8
A > D > C > B2
C > B > D > A9
D > C > B > A6

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

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

First group of voters

In the following the minimax winner for the first group of voters is determined.

PreferencesVoters
A > B > C > D1
A > D > B > C6
B > C > D > A5
C > D > B > A6

The results would be tabulated as follows:

Pairwise election results
X
ABCD
YA[X] 11
[Y] 7
[X] 11
[Y] 7
[X] 11
[Y] 7
B[X] 7
[Y] 11
[X] 6
[Y] 12
[X] 12
[Y] 6
C[X] 7
[Y] 11
[X] 12
[Y] 6
[X] 6
[Y] 12
D[X] 7
[Y] 11
[X] 6
[Y] 12
[X] 12
[Y] 6
Pairwise election results (won-tied-lost)0-0-32-0-12-0-12-0-1
Worst pairwiseDefeat (winning votes)11121212
Defeat (margins)4666
Opposition11121212
  • [X] indicates voters who preferred the candidate listed in the column caption to the candidate listed in the row caption
  • [Y] indicates voters who preferred the candidate listed in the row caption to the candidate listed in the column caption

Result: The candidates B, C and D form a cycle with clear defeats. A benefits from that since it loses relatively closely against all three and therefore A's biggest defeat is the closest of all candidates. Thus, A is elected minimax winner by the first group of voters.

Second group of voters

Now, the minimax winner for the second group of voters is determined.

PreferencesVoters
A > B > D > C8
A > D > C > B2
C > B > D > A9
D > C > B > A6

The results would be tabulated as follows:

Pairwise election results
X
ABCD
YA[X] 15
[Y] 10
[X] 15
[Y] 10
[X] 15
[Y] 10
B[X] 10
[Y] 15
[X] 17
[Y] 8
[X] 8
[Y] 17
C[X] 10
[Y] 15
[X] 8
[Y] 17
[X] 16
[Y] 9
D[X] 10
[Y] 15
[X] 17
[Y] 8
[X] 9
[Y] 16
Pairwise election results (won-tied-lost)0-0-32-0-12-0-12-0-1
Worst pairwiseDefeat (winning votes)15171617
Defeat (margins)5979
Opposition15171617

Result: Taking only the votes of the second group in account, again, B, C and D form a cycle with clear defeats and A benefits from that because of its relatively close losses against all three and therefore A's biggest defeat is the closest of all candidates. Thus, A is elected minimax winner by the second group of voters.

All voters

Finally, the minimax winner of the complete set of voters is determined.

PreferencesVoters
A > B > C > D1
A > B > D > C8
A > D > B > C6
A > D > C > B2
B > C > D > A5
C > B > D > A9
C > D > B > A6
D > C > B > A6

The results would be tabulated as follows:

Pairwise election results
X
ABCD
YA[X] 26
[Y] 17
[X] 26
[Y] 17
[X] 26
[Y] 17
B[X] 17
[Y] 26
[X] 23
[Y] 20
[X] 20
[Y] 23
C[X] 17
[Y] 26
[X] 20
[Y] 23
[X] 22
[Y] 21
D[X] 17
[Y] 26
[X] 23
[Y] 20
[X] 21
[Y] 22
Pairwise election results (won-tied-lost)0-0-32-0-12-0-12-0-1
Worst pairwiseDefeat (winning votes)26232223
Defeat (margins)9313
Opposition26232223

Result: Again, B, C and D form a cycle. But now, their mutual defeats are very close. Therefore, the defeats A suffers from all three are relatively clear. With a small advantage over B and D, C is elected minimax winner.

Conclusion

A is the minimax winner within the first group of voters and also within the second group of voters. However, both groups combined elect C as the Minimax winner. Thus, Minimax fails the consistency criterion.

Ranked pairs

This example shows that the Ranked pairs method violates the consistency criterion. Assume three candidates A, B and C with 39 voters with the following preferences:

PreferencesVoters
A > B > C7
B > C > A6
C > A > B3
A > C > B9
B > A > C8
C > B > A6

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

First group of voters

In the following the Ranked pairs winner for the first group of voters is determined.

PreferencesVoters
A > B > C7
B > C > A6
C > A > B3

The results would be tabulated as follows:

Pairwise election results
X
ABC
YA[X] 6
[Y] 10
[X] 9
[Y] 7
B[X] 10
[Y] 6
[X] 3
[Y] 13
C[X] 7
[Y] 9
[X] 13
[Y] 3
Pairwise election results (won-tied-lost):1-0-11-0-11-0-1
  • [X] indicates voters who preferred the candidate listed in the column caption to the candidate listed in the row caption
  • [Y] indicates voters who preferred the candidate listed in the row caption to the candidate listed in the column caption

The sorted list of victories would be:

PairWinner
B (13) vs C (3)B 13
A (10) vs B (6)A 10
A (7) vs C (9)C 9

Result: B > C and A > B are locked in first (and C > A can't be locked in after that), so the full ranking is A > B > C. Thus, A is elected Ranked pairs winner by the first group of voters.

Second group of voters

Now, the Ranked pairs winner for the second group of voters is determined.

PreferencesVoters
A > C > B9
B > A > C8
C > B > A6

The results would be tabulated as follows:

Pairwise election results
X
ABC
YA[X] 14
[Y] 9
[X] 6
[Y] 17
B[X] 9
[Y] 14
[X] 15
[Y] 8
C[X] 17
[Y] 6
[X] 8
[Y] 15
Pairwise election results (won-tied-lost):1-0-11-0-11-0-1

The sorted list of victories would be:

PairWinner
A (17) vs C (6)A 17
B (8) vs C (15)C 15
A (9) vs B (14)B 14

Result: Taking only the votes of the second group in account, A > C and C > B are locked in first (and B > A can't be locked in after that), so the full ranking is A > C > B. Thus, A is elected Ranked pairs winner by the second group of voters.

All voters

Finally, the Ranked pairs winner of the complete set of voters is determined.

PreferencesVoters
A > B > C7
A > C > B9
B > A > C8
B > C > A6
C > A > B3
C > B > A6

The results would be tabulated as follows:

Pairwise election results
X
ABC
YA[X] 20
[Y] 19
[X] 15
[Y] 24
B[X] 19
[Y] 20
[X] 18
[Y] 21
C[X] 24
[Y] 15
[X] 21
[Y] 18
Pairwise election results (won-tied-lost):1-0-12-0-00-0-2

The sorted list of victories would be:

PairWinner
A (25) vs C (15)A 24
B (21) vs C (18)B 21
A (19) vs B (20)B 20

Result: Now, all three pairs (A > C, B > C and B > A) can be locked in without a cycle. The full ranking is B > A > C. Thus, Ranked pairs chooses B as winner, which is the Condorcet winner, due to the lack of a cycle.

Conclusion

A is the Ranked pairs winner within the first group of voters and also within the second group of voters. However, both groups combined elect B as the Ranked pairs winner. Thus, the Ranked pairs method fails the consistency criterion.

Schulze method

This example shows that the Schulze method violates the consistency criterion. Again, assume three candidates A, B and C with 39 voters with the following preferences:

PreferencesVoters
A > B > C7
B > C > A6
C > A > B3
A > C > B9
B > A > C8
C > B > A6

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

First group of voters

In the following the Schulze winner for the first group of voters is determined.

PreferencesVoters
A > B > C7
B > C > A6
C > A > B3

The pairwise preferences would be tabulated as follows:

Matrix of pairwise preferences
d[X, Y]Y
ABC
XA107
B613
C93

Now, the strongest paths have to be identified, e.g. the path A > B > C is stronger than the direct path A > C (which is nullified, since it is a loss for A).

Strengths of the strongest paths
d[X, Y]Y
ABC
XA1010
B913
C99

Result: A > B, A > C and B > C prevail, so the full ranking is A > B > C. Thus, A is elected Schulze winner by the first group of voters.

Second group of voters

Now, the Schulze winner for the second group of voters is determined.

PreferencesVoters
A > C > B9
B > A > C8
C > B > A6

The pairwise preferences would be tabulated as follows:

Matrix of pairwise preferences
d[X, Y]Y
ABC
XA917
B148
C615

Now, the strongest paths have to be identified, e.g. the path A > C > B is stronger than the direct path A > B.

Strengths of the strongest paths
d[X, Y]Y
ABC
XA1517
B1414
C1415

Result: A > B, A > C and C > B prevail, so the full ranking is A > C > B. Thus, A is elected Schulze winner by the second group of voters.

All voters

Finally, the Schulze winner of the complete set of voters is determined.

PreferencesVoters
A > B > C7
A > C > B9
B > A > C8
B > C > A6
C > A > B3
C > B > A6

The pairwise preferences would be tabulated as follows:

Matrix of pairwise preferences
d[X, Y]Y
ABC
XA1924
B2021
C1518

Now, the strongest paths have to be identified:

Strengths of the strongest paths
d[X, Y]Y
ABC
XA024
B2021
C00

Result: A > C, B > A and B > C prevail, so the full ranking is B > A > C. Thus, Schulze chooses B as winner. In fact, B is also Condorcet winner.

Conclusion

A is the Schulze winner within the first group of voters and also within the second group of voters. However, both groups combined elect B as the Schulze winner. Thus, the Schulze method fails the consistency criterion.

Related Research Articles

<span class="mw-page-title-main">Condorcet method</span> 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, 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.

<span class="mw-page-title-main">Copeland's method</span> Single-winner ranked vote system

Copeland's method, also called Llull's method or round-robin voting, is a ranked-choice voting system based on scoring pairwise wins and losses.

The Smith set, also known as the top cycle, is a concept from the theory of electoral systems that generalizes the Condorcet winner to cases where no such winner exists, by allowing cycles of candidates to be treated jointly as if they were a single Condorcet winner. Named after John H. Smith, the Smith set is the smallest non-empty set of candidates in a particular election, such that each member defeats every candidate outside the set in a pairwise election. The Smith set provides one standard of optimal choice for an election outcome. Voting systems that always elect a candidate from the Smith set pass the Smith criterion.

Ranked pairs, sometimes called the Tideman method, is a tournament-style system of ranked-choice voting first proposed by Nicolaus Tideman in 1987.

The Schulze method is a single winner ranked-choice rule developed by Markus Schulze that selects a using ranked ballots. It is also known as the beatpath method or Schwartz sequential dropping (SSD). The Schulze method is a Condorcet method, which means if there is a candidate who is preferred by a majority over every other candidate in pairwise comparisons, then this candidate will be the winner when the Schulze method is applied.

In an election, a candidate is called a Condorcet, beats-all, or majority-rule winner if more than half of voters would support them in any one-on-one matchup with another candidate. Such a candidate is also called an undefeated, or tournament champion, by analogy with round-robin tournaments. Voting systems where a majority-rule winner will always win the election are said to satisfy the Condorcetcriterion. Condorcet voting methods extend majority rule to elections with more than one candidate.

The Smith criterion is a voting system criterion that formalizes the concept of a majority rule. A voting system satisfies the Smith criterion if it always elects a candidate from the Smith set, which generalizes the idea of a "Condorcet winner" to cases where there may be cycles or ties, by allowing for several who together can be thought of as being "Condorcet winners." A Smith method will always elect a candidate from the Smith set.

The participation criterion, also called vote or population monotonicity, is a voting system criterion that says that a candidate should never lose an election because they have "too much support." It says that adding voters who support A over B should not cause A to lose the election to B.

The mutual majority criterion, also known as majority for solid coalitions or the generalized majority criterion, is a voting system criterion that says that if a majority of voters ranks a certain group of candidates at the top of their ballot, then one of these candidates should win the election.

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.

In voting systems, the Minimax Condorcet method is a single-winner ranked-choice voting method that always elects the majority (Condorcet) winner. Minimax compares all candidates against each other in a round-robin tournament, then ranks candidates by their worst election result. The candidate with the largest (maximum) number of votes in their worst (minimum) matchup is declared the winner.

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 Kemeny–Young method is an electoral system that uses ranked ballots and pairwise comparison counts to identify the most popular choices in an election. It is a Condorcet method because if there is a Condorcet winner, it will always be ranked as the most popular choice.

The later-no-harm criterion is a voting system criterion first formulated by Douglas Woodall. Woodall defined the criterion by saying that "[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 of 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. It is a relative criterion: it states how changing an election should or shouldn't affect the outcome.

Schulze STV is a draft single transferable vote (STV) ranked voting system designed to achieve proportional representation. It was invented by Markus Schulze, who developed the Schulze method for resolving ties using a Condorcet method. Schulze STV is similar to CPO-STV in that it compares possible winning candidate pairs and selects the Condorcet winner. It is not used in parliamentary elections.

The majority loser criterion is a criterion to evaluate single-winner voting systems. The criterion states that if a majority of voters prefers every other candidate over a given candidate, then that candidate must not win.

<span class="mw-page-title-main">Ranked voting</span> Family of electoral systems

The term ranked voting, also known as preferential voting or ranked-choice voting, pertains to any voting system where voters indicate a rank to order candidates or options—in a sequence from first, second, third, and onwards—on their ballots. Ranked voting systems vary based on the ballot marking process, how preferences are tabulated and counted, the number of seats available for election, and whether voters are allowed to rank candidates equally.

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.


A major branch of social choice theory is devoted to the comparison of electoral systems, otherwise known as social choice functions. Viewed from the perspective of political science, electoral systems are rules for conducting elections and determining winners from the ballots cast. From the perspective of economics, mathematics, and philosophy, a social choice function is a mathematical function that determines how a society should make choices, given a collection of individual preferences.

References

  1. Balinski, Michel; Laraki, Rida (2011-01-28). Majority Judgment. The MIT Press. doi:10.7551/mitpress/9780262015134.001.0001. ISBN   978-0-262-01513-4.
  2. Young, H. P.; Levenglick, A. (1978). "A Consistent Extension of Condorcet's Election Principle". SIAM Journal on Applied Mathematics. 35 (2): 285–300. doi:10.1137/0135023. ISSN   0036-1399. JSTOR   2100667.
  1. ^ John H Smith, "Aggregation of preferences with variable electorate", Econometrica, Vol. 41 (1973), pp. 10271041.
  2. ^ D. R. Woodall, "Properties of preferential election rules", Voting matters, Issue 3 (December 1994), pp. 815.
  3. ^ H. P. Young, "Social Choice Scoring Functions", SIAM Journal on Applied Mathematics Vol. 28, No. 4 (1975), pp. 824838.