VoteFair representation ranking: Difference between revisions

Line 14:

# Completely ignore the ballots identified in step 1, and use the remaining ballots to identify the most popular candidate from among the remaining candidates. This candidate will not necessarily be the second-seat winner. Instead, this candidate is used in step 4 to identify which ballots are from voters who are well-represented by the first-seat winner.

# Again consider all the ballots.

# Identify the ballots in which the first-seat winner is preferred over the candidate identified in step 2. This step identifies the ballots from voters who are well-represented by the first-seat winner. Note that he only way for a voter to avoid having his or her ballot identified in this step is to express a preference that significantly reduces the chances that the preferred candidate will be ranked as most popular.

# Identify the ballots in which the first-seat winner is preferred over the candidate identified in step 2. This step identifies the ballots from voters who are well-represented by the first-seat winner. Note that the only way for a voter to avoid having his or her ballot identified in this step is to express a preference that significantly reduces the chances that the preferred candidate will be ranked as most popular.

# Proportionally reduce the influence of the ballots identified in step 4. This calculation uses the following sub-steps:

## Count the number of ballots that were identified in step 4.

Line 29:

== External links ==

[https://github.com/cpsolver/VoteFair-ranking-cpp Open-source VoteFair Ranking software] which calculates VoteFair representation ranking results, ~~and uses~~ the Condorcet-Kemeny method for popularity calculations

[https://github.com/cpsolver/VoteFair-ranking-cpp Open-source VoteFair Ranking software] which calculates VoteFair representation ranking results using the Condorcet-Kemeny method for popularity calculations