Section 15.1 Voting Methods
INB Table of Contents Date Topic Page # February 24, 2014 Test #3 Practice Test 38 February 24, 2014 Test #3 Practice Test Workspace 39 March 10, 2014 Test #3 40 March 10, 2014 Test #3 Corrections 41 March 10, 2014 Section 15.1 Examples 42 March 10, 2014 Section 15.1 Notes 43 March 10, 2014 Section 15.2 Examples 44 March 10, 2014 Section 15.2 Notes 45 2.3-2
What You Will Learn Plurality Method Borda Count Method Plurality with Elimination Pairwise Comparison Method Tie Breaking 15.1-3
Example 2: Voting for the Honor Society President Four students are running for president of the Honor Society: Antoine (A), Betty (B), Camille (C), and Don (D). The club members were asked to rank all candidates. 15.1-4
Example 2: Voting for the Honor Society President a) How many students voted in the election? b) How many students selected the candidates in this order: C, A, D, B? c) How many students selected A as their first choice? 15.1-6
Plurality Method This is the most commonly used method, and it is the easiest method to use when there are more than two candidates. Each voter votes for one candidate. The candidate receiving the most votes is declared the winner. 15.1-10
Example 4: Electing the Honor Society President by the Plurality Method Consider the Honor Society election given in Example 2. Who is elected president using the plurality method? 15.1-11
Borda Count Method Voters rank candidates from the most favorable to the least favorable. Each last-place vote is awarded one point, each next-to-last-place vote is awarded two points, each third-from-last-place vote is awarded three points, and so forth. The candidate receiving the most points is the winner of the election. 15.1-13
Example 6: Electing the Honor Society President Using the Borda Count Method Use the Borda count method to determine the winner of the election for president of the Honor Society discussed in Example 2. Recall that the candidates are Antoine (A), Betty (B), Camille (C), and Don (D). 15.1-14
Plurality with Elimination Each voter votes for one candidate. If a candidate receives a majority of votes, that candidate is declared the winner. 15.1-21
Plurality with Elimination If no candidate receives a majority, eliminate the candidate with the fewest votes and hold another election. (If there is a tie for the fewest votes, eliminate all candidates tied for the fewest votes.) Repeat this process until a candidate receives a majority. 15.1-22
Example 8: Electing the Honor Society President Using the Plurality with Elimination Method Use the plurality with elimination method to determine the winner of the election for president of the Honor Society from Example 2. 15.1-23
Pairwise Comparison Method Voters rank the candidates. A series of comparisons in which each candidate is compared with each of the other candidates follows. If candidate A is preferred to candidate B, A receives one point. If candidate B is preferred to candidate A, B receives 1 point. If the candidates tie, each receives ½ point. 15.1-33
Pairwise Comparison Method After making all comparisons among the candidates, the candidate receiving the most points is declared the winner. 15.1-34
Number of Comparison The number of comparisons, c, needed when using the pairwise comparison method when there are n candidates is c = n(n 1) 2 15.1-35
Example 10: Electing the Honor Society President Using the Pairwise Comparison Method Use the pairwise comparison method to determine the winner of the election for president of the Honor Society that was originally discussed in Example 2. 15.1-36
Tie Breaking Breaking a tie can be achieved by either making an arbitrary choice, such as flipping a coin, or by bringing in an additional voter. Robert s Rule of Order: president of group votes only to break a tie or create a tie. Borda method: could choose person with most 1 st place votes. 15.1-46
Tie Breaking Pairwise comparison method: could choose the winner of a one-to-one comparison between the two candidates involved in the tie. Different tie-breaking methods could produce different winners. To remain fair, the method should be chosen in advance. 15.1-47
Section 15.2 Flaws of Voting
What You Will Learn Fairness Criteria Majority Criterion Head-to-Head Criterion Monotonicity Criterion Irrelevant Alternative Criterion 15.2-49
Fairness Criteria Mathematicians and political scientists have agreed that a voting method should meet the following four criteria in order for the voting method to be considered fair. Majority Criterion Head-to-head Criterion Monotonicity Criterion Irrelevant Alternatives Criterion 15.2-50
Majority Criterion If a candidate receives a majority (more than 50%) of the first-place votes, that candidate should be declared the winner. 15.2-51
Head-to-Head Criterion If a candidate is favored when compared head-to-head with every other candidate, that candidate should be declared the winner. 15.2-52
Monotonicity Criterion A candidate who wins a first election and then gains additional support without losing any of the original support should also win a second election. 15.2-53
Irrelevant Alternatives Criterion If a candidate is declared the winner of an election and in a second election one or more of the other candidates is removed, the previous winner should still be declared the winner. 15.2-54
Summary of the Voting Methods and Whether They Satisfy the Fairness Criteria Criteria Method Plurality Borda count Plurality with elimination Pairwise comparison Majority Always satisfies May not satisfy Always satisfies Always satisfies Head-tohead May not satisfy May not satisfy May not satisfy Always satisfies Monotonicity Always satisfies May not satisfy May not satisfy May not satisfy Irrelevant alternatives May not satisfy May not satisfy May not satisfy May not satisfy 15.2-55
Arrow s Impossibility Theorem It is mathematically impossible for any democratic voting method to simultaneously satisfy each of the fairness criteria: The majority criterion The head-to-head criterion The monotonicity criterion The irrevelant alternative criterion 15.2-56