Benham's method: Difference between revisions
Content added Content deleted
mNo edit summary |
m (Capitalized "Condorcet", rephrased sentence slightly) |
||
| Line 121: | Line 121: | ||
Because Benham's method is just IRV with the possibility of ending in an earlier round, it is possible to figure out who the Benham winner would be if given the full results of an IRV election (the round-by-round breakdown) and the pairwise comparison table for that election. |
Because Benham's method is just IRV with the possibility of ending in an earlier round, it is possible to figure out who the Benham winner would be if given the full results of an IRV election (the round-by-round breakdown) and the pairwise comparison table for that election. |
||
Like other Condorcet systems, Benham's method is vulnerable to [[tactical voting]] and generally ignores first place votes. This can lead to scenarios where fringe candidates that have not been scrutinized can win with only middle round votes. Benham's method also suffers from conflicting mechanisms, where first place votes are either ignored (once there is a |
Like other Condorcet systems, Benham's method is vulnerable to [[tactical voting]] and generally ignores first place votes. This can lead to scenarios where fringe candidates that have not been scrutinized can win with only middle round votes. Benham's method also suffers from conflicting mechanisms, where first place votes are either ignored (once there is a Condorcet winner) or are all that matters (when there is no Condorcet winner). |
||
== References == |
== References == |
||