© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 14 Voting and Apportionment.

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
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.
Social Choice: The Impossible Dream Michelle Blessing February 23, 2010 Michelle Blessing February 23, 2010.
Excursions in Modern Mathematics Sixth Edition
MAT 105 Spring  As we have discussed, when there are only two candidates in an election, deciding the winner is easy  May’s Theorem states that.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
1 The Mathematics of Voting
Group-Ranking How is group ranking accomplished?.
Voting and Math Kelsey, Ashleigh, Alex, Nick, Justin MAT 142 Final Project.
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.
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 11.2, Slide 1 11 Voting Using Mathematics to Make Choices.
MAT 105 Spring  We have studied the plurality and Condorcet methods so far  In this method, once again voters will be allowed to express their.
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 10: The Manipulability of Voting Systems Lesson Plan An Introduction to Manipulability Majority Rule and Condorcet’s Method The Manipulability.
Voting and Apportionment. The spirit club at Lakeview High School is voting for President, Vice President, and Treasurer. Their Choices are Ken Walters.
Chapter 12 sec 1. Def. Each person votes for his or her favorite candidate. The candidate receiving the most votes is declared the winner.
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.
Let’s take a class vote. How many of you are registered to vote?
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.
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.
American Government and Organization PS1301 Tuesday, 2 November.
Excursions in Modern Mathematics, 7e: 1.Conclusion - 2Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting CONCLUSION Elections, Fairness,
Fairness Criteria Fairness Criteria: properties we expect a good voting system to satisfy.Fairness Criteria: properties we expect a good voting system.
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.
Voting: Does the Majority Always Rule?
Voting and Apportionment
Voting and Apportionment
Plurality and Borda Count Method
Plurality with elimination, Runoff method, Condorcet criterion
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
1.3 The Borda Count Method.
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)
5-2 Election Theory Flaws of Voting.
Voting systems Chi-Kwong Li.
Voting Preference Ballots and Preference Schedules
Plurality with Elimination
Voting Methods Introduction.
Quiz – 1/24 - Friday How many people voted in the election?
Section 14.1 Voting Methods.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 14 Voting and Apportionment

© 2010 Pearson Prentice Hall. All rights reserved Voting Methods

© 2010 Pearson Prentice Hall. All rights reserved. 3 Objective 1.Understand and use preference tables. 2.Use the plurality method to determine an election’s winner. 3.Use the Borda count method to determine an election’s winner. 4.Use the plurality-with-elimination method to determine an election’s winner. 5.Use the pairwise comparison method to determine an election’s winner.

© 2010 Pearson Prentice Hall. All rights reserved. 4 Preference Tables Preference ballots are ballots in which a voter is asked to rank all the candidates in order of preference. Example: Four candidates are running for president of the Student Film Institute: Paul (P), Rita (R), Sarah (S), and Tim (T). Each of the club’s members submits a secret ballot indicating his or her first, second, third, and fourth choice for president. The 37 ballots are shown to the right.

© 2010 Pearson Prentice Hall. All rights reserved. 5 A preference table shows how often each particular outcome occurred. Example: Preference Tables The election ballots are placed into identical stacks. Then the identical stacks are placed into a preference table.

© 2010 Pearson Prentice Hall. All rights reserved. 6 How many people selected Donna (D) as their first choice? Solution: We find the number of people who voted for D as their first choice by reading across the row that says First Choice. When you see a D in this row, write the number above it. Then find the sum of the numbers: = 220 Thus, 220 people selected Donna as their first choice. Example 1: Understanding a Preference Table

© 2010 Pearson Prentice Hall. All rights reserved. 7 The Plurality Method The candidate (or candidates, if there is more than one) with the most first-place votes is the winner. Example: For the previous preference table, who is declared the winner using the plurality method? Solution: The candidate with the most first-place votes is the winner. When using the preference table, we only need to look at the row indicating the number of first-choice votes. Thus, P (Paul) is the winner and the new president of the Student Film Institute.

© 2010 Pearson Prentice Hall. All rights reserved. 8 The Borda Count Method Each voter ranks the candidates from the most favorable to the least favorable. 1.Each last-place vote is given 1 point, each next- to-last-place vote is given 2 points, each third- from-last-place vote is given 3 points, and so on. 2.The points are totaled for each candidate separately. 3.The candidate with the most points is the winner.

© 2010 Pearson Prentice Hall. All rights reserved. 9 Example: In the previous table, who is the winner using the Borda method? Solution: Because there are four candidates, a first-place vote is worth 4 points, a second place vote is worth 3 points, a third-place vote is worth 2 points, and a fourth-place vote is worth 1 point. Example 3: Using the Borda Count Method Number of Votes First Choice: 4 pts P: 14  4=56S: 10  4=40T: 8  4=32R: 4  4=16S: 1  4=4 Second Choice: 3 pts R: 14  3=42R: 10  3=30S: 8  3=24T: 4  3=12T: 1  3=3 Third Choice: 2 pts S: 14  2=28T: 10  2=20R: 8  2=16S: 4  2=8R: 1  2=2 Fourth Choice: 1 pt T: 14  1=14P: 10  1=10P: 8  1=8P: 4  1=4P: 1  1=1

© 2010 Pearson Prentice Hall. All rights reserved. 10 Now, we read down each column and total the points for each candidate separately: P: = 79 points R: = 106 points S: = 104 points T: = 81 points Because Rita (R) has received the most points, she is the winner and the new president of the Student Film Institute. Example 3: Using the Borda Count Method

© 2010 Pearson Prentice Hall. All rights reserved. 11 The Plurality-with-Elimination Method The candidate with the majority of first-place votes is the winner. If no candidate receives a majority of first-place votes, eliminate the candidate (candidates, if there is a tie) with the fewest first-place votes from the preference table. Move the candidates in each column below each eliminated candidate up one place. The candidate with the majority of first-place votes in the new preference table is the winner. If no candidate receives a majority of first-place votes, repeat this process until a candidate receives a majority.

© 2010 Pearson Prentice Hall. All rights reserved. 12 Example: In the previous table, who is declared the winner using the plurality-with-elimination method? Example 4: Using the Plurality-with-Elimination Method Number of Votes First ChoicePSTRS Second ChoiceRRSTT Third ChoiceSTRSR Fourth ChoiceTPPPP Solution: Recall that there are 37 people voting. In order to receive a majority, a candidate must receive more than 50% of the first-place votes, i.e., meaning 19 or more votes.

© 2010 Pearson Prentice Hall. All rights reserved. 13 The number of first-place votes for each candidate is P(Paul) = 14 S(Sarah) = = 11 T(Tim) = 8 R(Rita) = 4 We see that no candidate receives a majority of first-place votes. Because Rita received the fewest first-place votes, she is eliminated in the first round. The new preference table is So, the number of first-place votes for each candidate is P(Paul) = 14 S(Sarah) = = 11 T(Tim) = = 12. Number of Votes First ChoicePSTTS Second ChoiceSTSST Third ChoiceTPPPP Example 4: Using the Plurality-with-Elimination Method

© 2010 Pearson Prentice Hall. All rights reserved. 14 Once again, no candidate receives a majority first-place votes. Because Sarah received the fewest first-place votes, she is eliminated from the second round. The new preference table is The number of first-place votes for each candidate is now P(Paul) = 14 T(Tim) = = 23. Because T(Tim) has received the majority of first-place votes, i.e., Tim received more than 19 votes, he is the winner and the new president of the Student Film Institute. Number of Votes First ChoicePTTTT Second ChoiceTPPPP Example 4: Using the Plurality-with-Elimination Method

© 2010 Pearson Prentice Hall. All rights reserved. 15 The Pairwise Comparison Method Using the pairwise comparison method, every candidate is compared one-on-one with every other candidate. The number of comparisons made using the pairwise comparison method is given by where n is the number of candidates, and C is the number of comparisons that must be made.

© 2010 Pearson Prentice Hall. All rights reserved. 16 Voters rank all the candidates and the results are summarized in a preference table. The table is used to make a series of comparisons in which each candidate is compared to each of the other candidates. For each pair of candidates, X and Y, use the table to determine how many voters prefer X to Y and vice versa. If a majority prefer X to Y, then X receives 1 point. If a majority prefers Y to X, then Y receives 1 point. If the candidates tie, then each receives half a point. After all comparisons have been made, the candidate receiving the most points is the winner. The Pairwise Comparison Method

© 2010 Pearson Prentice Hall. All rights reserved. 17 For the previous table, who is declared the winner using the pairwise comparison method? Solution: We first find how many comparisons that must be made. Since there are 4 candidates, then n=4 and Example 5: Using the Pairwise Comparison Method Number of Votes First ChoicePSTRS Second ChoiceRRSTT Third ChoiceSTRSR Fourth ChoiceTPPPP

© 2010 Pearson Prentice Hall. All rights reserved. 18 With P, R, S, T, the comparisons are P vs. R, P vs. S, P vs. T, R vs. S, R vs. T, and S vs. T. Example 5: Using the Pairwise Comparison Method

© 2010 Pearson Prentice Hall. All rights reserved. 19 Using the six comparisons and conclusion to add points we get P: no points S: = 3 points R: = 2 points T: 1 point After all the comparisons have been made, the candidate receiving the most points is S(Sarah). Sarah is the winner and new president of the Student Film Institute. Example 5: Using the Pairwise Comparison Method

© 2010 Pearson Prentice Hall. All rights reserved. Homework Pg 777 – 778, #1 – 6, 8, 9, 12, 13, 16, 17, 21, 22, 24, 25, 27 – 30.