Pairwise counting: Difference between revisions
→Notes
No edit summary |
(→Notes) |
||
Line 338:
==Notes==
[[File:Pairwise counting procedure.png|thumb|The procedure for pairwise counting with various ballot formats and examples.]]
{| class="wikitable"
!
!A
!B
!C
!D
!E
|-
|A
| ---
|2
|2
|'''2'''
|2
|-
|B
|0
| ---
|2
|2
|2
|-
|C
|0
|0
| ---
|2
|2
|-
|D
|''<u>0</u>''
|0
|0
| ---
|0
|-
|E
|0
|0
|0
|0
| ---
|}Try locating A>D (the fifth cell in the second row). To find the reverse, D>A, first you check and see that you have to go one cell down and to the left to be adjacent to the middle dividing line. Then, starting from the cell one cell down and to the left of the middle dividing line, go one cell further down and to the left to reach D>A. In doing this, you would start at A>D, go down to B>C, then jumping over the middle dividing line to C>B, go down to D>A.
Multi-winner methods that use pairwise counting, such as [[CPO-STV]] and [[Schulze STV]], instead of doing pairwise matchups between individual candidates, do pairwise matchups between sets of candidates (called winner sets).
One of the notable aspects of pairwise counting is that it can be used to find a Condorcet winner or member of the Smith set in a simple manner without needing to be done with written ballots; see [[:Category:Sequential comparison Condorcet methods]] for more information.{{reflist|group=nb}}
| |||