Benham's method: Difference between revisions
Content added Content deleted
m (Kristomun moved page Benham's Method to Benham's method: Capitalization) |
No edit summary |
||
| Line 1: | Line 1: | ||
'''Definition of Benham's method:''' |
'''Definition of Benham's method:''' |
||
{{definition|Do IRV |
{{definition|Do IRV, but before each elimination check if there is an un-eliminated candidate who beats each one of |
||
the other un-eliminated candidates. |
the other un-eliminated candidates, and elect them if they exist. |
||
X beats Y if more ballots rank X over Y than rank Y over X.}} |
X beats Y if more ballots rank X over Y than rank Y over X.}} |
||
Benham's method is a [[Generalized Condorcet criterion|Smith-efficient]] [[Condorcet method]]. |
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> |
||
For more information, go to the [[Woodall's method]] article. |
For more information, go to the [[Woodall's method]] article. |
||
Revision as of 10:21, 12 February 2020
Definition of Benham's method:
Do IRV, but before each elimination check if there is an un-eliminated candidate who beats each one of
the other un-eliminated candidates, and elect them if they exist.
X beats Y if more ballots rank X over Y than rank Y over X.
Benham's method is a 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. [1]
For more information, go to the Woodall's method article.