Jump to content

Benham's method: Difference between revisions

no edit summary
No edit summary
No edit summary
Line 11:
 
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". Because the latter is always equivalent to the former (a candidate who is a majority's 1st choice is always a Condorcet winner), Benham's method will never require more rounds of counting (eliminations, ignoring the discovery of the [[Pairwise counting|pairwise counting]] table) than plain IRV, and will often require none (when there is a Condorcet winner).
 
Example:
 
34 A>B>C
 
32 B>A
 
34 C>B>A
 
Regular IRV eliminates B and elects A here, whereas Benham elects B for being the Condorcet winner ([[Pairwise beat|pairwise beats]] A and C 66 to 34 each). This is an example of an averted [[Center squeeze effect|center squeeze effect]].
 
For more information, go to the [[Woodall's_method#Benham.27s_method:|Woodall's method article]].
Cookies help us deliver our services. By using our services, you agree to our use of cookies.