From Surf Wiki (app.surf) — the open knowledge base
Later-no-harm criterion
Property of electoral systems
Property of electoral systems
| Name | Comply? | |
|---|---|---|
| Plurality | ||
| Two-round system | ||
| Partisan primary | ||
| Instant-runoff voting | ||
| Minimax Opposition | ||
| DSC | ||
| Anti-plurality | ||
| Approval | ||
| Borda | ||
| Dodgson | ||
| Copeland | ||
| Kemeny | ||
| Ranked Pairs | ||
| Schulze | ||
| Score | ||
| Majority judgment |
Later-no-harm is a property of 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. It is a common property in the plurality-rule family of voting systems.
For example, say a group of voters ranks Alice 2nd and Bob 6th, and Alice wins the election. In the next election, Bob focuses on expanding his appeal with this group of voters, but does not manage to defeat Alice—Bob's rating increases from 6th-place to 3rd. Later-no-harm says that this increased support from Alice's voters should not allow Bob to win.
Later-no-harm may be confused as implying center squeeze, since later-no-harm is a defining characteristic of first-preference plurality (FPP) and instant-runoff voting (IRV), and descending solid coalitions (DSC), systems that have similar mechanics that are based on first preference counting. These systems pass later-no-harm compliance by making sure the results either do not depend on lower preferences at all (plurality) or only depend on them if all higher preferences have been eliminated (IRV and DSC), and thus exhibit a center squeeze effect. However, this does not mean that methods that pass later-no-harm must be vulnerable to center squeezes. The properties are distinct, as Minimax opposition also passes later-no-harm.
Later-no-harm is also often confused with immunity to a kind of strategic voting called strategic truncation or bullet voting. Satisfying later-no-harm does not provide immunity to such strategies. Systems like instant runoff that pass later-no-harm but fail monotonicity still incentivize truncation or bullet voting in some situations.
Later-no-harm methods
The plurality vote, two-round system, instant-runoff voting, and descending solid coalitions satisfy the later-no-harm criterion. First-preference plurality satisfies later-no-harm trivially, by ignoring every preference after the first.
Non-LNH methods
Nearly all voting methods not discussed above fail LNH, including score voting, highest medians, Borda count, and all Condorcet methods. The Condorcet criterion is incompatible with later-no-harm (assuming the resolvability criterion, i.e. any tie can be removed by a single voter changing their rating).
Bloc voting, which allows a voter to select multiple candidates, does not satisfy later-no-harm when used to fill two or more seats in a single district, although the single non-transferable vote does.
Examples
Anti-plurality
Main article: Anti-plurality voting
Anti-plurality elects the candidate the fewest voters rank last when submitting a complete ranking of the candidates.
Later-No-Harm 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-Harm 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.
| # of voters | Preferences |
|---|---|
| **2** | **A** ( B C) |
| **2** | **A** ( C B) |
| 1 | B A C |
| 1 | B C A |
| 1 | C A B |
| 1 | C B A |
Result: A is listed last on 2 ballots; B is listed last on 3 ballots; C is listed last on 3 ballots. A is listed last on the least ballots. A wins.
; Adding Later Preferences Now assume that the four voters supporting A (marked bold) add later preference C, as follows:
| # of voters | Preferences |
|---|---|
| **4** | **A C B** |
| 1 | B A C |
| 1 | B C A |
| 1 | C A B |
| 1 | C B A |
Result: A is listed last on 2 ballots; B is listed last on 5 ballots; C is listed last on 1 ballot. C is listed last on the least ballots. C wins. A loses.
;Conclusion The four voters supporting A decrease the probability of A winning by adding later preference C to their ballot, changing A from the winner to a loser. Thus, Anti-plurality doesn't satisfy the Later-no-harm criterion when truncated ballots are considered to apportion the last place vote amongst unlisted candidates equally. |}
Borda count
Main article: Borda count
| # of voters | Preferences |
|---|---|
| 3 | A B C |
| 2 | B C A |
; Express later preferences Assume that all preferences are expressed on the ballots.
The positions of the candidates and computation of the Borda points can be tabulated as follows:
| candidate | #1. | #2. | #last | computation | Borda points |
|---|---|---|---|---|---|
| A | 3 | 0 | 2 | 3*2 + 0*1 | *6* |
| B | 2 | 3 | 0 | 2*2 + 3*1 | **7** |
| C | 0 | 2 | 3 | 0*2 + 2*1 | *2* |
Result: B wins with 7 Borda points.
;Hide later preferences Assume now that the three voters supporting A (marked bold) would not express their later preferences on the ballots:
| # of voters | Preferences |
|---|---|
| 3 | A |
| 2 | B C A |
The positions of the candidates and computation of the Borda points can be tabulated as follows:
| candidate | #1. | #2. | #last | computation | Borda points |
|---|---|---|---|---|---|
| A | 3 | 0 | 2 | 3*2 + 0*1 | **6** |
| B | 2 | 0 | 3 | 2*2 + 0*1 | *4* |
| C | 0 | 2 | 3 | 0*2 + 2*1 | *2* |
Result: A wins with 6 Borda points.
;Conclusion By hiding their later preferences about B, the three voters could change their first preference A from loser to winner. Thus, the Borda count doesn't satisfy the Later-no-harm criterion. |}
Copeland
Main article: Copeland's method
| # of voters | Preferences |
|---|---|
| **2** | **A B C D** |
| 1 | B C A D |
| 1 | D C B A |
;Express later preferences Assume that all preferences are expressed on the ballots.
The results would be tabulated as follows:
| Pairwise election results (won-tied-lost): | *1-2-0* | **2-1-0** | *1-1-1* | *0-0-3* |
|---|
Result: B has two wins and no defeat, A has only one win and no defeat. Thus, B is elected Copeland winner.
;Hide later preferences Assume now, that the two voters supporting A (marked bold) would not express their later preferences on the ballots:
| # of voters | Preferences |
|---|---|
| **2** | **A** |
| 1 | B C A D |
| 1 | D C B A |
The results would be tabulated as follows:
| Pairwise election results (won-tied-lost): | **1-2-0** | *0-3-0* | *0-3-0* | *0-2-1* |
|---|
Result: A has one win and no defeat, B has no win and no defeat. Thus, A is elected Copeland winner.
;Conclusion By hiding their later preferences, the two voters could change their first preference A from loser to winner. Thus, Copeland's method doesn't satisfy the Later-no-harm criterion. |}
Schulze method
Main article: Schulze method
| # of voters | Preferences |
|---|---|
| **3** | **A B C** |
| 1 | A = B C |
| 2 | A = C B |
| 3 | B A C |
| 1 | B A = C |
| 1 | B C A |
| 4 | C A = B |
| 1 | C B A |
; Express later preferences Assume that all preferences are expressed on the ballots.
The pairwise preferences would be tabulated as follows:
| d[*,A] | d[*,B] | d[*,C] | d[A,*] | d[B,*] | d[C,*] |
|---|---|---|---|---|---|
| 5 | 7 | ||||
| 6 | 9 | ||||
| 6 | 7 |
Result: B is Condorcet winner and thus, the Schulze method will elect B.
Hide later preferences
Assume now that the three voters supporting A (marked bold) would not express their later preferences on the ballots:
| # of voters | Preferences |
|---|---|
| **3** | **A** |
| 1 | A = B C |
| 2 | A = C B |
| 3 | B A C |
| 1 | B A = C |
| 1 | B C A |
| 4 | C A = B |
| 1 | C B A |
The pairwise preferences would be tabulated as follows:
| d[*,A] | d[*,B] | d[*,C] | d[A,*] | d[B,*] | d[C,*] |
|---|---|---|---|---|---|
| 5 | 7 | ||||
| 6 | 6 | ||||
| 6 | 7 |
Now, the strongest paths have to be identified, e.g. the path A C B is stronger than the direct path A B (which is nullified, since it is a loss for A).
| p[*,A] | p[*,B] | p[*,C] | p[A,*] | p[B,*] | p[C,*] |
|---|---|---|---|---|---|
| 7 | 7 | ||||
| 6 | 6 | ||||
| 6 | 7 |
Result: The full ranking is A C B. Thus, A is elected Schulze winner.
; Conclusion By hiding their later preferences about B and C, the three voters could change their first preference A from loser to winner. Thus, the Schulze method doesn't satisfy the Later-no-harm criterion. |}
Criticism
Douglas Woodall writes:
Notes
Bibliography
- D R Woodall, "Properties of Preferential Election Rules", Voting matters, Issue 3, December 1994 http://www.votingmatters.org.uk/ISSUE3/P5.HTM
- Tony Anderson Solgard and Paul Landskroener, Bench and Bar of Minnesota, Vol 59, No 9, October 2002. https://web.archive.org/web/20090204174848/http://www2.mnbar.org/benchandbar/2002/oct02/voting.htm
- John Brown, Jr. v. W. H. Smallwood, 130 Minn. 492, 153 N.W. 953 (July 30, 1915)
References
References
- Lewyn, Michael. (2012). "Two Cheers for Instant Runoff Voting". 6 Phoenix L. Rev..
- Stensholt, Eivind. (2015-10-07). "What Happened in Burlington?". Discussion Papers.
- (July 29, 2011). "Why Approval Voting is Unworkable in Contested Elections - FairVote".
- (2023-06-12). "An Examination of Ranked-Choice Voting in the United States, 2004–2022". Representation.
- Brams, Steven. (1982). "The AMS nomination procedure is vulnerable to 'truncation of preferences'". American Mathematical Society.
- (1984-01-01). "Manipulability of voting by sincere truncation of preferences". Public Choice.
- Douglas Woodall (1997): [http://scorevoting.net/Woodall97.pdf Monotonicity of Single-Seat Election Rules], Theorem 2 (b)
- Woodall, Douglas, Properties of Preferential Election Rules, [http://www.votingmatters.org.uk/ISSUE3/P5.HTM Voting matters - Issue 3, December 1994]
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Later-no-harm criterion — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report