Editing Condorcet method (section)

===Finding the winner===

The count is conducted by pitting every candidate against every other candidate in a series of hypothetical one-on-one contests. The winner of each pairing is the candidate preferred by a majority of voters. Unless they tie, there is always a majority when there are only two choices. The candidate preferred by each voter is taken to be the one in the pair that the voter ranks (or rates) higher on their ballot paper. For example, if Alice is paired against Bob it is necessary to count both the number of voters who have ranked Alice higher than Bob, and the number who have ranked Bob higher than Alice. If Alice is preferred by more voters then she is the winner of that pairing. When all possible pairings of candidates have been considered, if one candidate beats every other candidate in these contests then they are declared the Condorcet winner. As noted above, if there is no Condorcet winner a further method must be used to find the winner of the election, and this mechanism varies from one Condorcet consistent method to another.<ref name=":2" /> In any Condorcet method that passes [[Independence of Smith-dominated alternatives]], it can sometimes help to identify the [[Smith set]] from the head-to-head matchups, and eliminate all candidates not in the set before doing the procedure for that Condorcet method.