Benham's method: Difference between revisions
citation template
Psephomancy (talk | contribs) (Fix link and refs) |
Psephomancy (talk | contribs) (citation template) |
||
Line 8:
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.
Benham's method can be thought of as a [[Tideman's Alternative methods|Tideman alternative method]] that uses the Condorcet winner as its "set".
| |||