Condorcet method: Difference between revisions

wikitable
(→‎Demonstrating pairwise counting: How about a gallery instead?)
(wikitable)
Line 22:
A frequent implementation of this method will illustrate the basic counting method. Consider an election between A, B, and C, and a ballot (B, C, A, D). That is, a ballot ranking B first, C second, A third, and D forth. This can be represented as a matrix, where the row is the runner under consideration, and the column is the opponent. The cell at (runner,opponent) has a one if runner is preferred, and a zero if not.
 
{| class="wikitable" border="1"
! !! A !! B !! C !! D
|-
! A
! A || — || 0 || 0 || 1
|-
! B
! B || 1 || — || 1 || 1
|-
! C
! C || 1 || 0 || — || 1
|-
! D
! D || 0 || 0 || 0 || —
|}