Ranked Choice Including Pairwise Elimination: Difference between revisions

Content added Content deleted
(Add page Ranked Choice Including Pairwise Elimination)
 
m (Wording refinements)
Line 17: Line 17:
The last candidate to be eliminated is the runner-up candidate. If this counting method is used in the primary election of a major political party, and if the runoff or "general" election is counted in a way that is not vulnerable to vote splitting, then ideally the runner-up candidate would move to the runoff or general election along with the primary-election winner. Small political parties would not qualify to move their runner-up candidate to the runoff or general election.
The last candidate to be eliminated is the runner-up candidate. If this counting method is used in the primary election of a major political party, and if the runoff or "general" election is counted in a way that is not vulnerable to vote splitting, then ideally the runner-up candidate would move to the runoff or general election along with the primary-election winner. Small political parties would not qualify to move their runner-up candidate to the runoff or general election.


Importantly, this method is not suitable for filling multiple seats, such as on a city council or a multi-member district. This means the runner-up candidate does not deserve to win any kind of elected seat.
Importantly, the runner-up candidate does not deserve to win any kind of elected seat. This means this method is not suitable for filling multiple seats, such as on a city council or in a multi-member district.


To avoid spoiled ballots in elections where the voter uses a pen or marker to mark their paper ballot, more than one candidate can be marked at the same ranking level. When an elimination round involves two or more remaining highest-ranked candidates, the single vote is split equally among these candidates. This splitting of a single vote can be done using fractions or decimal numbers that do not exceed a total of one vote per ballot.
To avoid spoiled ballots in elections where the voter uses a pen or marker to mark their paper ballot, more than one candidate can be marked at the same ranking level. When an elimination round involves two or more remaining highest-ranked candidates, the single vote is split equally among these candidates. This splitting of a single vote can be done using fractions or decimal numbers that do not exceed a total of one vote per ballot.
Line 30: Line 30:
If two or more candidates have the same smallest top-choice count, this tie is resolved by eliminating the candidate with the largest pairwise opposition count, which is determined by counting on each ballot the number of not-yet-eliminated tied candidates who are ranked above that candidate, and adding those numbers across all the ballots.
If two or more candidates have the same smallest top-choice count, this tie is resolved by eliminating the candidate with the largest pairwise opposition count, which is determined by counting on each ballot the number of not-yet-eliminated tied candidates who are ranked above that candidate, and adding those numbers across all the ballots.


If there is a tie for this largest pairwise opposition count, the method eliminates the candidate with the smallest pairwise support count, which similarly counts support rather than opposition.
If there is a tie for the largest pairwise opposition count, this tie is resolved by eliminating the candidate with the smallest pairwise support count, which is determined by counting on each ballot the number of not-yet-eliminated tied candidates who are ranked above that candidate, and adding those numbers across all the ballots.


If there is also a tie for the smallest pairwise support count, then those candidates are tied and another tie-breaking method is needed to identify which of the still-tied candidates to eliminate.
Note that the pairwise opposition count and pairwise support count are calculated using only the candidates who are currently tied. This means that ballot information about eliminated candidates and not-tied candidates is ignored when resolving ties.

If there is also a tie for the smallest pairwise support count, then another tie-breaking method is needed to identify which of the still-tied candidates to eliminate.


== Example ==
== Example ==