Bottom-Two-Runoff IRV: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 60:
== Notes ==
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.
BTR-IRV is not immune to clones. Example:
{| class="wikitable"
Line 95 ⟶ 97:
|}
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 [[Benham's method]] and other [[:Category:Condorcet-IRV hybrid methods|Condorcet-IRV hybrid methods]]; two such variations would be "Do BTR-IRV until there is a Condorcet winner" and "Repeat both steps until only one candidate remains: Eliminate everyone not in the Smith set, then do a pairwise elimination between the two candidates with the fewest 1st choices".
== External links ==
| |||