Benham's method: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 10:
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>{{Cite web|url=http://www.votingmatters.org.uk/ISSUE29/I29P1.pdf|title=Four Condorcet-Hare Hybrid Methods for Single-Winner Elections|date=|access-date=|website=|last=Green-Armytage|first=James|archive-url=|archive-date=|url-status=live}}</ref>
Benham's method can be thought of as a [[Tideman's Alternative methods|Tideman alternative method]] that uses the Condorcet winner as its "set". Benham's method can also be thought of as an advanced version of IRV which interprets "majority" to mean "candidate who can win a majority [[Pairwise counting|pairwise]] against all other uneliminated candidates" rather than "majority's 1st choice among all uneliminated candidates".
For more information, go to the [[Woodall's_method#Benham.27s_method:|Woodall's method article]].
| |||