This article includes a list of general references, but it lacks sufficient corresponding inline citations .(October 2011) |
The later-no-help criterion (or LNHe, not to be confused with LNH) 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.[ citation needed ]
Approval, instant-runoff, highest medians, and score all satisfy the later-no-help criterion. Plurality voting satisfies it trivially (as plurality only applies to the top-ranked candidate). Descending Solid Coalitions also satisfies later-no-help.
All Minimax Condorcet methods, Ranked Pairs, Schulze method, Kemeny-Young method, Copeland's method, and Nanson's method do not satisfy later-no-help. The Condorcet criterion is incompatible with later-no-help.[ citation needed ]
Checking for failures of the Later-no-help criterion requires ascertaining the probability of a voter's preferred candidate being elected before and after adding a later preference to the ballot, to determine any increase in probability. Later-no-help presumes that later preferences are added to the ballot sequentially, so that candidates already listed are preferred to a candidate added later.
Anti-plurality elects the candidate the fewest voters rank last when submitting a complete ranking of the candidates.
Later-No-Help can be considered not applicable to Anti-Plurality if the method is assumed to not accept truncated preference listings from the voter. On the other hand, Later-No-Help can be applied to Anti-Plurality if the method is assumed to apportion the last place vote among unlisted candidates equally, as shown in the example below.
Assume four voters (marked bold) submit a truncated preference listing A > B = C by apportioning the possible orderings for B and C equally. Each vote is counted A > B > C, and A > C > B:
# of voters | Preferences |
---|---|
2 | A ( > B > C) |
2 | A ( > C > B) |
4 | B > A > C |
3 | C > B > A |
Result: A is listed last on 3 ballots; B is listed last on 2 ballots; C is listed last on 6 ballots. B is listed last on the least ballots. B wins. A loses.
Now assume that the four voters supporting A (marked bold) add later preference C, as follows:
# of voters | Preferences |
---|---|
4 | A > C > B |
4 | B > A > C |
3 | C > B > A |
Result: A is listed last on 3 ballots; B is listed last on 4 ballots; C is listed last on 4 ballots. A is listed last on the least ballots. A wins.
The four voters supporting A increase the probability of A winning by adding later preference C to their ballot, changing A from a loser to the winner. Thus, Anti-plurality fails the Later-no-help criterion when truncated ballots are considered to apportion the last place vote amongst unlisted candidates equally.
Coombs' method repeatedly eliminates the candidate listed last on most ballots, until a winner is reached. If at any time a candidate wins an absolute majority of first place votes among candidates not eliminated, that candidate is elected.
Later-No-Help can be considered not applicable to Coombs if the method is assumed to not accept truncated preference listings from the voter. On the other hand, Later-No-Help can be applied to Coombs if the method is assumed to apportion the last place vote among unlisted candidates equally, as shown in the example below.
Assume four voters (marked bold) submit a truncated preference listing A > B = C by apportioning the possible orderings for B and C equally. Each vote is counted A > B > C, and A > C > B:
# of voters | Preferences |
---|---|
2 | A ( > B > C) |
2 | A ( > C > B) |
4 | B > A > C |
4 | C > B > A |
2 | C > A > B |
Result: A is listed last on 4 ballots; B is listed last on 4 ballots; C is listed last on 6 ballots. C is listed last on the most ballots. C is eliminated, and B defeats A pairwise 8 to 6. B wins. A loses.
Now assume that the four voters supporting A (marked bold) add later preference C, as follows:
# of voters | Preferences |
---|---|
4 | A > C > B |
4 | B > A > C |
4 | C > B > A |
2 | C > A > B |
Result: A is listed last on 4 ballots; B is listed last on 6 ballots; C is listed last on 4 ballots. B is listed last on the most ballots. B is eliminated, and A defeats C pairwise 8 to 6. A wins.
The four voters supporting A increase the probability of A winning by adding later preference C to their ballot, changing A from a loser to the winner. Thus, Coombs' method fails the Later-no-help criterion when truncated ballots are considered to apportion the last place vote amongst unlisted candidates equally.
This example shows that Copeland's method violates the Later-no-help criterion. Assume four candidates A, B, C and D with 7 voters:
Assume that the two voters supporting A (marked bold) do not express later preferences on the ballots:
# of voters | Preferences |
---|---|
2 | A |
3 | B > A |
1 | C > D > A |
1 | D > C |
The results would be tabulated as follows:
X | |||||
A | B | C | D | ||
Y | A | [X] 3 [Y] 3 | [X] 2 [Y] 5 | [X] 2 [Y] 5 | |
B | [X] 3 [Y] 3 | [X] 2 [Y] 3 | [X] 2 [Y] 3 | ||
C | [X] 5 [Y] 2 | [X] 3 [Y] 2 | [X] 1 [Y] 1 | ||
D | [X] 5 [Y] 2 | [X] 3 [Y] 2 | [X] 1 [Y] 1 | ||
Pairwise election results (won-tied-lost): | 2-1-0 | 2-1-0 | 0-1-2 | 0-1-2 |
Result: Both A and B have two pairwise wins and one pairwise tie, so A and B are tied for the Copeland winner. Depending on the tie resolution method used, A can lose.
Now assume the two voters supporting A (marked bold) express later preferences on their ballot.
# of voters | Preferences |
---|---|
2 | A > C > D |
3 | B > A |
1 | C > D > A |
1 | D > C |
The results would be tabulated as follows:
X | |||||
A | B | C | D | ||
Y | A | [X] 3 [Y] 3 | [X] 2 [Y] 5 | [X] 2 [Y] 5 | |
B | [X] 3 [Y] 3 | [X] 4 [Y] 3 | [X] 4 [Y] 3 | ||
C | [X] 5 [Y] 2 | [X] 3 [Y] 4 | [X] 1 [Y] 3 | ||
D | [X] 5 [Y] 2 | [X] 3 [Y] 4 | [X] 3 [Y] 1 | ||
Pairwise election results (won-tied-lost): | 2-1-0 | 0-1-2 | 2-0-1 | 1-0-2 |
Result: B now has two pairwise defeats. A still has two pairwise wins, one tie, and no defeats. Thus, A is elected Copeland winner.
By expressing later preferences, the two voters supporting A promote their first preference A from a tie to becoming the outright winner (increasing the probability that A wins). Thus, Copeland's method fails the Later-no-help criterion.
Dodgson's' method elects a Condorcet winner if there is one, and otherwise elects the candidate who can become the Condorcet winner after the fewest ordinal preference swaps on voters' ballots.
Later-No-Help can be considered not applicable to Dodgson if the method is assumed to not accept truncated preference listings from the voter. On the other hand, Later-No-Help can be applied to Dodgson if the method is assumed to apportion possible rankings among unlisted candidates equally, as shown in the example below.
Assume ten voters (marked bold) submit a truncated preference listing A > B = C by apportioning the possible orderings for B and C equally. Each vote is counted A > B > C, and A > C > B:
# of voters | Preferences |
---|---|
5 | A ( > B > C) |
5 | A ( > C > B) |
10 | B > A > C |
2 | C > B > A |
1 | C > A > B |
Against A | Against B | Against C | |
---|---|---|---|
For A | 11 | 20 | |
For B | 12 | 15 | |
For C | 3 | 8 |
Result: B is the Condorcet winner and the Dodgson winner. A loses.
Now assume that the ten voters supporting A (marked bold) add later preference C, as follows:
# of voters | Preferences |
---|---|
10 | A > C > B |
10 | B > A > C |
2 | C > B > A |
1 | C > A > B |
Against A | Against B | Against C | |
---|---|---|---|
For A | 11 | 20 | |
For B | 12 | 10 | |
For C | 3 | 13 |
Result: There is no Condorcet winner. A is the Dodgson winner, because A becomes the Condorcet Winner with only two ordinal preference swaps (changing B > A to A > B). A wins.
The ten voters supporting A increase the probability of A winning by adding later preference C to their ballot, changing A from a loser to the winner. Thus, Dodgson's method fails the Later-no-help criterion when truncated ballots are considered to apportion the possible rankings amongst unlisted candidates equally.
For example, in an election conducted using the Condorcet compliant method Ranked pairs the following votes are cast:
28: A | 42: B>A | 30: C |
A is preferred to C by 70 votes to 30 votes. (Locked)
B is preferred to A by 42 votes to 28 votes. (Locked)
B is preferred to C by 42 votes to 30 votes. (Locked)
B is the Condorcet winner and therefore the Ranked pairs winner.
Suppose the 28 A voters specify second choice C (they are burying B).
The votes are now:
28: A>C | 42: B>A | 30: C |
A is preferred to C by 70 votes to 30 votes. (Locked)
C is preferred to B by 58 votes to 42 votes. (Locked)
B is preferred to A by 42 votes to 28 votes. (Cycle)
There is no Condorcet winner and A is the Ranked pairs winner.
By giving a second preference to candidate C the 28 A voters have caused their first choice to win. Note that, should the C voters decide to bury A in response, B will beat A by 72, restoring B to victory.
Similar examples can be constructed for any Condorcet-compliant method, as the Condorcet and later-no-help criteria are incompatible.
Approval voting is a single-winner electoral system in which voters mark all the candidates they support, instead of just choosing one. The candidate with the highest approval rating is elected. Approval voting is currently in use for government elections in St. Louis, Missouri, Fargo, North Dakota and in the United Nations to elect the Secretary General.
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 or Pairwise Majority Rule Winner (PMRW). The head-to-head elections need not be done separately; a voter's choice within any given pair can be determined from the ranking.
The Copeland or Llull method is a ranked-choice voting system based on counting each candidate's pairwise wins and losses.
The Smith or Schwartz set, sometimes called the top-cycle, generalizes the idea of a Condorcet winner to cases where no such winner exists. It does so by allowing cycles of candidates to be treated jointly, as if they were a single Condorcet winner.
In social choice, a no-show paradox is a pathology in some voting rules, where a candidate loses an election as a result of having too many supporters. More formally, a no-show paradox occurs when adding voters who prefer Alice to Bob causes Alice to lose the election to Bob. Voting systems without the no-show paradox are said to satisfy the participation criterion.
The majority favorite criterion is a voting system criterion that says that, if a candidate would win more than half the vote in a first-preference plurality election, that candidate should win. Equivalently, if only one candidate is ranked first by a over 50% of voters, that candidate must win.
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.
In social choice theory, the best-is-worst paradox occurs when a voting rule declares the same candidate to be both the best and worst possible winner. The worst candidate can be identified by reversing each voter's ballot, then applying the voting rule to the reversed ballots find a new "anti-winner".
Woodall'splurality criterion is a voting criterion for ranked voting. It is stated as follows:
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.
Later-no-harm is a property of some ranked-choice voting systems, first described by Douglas Woodall. In later-no-harm systems, increasing the rating or rank of a candidate ranked below the winner of an election cannot cause a higher-ranked candidate to lose.
In social choice theory, the independence of (irrelevant) clones criterion says that adding a clone, i.e. a new candidate very similar to an already-existing candidate, should not spoil the results. It can be considered a very weak form of the independence of irrelevant alternatives (IIA) criterion.
The Borda method or order of merit is a positional voting rule which gives each candidate a number of points equal to the number of candidates ranked below them: the lowest-ranked candidate gets 0 points, the second-lowest gets 1 point, and so on. Once all votes have been counted, the option or candidate with the most points is the winner.
Instant-runoff voting (IRV) is a winner-takes-all multi-round elimination voting system that uses ranked voting to simulate a series of runoff elections, where the last-place finisher according to a plurality vote is eliminated in each round. Its purpose is to elect the candidate in single-member districts with majority support even when there are more than two candidates. IRV is most closely related to two-round runoff election.
Dodgson's method is an electoral system based on a proposal by mathematician Charles Dodgson, better known as Lewis Carroll. The method searches for a majority-preferred winner; if no such winner is found, the method proceeds by finding the candidate who could be transformed into a Condorcet winner with the smallest number of ballot edits possible, where a ballot edit switches two neighboring candidates on a voter's ballot.
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.
There are a number of different criteria which can be used for voting systems in an election, including the following
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.
Round-robin, pairedcomparison, or tournamentvoting methods, are a set of ranked voting systems that choose winners by comparing every pair of candidates one-on-one, similar to a round-robin tournament. In each paired matchup, we record the total number of voters who prefer each candidate in a beats matrix. Then, a majority-preferred (Condorcet) candidate is elected, if one exists. Otherwise, if there is a cyclic tie, the candidate "closest" to being a Condorcet winner is elected, based on the recorded beats matrix. How "closest" is defined varies by method.