Condorcet MethodWe continue with the same table: Preference Schedule
The Condorcet method is the final method for computing the winner. First, for each pair of candidates determine which candidate is preferred by the most voters. For example, here is a comparison between Samuel Adams and Guinness (the number of supporters in the first row represents the number of voters who prefer Samuel Adams to Guinness, and vice-versa for the second row):
Winner for this pair is Samuel Adams If there is a candidate who 'wins' EVERY comparison with all other candidates, then this candidate is the winner. If there is no such candidate, then there is no Condorcet winner. Note: you can define a "winning" candidate as that candidate having a number of preferential votes which is greater than or equal to the number of preferential votes of all other candidates when the candidates are compared pairwise. There isn't always a Condorcet winner. If no candidate satisfies this condition for winning, then there is no Condorcet winner.
Practice Using the Condorcet method, which beer would win under the above preference schedule? Do not forget to press "Enter".
Click here if you need an explanation for the example above.
|