Bottom-Two-Runoff IRV: Difference between revisions
→Notes
No edit summary |
(→Notes) |
||
Line 60:
== Notes ==
BTR-IRV only requires eliminations to be done until one candidate remains who [[Pairwise counting#Terminology|pairwise beats]] all other uneliminated candidates, at which point that candidate can be declared the winner; this is because that candidate is guaranteed not to be eliminated in any remaining BTR-IRV pairwise matchups. This trick can be used to save time in counting if a pairwise comparison table has already been made, and also means BTR-IRV can be phrased analagously to [[Benham's method]], though in terms of BTR-IRV itself instead of IRV.
BTR-IRV can be thought of as directly related to IRV in the sense that both focus on eliminating one of the two candidates with the fewest 1st choices in each round; the only difference is that BTR-IRV can eliminate the candidate with the 2nd-fewest 1st choices if they lose the pairwise matchup against the candidate with the fewest 1st choices, whereas IRV always eliminates the candidate with the fewest 1st choices.
Line 98 ⟶ 100:
There are likely to be many candidates tied for having the fewest 1st choices; one possible non-random tiebreaker is to look for those among the tied candidates that have the fewest 2nd choices, then 3rd choices, etc.
Variations of BTR-IRV could be considered to parallel
== External links ==
| |||