User:BetterVotingAdvocacy/Negative vote-counting approach for pairwise counting: Difference between revisions
User:BetterVotingAdvocacy/Negative vote-counting approach for pairwise counting (view source)
Revision as of 18:31, 18 September 2021
, 2 years agono edit summary
No edit summary |
|||
Line 4:
An example of negative pairwise counting: if 5 voters ranked a candidate (A), and 3 of them didn't rank A above some other candidate (B), then 2 voters must have ranked A above or equal to B. When a voter only ranks candidates as their 1st choice(s) or last choices (i.e. uses equal-ranking with only two ranks), then negative pairwise counting becomes essentially equivalent to [[Approval voting]]'s vote-counting procedure for that voter's ballot.
Semi-negative pairwise counting, which is theoretically even faster, is based on using both of the regular and negative pairwise counting techniques. A [[User:BetterVotingAdvocacy/Negative vote-counting approach for pairwise counting#Regular pairwise counting but done by counting first choices separately|simple variation]] on semi-negative counting is to do regular pairwise counting except that each voter's 1st-choice candidate(s) are simply counted as being marked by those voters, with no need to do pairwise counting for those specific candidates. A number of election examples are provided [[User:BetterVotingAdvocacy/Negative vote-counting approach for pairwise counting#Election example comparisons|below]], with analysis of how the various pairwise counting methods would perform when counting the ballots (the analysis being based off of various [[User:BetterVotingAdvocacy/Negative vote-counting approach for pairwise counting#Formula for counting the required number of marks to be made|formulas]] also provided below.) There are also vote-counting techniques based on similar principles that can be used in non-pairwise contexts, such as for [[Score voting]] and various [[PR]] methods.
== Description ==
| |||