Anonymous user
Quick Runoff: Difference between revisions
Tennessee
(revert) |
imported>KVenzke (Tennessee) |
||
Line 1:
'''Quick Runoff''' or '''QR''' or '''Instant Chain Runoff''' is a method devised by Kevin Venzke which satisfies [[Later-no-harm]] but, unlike [[IRV]], can sometimes elect the candidate with the fewest first preferences.
The method is so named because in the three-candidate case it is not as "instant" as [[IRV]], as instead of a single top-two runoff, there is first a simulated runoff between the top two candidates, and then potentially the bottom two candidates.
Line 18:
Note that the supporters of the top two candidates (by first preferences) have both [[Later-no-harm]] and [[Later-no-help]] assurances. Labeling the candidates A, B, and C, the A voters' lower preference is only counted once A is known to have lost. The B voters' lower preference is not regarded at all, because candidates are only compared to their "adjacent" candidates in first-preference order, and A vs. C (the race that B voters can influence) are not adjacent.
== Example ==
{{Tenn_voting_example}}
The first preference ordering is Memphis, Nashville, Knoxville, Chattanooga. Since all the voters listed all of their preferences, all of the pairwise losses have majority strength.
Memphis has a majority loss to Nashville, so Memphis will not win. Nashville does not have a majority loss to Knoxville. The method thus ends here, with the election of Nashville.
[[Category:Single-winner voting systems]]
| |||