Benham's method: Difference between revisions
Add STV-friendly phrasing of elimination condition
No edit summary |
(Add STV-friendly phrasing of elimination condition) |
||
Line 4:
Between two candidates X and Y, X pairwise beats Y if more ballots rank X over Y than rank Y over X.}}
An alternative way of describing it is: "Elect the [[Condorcet winner]] (if there is one), otherwise eliminate the candidate ranked the highest by the fewest voters, and repeat
When voters are allowed to equally rank candidates, Benham's method can either be implemented by equally splitting each voter's vote between each candidate they equally ranked highest, or giving each equally-highest-ranked candidate one vote. See the [[Single_transferable_vote#Ways_of_dealing_with_equal_rankings|single transferable vote]] page for more information.
Benham's method is a [[Generalized Condorcet criterion|Smith-efficient]] [[Condorcet method]]. This is because there will always be a point in the count where at least one [[Smith set]] member is uneliminated, and that candidate must beat all other candidates by virtue of being in the Smith Set. Benham's method fails [[ISDA]], however. <ref>http://www.votingmatters.org.uk/ISSUE29/I29P1.pdf</ref>
| |||