Voting Methods Examples of Voting Methods (other than majority rules) –Plurality –Borda Count –Hare System –Sequential Pairwise –Approval Voting.

Slides:



Advertisements
Similar presentations
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Advertisements

Which units are you most interested in covering? Unit A –Management Science Unit B – Growth Unit C – Shape and Form Unit D – Statistics.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
Voting Methods Continued
Presented by: Katherine Goulde
IMPOSSIBILITY AND MANIPULABILITY Section 9.3 and Chapter 10.
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.
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.
1.1, 1.2 Ballots and Plurality Method
What is your favorite food?. Preference Schedule A Preference Schedule is a way to represent the order in which people like (prefer) certain items. The.
Group-Ranking How is group ranking accomplished?.
Voting Review Material
Fair Elections Are they possible?. Acknowledgment Many of the examples are taken from Excursions in Modern Mathematics by Peter Tannenbaum and Robert.
Social Choice Topics to be covered:
Math for Liberal Studies.  There are many more methods for determining the winner of an election with more than two candidates  We will only discuss.
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.
Slide 15-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
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.
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.
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.
Determination of The Winners of 2012 Thomson Medal Award (Deadline for casting the 2 nd round vote is: 15 April, 2012 The sponsors of the top 10 candidates.
Math for Liberal Studies.  We have seen many methods, all of them flawed in some way  Which method should we use?  Maybe we shouldn’t use any of them,
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.
Part 4: Voting Topics - Continued
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.
The mathematics of voting The paradoxes of democracy.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan Voting and Social Choice Majority Rule and Condorcet’s Method Other Voting Systems for Three.
Determination of The Winners of 2012 Thomson Medal Award 1.The 1 st round voting will be held to select the top 9 candidates by the members of the IMSF.
Voting: Does the Majority Always Rule?
Voting and Apportionment
Plurality and Borda Count Method
Impossibility and Other Alternative Voting Methods
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
Impossibility and Other Alternative Voting Methods
1.3 The Borda Count Method.
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)
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
Section 14.1 Voting Methods.
Presentation transcript:

Voting Methods Examples of Voting Methods (other than majority rules) –Plurality –Borda Count –Hare System –Sequential Pairwise –Approval Voting

Examples of Voting Methods Consider the following preference schedule for 9 voters considering 4 candidates A, B, C and D. Number of Voters (9 total) Rank st AABBCCD 2 nd DBCCBDC 3 rd BCDADBB 4 th CDADAAA

(a) Who wins by the plurality method? Number of Voters (9 total) Rank st AABBCCD 2 nd DBCCBDC 3 rd BCDADBB 4 th CDADAAA With the plurality method, we consider only each voter’s 1 st place ranking. A voter can only vote for his or her first choice.

(a) Who wins by the plurality method? Number of Voters (9 total) Rank st AABBCCD We consider only each voter’s 1 st place ranking. Because A has the most first place votes, A is the winner by the plurality method.

(b) Who wins by the Borda Count method of voting? Note that A has 13 points, B has 15 points, C has 13 points, and D has 13 total points. Because B has the most total points, B is the winner by the Borda Count method. Number of Voters (9 total) Rank st (3points) A (9) A (3) B (3) B (3) C (3) C (3) D (3) 2 nd (2points) D (6) B (2) C (2) C (2) B (2) D (2) C (2) 3 rd (1 point) B (3) C (1) D (1) A (1) D (1) B (1) B (1) 4 th (0 points) C (0) D (0) A (0) D (0) A (0) A (0) A (0)

(c) Who wins by the Hare System voting method? First, we must eliminate candidate D because the least number of voters rank D as a first choice. Number of Voters (9 total) Rank st AABBCCD 2 nd DBCCBDC 3 rd BCDADBB 4 th CDADAAA

(c) Who wins by the Hare System voting method? Number of Voters (9 total) Rank st AABBCCD 2 nd DBCCBDC 3 rd BCDADBB 4 th CDADAAA We cross out every instance of candidate D in the preference lists of all voters.

(c) Who wins by the Hare System voting method? Number of Voters (9 total) Rank st AABBCC 2 nd BCCBC 3 rd BCABB 4 th CAAAA Once candidate D is removed as an option, we assume individual voter’s preferences remained unchanged with respect to the other candidates, and so we move candidates up into any open spaces.

(c) Who wins by the Hare System voting method? Number of Voters (9 total) Rank st AABBCCC 2 nd BBCCBBB 3 rd CCAAAAA 4 th Once candidate D is removed as an option, we assume individual voter’s preferences remained unchanged with respect to the other candidates, and so we move candidates up into any open spaces.

(c) Who wins by the Hare System voting method? Number of Voters (9 total) Rank423 1 st ABC 2 nd BCB 3 rd CAA 4 th (none) There are now some repetitions, so we can re-organize the table.

(c) Who wins by the Hare System Method of Voting? Number of Voters (9 total) Rank423 1 st ABC 2 nd BCB 3 rd CAA Now, we begin again, by identifying any candidates which have the least number of voters ranking them in first place. Remember there could be a tie for least, for example if candidate B and C were both ranked first by 2 voters. If that had been the case then both B and C would be eliminated and A would be declared the winner. In this example, we eliminate candidate B because B tops only 2 voters’ preference lists.

(c) Who wins by the Hare System Voting Method? Number of Voters (9 total) Rank423 1 st ABC 2 nd BCB 3 rd CAA Now, we begin again, by identifying any candidates which have the least number of voters ranking them in first place. Remember there could be a tie for least, for example if candidate B and C were both ranked first by 2 voters. If that had been the case then both B and C would be eliminated and A would be declared the winner. In this example, we eliminate candidate B because B tops only 2 voters’ preference lists.

(c) Who wins by the Hare System Voting Method? Number of Voters (9 total) Rank423 1 st AC 2 nd C 3 rd CAA Now we have eliminated candidate B from contention. Again, we assume voter preferences will remain unchanged with respect to the other candidates and we will move the remaining candidates up into any open spaces.

(c) Who wins by the Hare System Voting Method? Number of Voters (9 total) Rank423 1 st ACC 2 nd CAA 3 rd Now we have eliminated candidate B from contention. Again, we assume voter preferences will remain unchanged with respect to the other candidates and we will move the remaining candidates up into any open spaces.

(c) Who wins by the Hare System Voting Method? Number of Voters (9 total) Rank45 1 st AC 2 nd CA Now we re-organize the table because of the repetitions in the preference lists. At this point, A is eliminated because A tops the least number of preference lists (4) compared to C (with 5 lists). Because C is the only candidate remaining after the sequence of eliminations, C is declared the winner. Note that if both A and C where ranked first by the same number of voters (for example if both lists represented 5 voters) we would declare the two remaining candidates tied.

(d) Who wins by the sequential pairwise voting method? We must determine the order in which we will compare candidates head-to-head. This order is called the agenda. Suppose we will compare them in alphabetical order: A, B, C, then D. With the voter preferences listed below, we begin by comparing candidates A and B. We consider all voter lists and note that B ranks above A on 5 lists whereas A ranks over B on only 4 lists. Therefore, B wins over A by a vote of 5 to 4. Because B wins over A, based on the agenda, we now compare B with C. Number of Voters (9 total) Rank st AABBCCD 2 nd DBCCBDC 3 rd BCDADBB 4 th CDADAAA

(d) Who wins by the sequential pairwise voting method ? Comparing B and C head-to-head, we recognize that B ranks above C for 6 out of 9 voters. That is, B beats C by a vote of 6 to 3. Following the agenda A, B, C, and D, we now compare B with D. We find that D is preferred to B among voters by a ratio of 5 to 4 and because we have reached the last candidate, D is declared the winner by sequential pairwise voting. Number of Voters (9 total) Rank st AABBCCD 2 nd DBCCBDC 3 rd BCDADBB 4 th CDADAAA

Is this at all disconcerting? Different voting methods producing different results? Candidate A prefers plurality Candidate B prefers Borda Count Candidate C prefers the Hare System Candidate D prefers sequential pairwise voting (but with agenda A,B,C,D) Which voting method is the best? How do we decide? How about approval voting?

An example of Approval Voting When voters use approval voting they cast votes only for candidates they find acceptable. This means we can imagine voters will “draw a line” between acceptable and unacceptable candidates as they vote. Voters need not decide on a preference list and rank all of the candidates, however we may continue using preference lists without loss of generality. In other words, it does no harm to suppose the voters actually do rank the candidates and then choose to separate them into two categories: acceptable and unacceptable. For our examples of approval voting we will continue using preference lists and actually draw a line to represent the point of division between acceptable and unacceptable candidates for each voter.

An example of Approval Voting Consider the preference list shown with lines added to indicate an “approval line” Voters will cast approval votes for candidates above the approval line and will not cast approval votes for candidates below that line. Number of Voters (100 total) st ABC 2 nd BAA 3 rd CCB Notice the lines indicate 33 voters approve of both candidates A and B, 33 voters Approve of only candidate B and 34 candidates approve of only candidate C. If the election were held with these preferences using approval voting, the winner would be candidate B who would get 66 approval votes. Note that A gets 33 approval votes and C gets 34 approval votes.

Which Method is Best? Is approval voting the answer ? –Is this the best method of voting ? We saw 4 different voting methods each give us a different winner for the same election. There are two problems we must face: –First, there is the problem that different voting methods can produce different winners and we must decide which method to use. –Second, each of our voting methods have problems in and of themselves. Even approval voting has its share of problems.