Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Suggestion from a Math 105 student (8/31/11): Hold a knockout tournament between candidates. This satises the Condorcet Criterion! A Condorcet candidate will win all his/her matches, and therefore win the tournament. (Better yet, seeding doesnt matter!) But, if there is no Condorcet candidate, then its not clear what will happen. Using preference ballots, we can actually hold a round-robin tournament instead of a knockout.
Compare each two candidates head-to-head. Award each candidate one point for each head-to-head victory. The candidate with the most points wins.
Number of Voters 1st choice 2nd choice 3rd choice 4th choice
14 A B C D
10 C B D A
8 D C B A
4 B D C A
1 C D B A
Compare C to D: 14+10+1 = 25 voters prefer C. 8+4 = 12 voters prefer D. C wins the pairwise comparison and gets 1 point.
Number of Voters 1st choice 2nd choice 3rd choice 4th choice
14 A B C D
10 C B D A
8 D C B A
4 B D C A
1 C D B A
Compare A to C. . . A to D. . . B to C. . . B to D. . .
Wins
Losses
Wins
Wins
Losses
Wins
Losses
Wins
Losses
A B A B C D E
C D E
N 2 squares in crosstable N squares on the main diagonal dont count Other squares all come in pairs
Number of comparisons =
N2 N 2
N(N 1) 2
Be Careful!
Number of pairwise comparisons with N candidates: N (N 1) . 2 Number of points on a Borda count ballot with N candidates: N (N + 1) . 2 (To remember which is which, work out a small example, like N = 3.)
Problem #2 (the rock-paper-scissors problem): Ties are very common under the Method of Pairwise Comparisons.
6 C A B
A B B C C A
The Method of Pairwise Comparisons results in a three-way tie. Under any other system we have discussed, C would win.
Maj Plurality Borda Count PWE Pairwise Comparisons Yes No Yes Yes
Cond No No No Yes
9 A C D B
11 B A C D
D C D B A C C D B A B A
9 A C D B
11 B A C D
D C D B A C C D B A B A
Maj = Majority; Cond = Condorcet; PE = Public-Enemy; Mono = Monotonicity; IIA = Independence of Irrelevant Alternatives