Section 14.1 Voting Methods.

Slides:



Advertisements
Similar presentations
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
Advertisements

Voting Methods Continued
Chapter 1: Methods of Voting
Mathematics The study of symbols, shapes, algorithms, sets, and patterns, using logical reasoning and quantitative calculation. Quantitative Reasoning:
VOTING SYSTEMS Section 2.5.
MAT 105 Spring  There are many more methods for determining the winner of an election with more than two candidates  We will only discuss a few.
Excursions in Modern Mathematics Sixth Edition
1 The Mathematics of Voting
Voting Review Material
CRITERIA FOR A FAIR ELECTION
How is this math? Mathematics is essentially the application of deductive reasoning to the study relations among patterns, structures, shapes, forms and.
Group Decision Making Y. İlker TOPCU, Ph.D twitter.com/yitopcu.
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 11.2, Slide 1 11 Voting Using Mathematics to Make Choices.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting The Paradoxes of Democracy Vote! In.
Slide 15-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
Copyright © 2009 Pearson Education, Inc. Chapter 15 Section 2 - Slide Election Theory Flaws of Voting.
May 19, 2010Math 132: Foundations of Mathematics 12.5 Homework Solutions 27. (a) 28. (b) 29. (d) 30. (e) 53. Positive Correlation, Weak 54. Negative Correlation,
Ch Voting Preference tables E, F, G, and H are running for math club president If everyone is asked to rank their preferences, how many different.
Election Procedures Taskforce suggestions. Guiding principles The most democratic systems The systems must allow for a majority Simplicity Proportionality.
The Mathematics of Voting Chapter 1. Voting theory: application of methods that affect the outcome of an election. Sec 1: Preference Ballots and Schedules.
Chapter 12 sec 1. Def. Each person votes for his or her favorite candidate. The candidate receiving the most votes is declared the winner.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 14 Voting and Apportionment.
Chapter 15 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
Voting Methods Examples of Voting Methods (other than majority rules) –Plurality –Borda Count –Hare System –Sequential Pairwise –Approval Voting.
1.4 The Plurality-with Elimination Method
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 11.1, Slide 1 11 Voting Using Mathematics to Make Choices.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods.
Voting Tie Breakers. With each method described – plurality method, Borda count method, plurality with elimination method, and pairwise comparison method.
1.6 Rankings. Sometimes, we are not just interested in the first place winner of the election, but also want to know who comes in second, third … There.
Why We Should Use the Plurality with Elimination Voting Method.
Copyright © 2009 Pearson Education, Inc. Chapter 15 Section 1 - Slide Election Theory Voting Methods.
Warm-Up Rank the following soft drinks according to your preference (1 being the soft drink you like best and 4 being the one you like least)  Dr. Pepper.
Voting Methods Introduction.
The Mathematics of Voting Chapter 1. Preference Ballot A Ballot in which the voters are asked to rank the candidates in order of preference. 1. Brownies.
© 2010 Pearson Prentice Hall. All rights reserved Flaws of Voting Methods.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.2 Flaws of Voting.
14.2 Homework Solutions Plurality: Musical play Borda count: Classical play Plurality-with-elimination: Classical play Pairwise Comparison: Classical play.
The mathematics of voting The paradoxes of democracy.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan Voting and Social Choice Majority Rule and Condorcet’s Method Other Voting Systems for Three.
My guy lost? What’s up with that….  In the 1950’s, Kenneth Arrow, a mathematical economist, proved that a method for determining election results that.
1.
Voting: Does the Majority Always Rule?
Voting and Apportionment
Voting and Apportionment
Plurality and Borda Count Method
1 The Mathematics of Voting
Plurality with elimination, Runoff method, Condorcet criterion
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
8.2 Voting Possibilities and Fairness Criteria
1.3 The Borda Count Method.
Lecture 1: Voting and Election Math
Let’s say we have a town of 10,000 people electing a mayor using the Plurality with Elimination Voting Method. There are 4 candidates, candidate A, candidate.
Homework (day 2): p , 4, 6, 10, 12ab, 16, 18abc, 24, 26
Warm Up – 1/23 - Thursday How many people voted in the election?
Social Choice Theory [Election Theory]
Classwork: p.33 (27abc run off, 29ab run off, 31, 33ab run off)
Section 15.2 Flaws of Voting
5-2 Election Theory Flaws of Voting.
Voting systems Chi-Kwong Li.
Voting Preference Ballots and Preference Schedules
Plurality with Elimination
MAT 105 Fall 2008 More Voting Methods.
p.33 (28 run off, 30 run off, 32, 34ab run off)
Voting Methods Introduction.
Quiz – 1/24 - Friday How many people voted in the election?
Homework (day 1): p , 4, 6, 10, 12ab, 16, 18abc, 24, 26
Flaws of the Voting Methods
Presentation transcript:

Section 14.1 Voting Methods

What You Will Learn Upon completion of this section, you will be able to: Use the plurality method to determine the winner of an election. Use the Borda count method to determine the winner of an election. Use the plurality with elimination method to determine the winner of an election. Use the pairwise comparison method to determine the winner of an election. Understand tie-breaking procedures for an election.

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. The resulting preference table for this election is given in the table on the next slide.

Example 2: Voting for the Honor Society President

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 C as their first choice?

Example 2: Voting for the Honor Society President Solution a) Add numbers in row labeled Number of Votes 19 + 15 + 11 + 7 + 2 = 54

Example 2: Voting for the Honor Society President Solution b) From the 2nd column, 15 voted in the given order.

Example 2: Voting for the Honor Society President Solution c) Read across row that says First, find C, and read number above it. Add those: 15 + 2 = 17.

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.

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?

Example 4: Electing the Honor Society President by the Plurality Method Solution Antoine: 7; Betty: 19; Don: 11; Camille: 15 + 2 = 17 Betty is elected president. She received 19/54 = 35% of the 1st place votes; not a majority.

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.

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). For convenience, the preference table is reproduced on the next slide.

Example 6: Electing the Honor Society President Using the Borda Count Method 1st place worth 4, 2nd place worth 3, 3rd place worth 2, 4th place worth 1

Example 6: Electing the Honor Society President Using the Borda Count Method Solution Antoine: 7 - 1st; 7 × 4 = 28 34 - 2nd; 34 × 3 = 102 13 - 3rd; 13 × 2 = 26 Total 156

Example 6: Electing the Honor Society President Using the Borda Count Method Solution Betty: 19 - 1st; 19 × 4 = 76 35 - 4th; 35 × 1 = 35 Total 111

Example 6: Electing the Honor Society President Using the Borda Count Method Solution Camille: 17 - 1st; 17 × 4 = 68 11 - 2nd; 11 × 3 = 33 26 - 3rd; 26 × 2 = 52 Total 153

Example 6: Electing the Honor Society President Using the Borda Count Method Solution Don: 11 - 1st; 11 × 4 = 44 9 - 2nd; 9 × 3 = 27 15 - 3rd; 15 × 2 = 30 19 – 4th; 19 × 1 = 19 Total 120

Example 6: Electing the Honor Society President Using the Borda Count Method Solution Antoine, with 156 points, receives the most points using the Borda count method and is declared the winner.

Plurality with Elimination Each voter votes for one candidate. If a candidate receives a majority of votes, that candidate is declared the winner.

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.

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. The preference table is shown on the next slide. Recall that A represents Antoine, B represents Betty, C represents Camille, and D represents Don.

Example 8: Electing the Honor Society President Using the Plurality with Elimination Method

Example 8: Electing the Honor Society President Using the Plurality with Elimination Method Solution 1st place votes: Antoine: 7, Betty:19, Camille: 17, Don: 11

Example 8: Electing the Honor Society President Using the Plurality with Elimination Method Solution Total of 54 votes. No one has majority. Antoine is eliminated. We assume all voters rank their preferences the same. Column 1, 19 voters ranked the four as B, A, C, D; now it is B, C, D. Column 2 was C, A, D, B; now it is C, D, B.

Example 8: Electing the Honor Society President Using the Plurality with Elimination Method Solution Column 3 was D, C, A, B; now it is D, C, B. Column 4 was A, D, C, B; now it is D, C, B. Column 5 was C, D, A, B; now it is C, D, B.

Example 8: Electing the Honor Society President Using the Plurality with Elimination Method Solution The new preference table is:

Example 8: Electing the Honor Society President Using the Plurality with Elimination Method Solution 1st place votes: Betty: 19, Camille: 17, Don: 18

Example 8: Electing the Honor Society President Using the Plurality with Elimination Method Solution No one has majority. Camille is eliminated. New preference table is:

Example 8: Electing the Honor Society President Using the Plurality with Elimination Method Solution 1st place votes: Betty: 19, Don: 35

Example 8: Electing the Honor Society President Using the Plurality with Elimination Method Solution Don has a majority of first-place votes and is declared the winner using the plurality with elimination method.

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.

Pairwise Comparison Method After making all comparisons among the candidates, the candidate receiving the most points is declared the winner.

Number of Comparison The number of comparisons, c, needed when using the pairwise comparison method when there are n candidates is

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.

Example 10: Electing the Honor Society President Using the Pairwise Comparison Method Solution Antoine, Betty, Camille, Don

Example 10: Electing the Honor Society President Using the Pairwise Comparison Method Solution 4 candidates, n = 4, the number of comparisons needed is The 6 comparisons are A versus B, A versus C, A versus D, B versus C, B versus D, and C versus D.

Example 10: Electing the Honor Society President Using the Pairwise Comparison Method Solution 1. The pairwise comparison of Antoine versus Betty is Antoine: 15 + 11 + 7 + 2 = 35 votes Betty: 19 votes Antoine wins this comparison and is awarded 1 point.

Example 10: Electing the Honor Society President Using the Pairwise Comparison Method Solution 2. The pairwise comparison of Antoine versus Camille is Antoine: 19 + 7 = 26 votes Camille: 15 + 11 + 2 = 28 votes Camille wins this comparison and is awarded 1 point.

Example 10: Electing the Honor Society President Using the Pairwise Comparison Method Solution 3. The pairwise comparison of Antoine versus Don is Antoine: 19 + 15 + 7 = 41 votes Don: 11 + 2 = 13 votes Antoine wins this comparison and is awarded a second point.

Example 10: Electing the Honor Society President Using the Pairwise Comparison Method Solution 4. The pairwise comparison of Betty versus Camille is Betty: 19 votes Camille: 15 + 11 + 7 + 2 = 35 votes Camille wins this comparison and is awarded a second point.

Example 10: Electing the Honor Society President Using the Pairwise Comparison Method Solution 5. The pairwise comparison of Betty versus Don is Betty: 19 votes Don: 15 + 11 + 7 + 2 = 35 votes Don wins this comparison and is awarded 1 point.

Example 10: Electing the Honor Society President Using the Pairwise Comparison Method Solution 6. The pairwise comparison of Camille versus Don is Camille: 19 + 15 + 2 = 36 votes Don: 11 + 7 = 18 votes Camille wins this comparison and is awarded a third point.

Example 10: Electing the Honor Society President Using the Pairwise Comparison Method Solution Antoine received 2 points, Betty received 0 points, Camille received 3 points, and Don received 1 point. Since Camille received 3 points, the most points from the pairwise comparison method, Camille wins the election.

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 1st place votes.

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.