Round-robin voting

Round-robin, paired 'comparison, or tournament voting methods, are a set of ranked voting systems that choose winners by comparing every pair of candidates one-on-one, similar to a round-robin tournament. In each paired matchup, the total number of voters who prefer each candidate is recorded in a beats matrix'. Then, a majority-preferred candidate is elected, if one exists. Otherwise, if there is a cyclic tie, the candidate "closest" to being a Condorcet winner is elected, based on the recorded beats matrix. How "closest" is defined varies by method.
Round-robin methods are one of the four major categories of single-winner electoral methods, along with multi-stage methods, positional methods, and graded methods.
Most, but not all, election methods meeting the Condorcet criterion are based on pairwise counting.

Summary

In paired voting, each voter ranks candidates from first to last. For each pair of candidates, we count how many votes rank each candidate over the other.

Pairwise counting

Pairwise counts are often displayed in a pairwise comparison or outranking matrix such as those below. In these matrices, each row represents each candidate as a 'runner', while each column represents each candidate as an 'opponent'. The cells at the intersection of rows and columns each show the result of a particular pairwise comparison. Cells comparing a candidate to themselves are left blank.
Imagine there is an election between four candidates:,, and. The first matrix below records the preferences expressed on a single ballot paper, in which the voter's preferences are ; that is, the voter ranked first, second, third, and fourth. In the matrix a '1' indicates that the runner is preferred over the opponent, while a '0' indicates that the opponent is preferred over the runner.


—	0	0	1
1	—	1	1
1	0	—	1
0	0	0	—

In this matrix the number in each cell indicates either the number of votes for runner over opponent or the number of votes for opponent over runner.
If pairwise counting is used in an election that has three candidates named,, and, the following pairwise counts are produced:

If the number of voters who have no preference between two candidates is not supplied, it can be calculated using the supplied numbers. Specifically, start with the total number of voters in the election, then subtract the number of voters who prefer the first over the second, and then subtract the number of voters who prefer the second over the first.
The pairwise comparison matrix for these comparisons is shown below.

A candidate cannot be pairwise compared to itself, so the cell that indicates this comparison is either empty or contains a 0.
Each ballot can be transformed into this style of matrix, and then added to all other ballot matrices using matrix addition. The resulting sum of all ballots in an election is called the sum matrix, and it summarizes all the voter preferences.
An election counting method can use the sum matrix to identify the winner of the election.
Suppose that this imaginary election has two additional voters, and their preferences are and. Added to the first voter, these ballots yield the following sum matrix:


—	2	2	2
1	—	1	2
1	2	—	2
1	1	1	—

In the sum matrix above, is the Condorcet winner, because they beat every other candidate one-on-one. When there is no Condorcet winner, ranked-robin methods such as ranked pairs use the information contained in the sum matrix to choose a winner.
The first matrix above, which represents a single ballot, is inversely symmetric: is ¬. Or. The sum matrix has the property: for voters, if all runners are fully ranked by each voter.

Number of pairwise comparisons

For candidates, there are pairwise matchups, assuming it is necessary to keep track of tied ranks. When working with margins, only half of these are necessary because storing both candidates' percentages becomes redundant. For example, for 3 candidates there are 6 pairwise comparisons, for 4 candidates there are 12 pairwise comparisons, and for 5 candidates there are 20 pairwise comparisons.

Example

These ranked preferences indicate which candidates the voter prefers. For example, the voters in the first column prefer Memphis as their 1st choice, Nashville as their 2nd choice, etc. As these ballot preferences are converted into pairwise counts they can be entered into a table.
The following square-grid table displays the candidates in the same order in which they appear above.

	... over Memphis	... over Nashville	... over Chattanooga	... over Knoxville
Prefer Memphis...	-	42%	42%	42%
Prefer Nashville...	58%	-	68%	68%
Prefer Chattanooga...	58%	32%	-	83%
Prefer Knoxville...	58%	32%	17%	-

The following tally table shows another table arrangement with the same numbers.