Jump to content

User:BetterVotingAdvocacy/Negative vote-counting approach for pairwise counting: Difference between revisions

no edit summary
No edit summary
No edit summary
Line 1:
[[File:Adding ballot matrices in negative pairwise counting approach.png|thumb|1088x1088px|Note in "Step 1: Combination" that the two ballots' negative pairwise matrices are added up.[[File:Pairwise counting negative counting with ranked ballot GIF.gif|thumb|454x454px|GIF for negative counting. Click on the image and then the thumbnail of the image to see the animation.]]]]
The negative counting approach is an alternative method of doing [[pairwise counting]]. It is faster (i.e. requires less marks and tallying), depending on implementation, when voters rank multiple candidates last. Rather than counting a voter's preference for a candidate they ranked (i.e. over lower-ranked candidates), it counts that voter's '''lack''' of preference for that candidate (i.e. over the candidate themselves and higher-ranked candidates). In other words, negative pairwise counting a) treats a voter as having "approved" all of the candidates they ranked above last-place, b) counts the voter's pairwise preferences only among the candidates they ranked"approved", and c) aggregates those two pieces of information for all voters (such that for each candidate, you have the total number of voters who "approved" them along with the relevant pairwise preferences), and then calculates the final pairwise totals using the aggregated information.
 
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.
Cookies help us deliver our services. By using our services, you agree to our use of cookies.