Pairwise counting: Difference between revisions

Content added Content deleted
(Move inserted "prefix" text into it's own heading. By convention the Tennessee example appears first.)
(Moved huge image to the section it relates to)
Line 1: Line 1:
[[File:Pairwise counting procedure.png|thumb|The procedure for pairwise counting with various ballot formats and examples.]]
'''Pairwise counting''' is the process of considering a set of items, comparing one pair of items at a time, and for each pair counting the comparison results.
'''Pairwise counting''' is the process of considering a set of items, comparing one pair of items at a time, and for each pair counting the comparison results.


Line 298: Line 297:


- The '''weak Condorcet winners''' and '''weak Condorcet losers''' are candidates for whom all of their cells are shaded either green (for the weak Condorcet winners) or red (for the weak Condorcet losers) or the color for pairwise ties.
- The '''weak Condorcet winners''' and '''weak Condorcet losers''' are candidates for whom all of their cells are shaded either green (for the weak Condorcet winners) or red (for the weak Condorcet losers) or the color for pairwise ties.




== Cardinal methods ==
== Cardinal methods ==
[[File:Pairwise counting procedure.png|thumb|The procedure for pairwise counting with various ballot formats and examples.]]
[[File:Pairwise relations Score.png|thumb|Pairwise matchups done using Score voting to indicate strength of preference in each matchup.]]
[[File:Pairwise relations Score.png|thumb|Pairwise matchups done using Score voting to indicate strength of preference in each matchup.]]
See the [[Order theory#Strength of preference]] article for more information. Essentially, instead of doing a pairwise matchup on the basis that a voter must give one vote to either candidate in the matchup or none whatsoever, a voter could be allowed to give something in between (a partial vote) or even one vote to both candidates in the matchup (which has the same effect on deciding which of them wins the matchup as giving neither of them a vote, as it does not help one of them get more votes than the other).
See the [[Order theory#Strength of preference]] article for more information. Essentially, instead of doing a pairwise matchup on the basis that a voter must give one vote to either candidate in the matchup or none whatsoever, a voter could be allowed to give something in between (a partial vote) or even one vote to both candidates in the matchup (which has the same effect on deciding which of them wins the matchup as giving neither of them a vote, as it does not help one of them get more votes than the other).