4,193
edits
Benham's method: Difference between revisions
A bit of copyediting of the beginning of the article
(→Notes: Noting drawbacks of Benham's method) |
(A bit of copyediting of the beginning of the article) |
||
Line 1:
'''Benham's method''' is a variation of [[instant-runoff voting]] invented by Chris Benham.<ref>{{Cite web|url=http://lists.electorama.com/pipermail/election-methods-electorama.com//2014-April/097948.html|title=[EM] Benham's method looks best, among the Smith + CD methods|last=Ossipoff|first=Michael|date=Mon Apr 28 22:42:39 PDT 2014|website=election-methods list|url-status=live|access-date=2022-01-11}}</ref> The method calls for tabulating the first-choice of all voters on all ballots (as done with instant-runoff), but before each elimination check if there is an un-eliminated candidate who [[pairwise counting#Terminology|pairwise beats]] all other un-eliminated candidates, and elect them if they exist.
Between two candidates X and Y, X pairwise beats Y if more ballots rank X over Y than rank Y over X.
▲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". This can be further rephrased to also work as a variant of STV, in the following way: "Eliminate the candidate ranked the highest by the fewest voters unless that candidate is the [[Condorcet winner]], in which case eliminate the candidate ranked highest by the second fewest voters".
| |||