Math for Liberal Studies.  We have studied the plurality and Condorcet methods so far  In this method, once again voters will be allowed to express.

Slides:



Advertisements
Similar presentations
Which units are you most interested in covering? Unit A –Management Science Unit B – Growth Unit C – Shape and Form Unit D – Statistics.
Advertisements

VOTING. BINARY METHODS Choosing between only two alternatives at time Majority Rule Pairwise voting Condorcet Method Agenda Paradox.
Voting Methods Continued
Math 1010 ‘Mathematical Thought and Practice’ An active learning approach to a liberal arts mathematics course.
IMPOSSIBILITY AND MANIPULABILITY Section 9.3 and Chapter 10.
Chapter 1: Methods of Voting
The Plurality Method Fails The Independence of Irrelevant Alternatives Criterion.
Mathematics The study of symbols, shapes, algorithms, sets, and patterns, using logical reasoning and quantitative calculation. Quantitative Reasoning:
MA 110: Finite Math Dr. Maria Byrne Instructional Laboratory 0345 Lecture 10/31/2008.
MAT 105 Fall  Harder than you might think  There are many examples in history where the results were disputed  We care about this because we.
Math for Liberal Studies.  In most US elections, voters can only cast a single ballot for the candidate he or she likes the best  However, most voters.
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
The Plurality Method The Borda Count Method
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
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.
When you vote for the President you are actually voting for an ELECTOR to vote for you Each state has a determined number of electors.
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
Nov. 2004Math and ElectionsSlide 1 Math and Elections A Lesson in the “Math + Fun!” Series.
1 The Process of Computing Election Victories Computational Sociology: Social Choice and Voting Methods CS110: Introduction to Computer Science – Lab Module.
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.
Arrow’s Theorem The search for the perfect election decision procedure.
Copyright © 2009 Pearson Education, Inc. Chapter 15 Section 2 - Slide Election Theory Flaws of Voting.
The Electoral College Chapter 23 Section 3.
MAT 105 Spring  Harder than you might think  There are many examples in history where the results were disputed  We care about this because we.
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 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.
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,
Fairness Criteria and Arrow’s Theorem Section 1.4 Animation.
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.
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.
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.
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.
Excursions in Modern Mathematics, 7e: 1.Conclusion - 2Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting CONCLUSION Elections, Fairness,
Voting System Review Borda – Sequential Run-Off – Run-Off –
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.
 Harder than you might think  There are many examples in history where the results were disputed.
PRESIDENTIAL ELECTIONS Primaries/Caucuses How does each political party select its best candidate?
1.
1 The Process of Computing Election Victories Computational Sociology: Social Choice and Voting Methods CS110: Introduction to Computer Science – Lab Module.
Voting: Does the Majority Always Rule?
1 The Mathematics of Voting
Impossibility and Other Alternative Voting Methods
1.
Plurality with elimination, Runoff method, Condorcet criterion
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
8.2 Voting Possibilities and Fairness Criteria
Impossibility and Other Alternative Voting Methods
Introduction If we assume
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
1.3 The Borda Count Method.
Elections with More Than Two Candidates
Warm Up – 5/27 - Monday How many people voted in the election?
Section 15.2 Flaws of Voting
5-2 Election Theory Flaws of Voting.
Voting systems Chi-Kwong Li.
Quiz – 1/24 - Friday How many people voted in the election?
Flaws of the Voting Methods
Voting Fairness.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

Math for Liberal Studies

 We have studied the plurality and Condorcet methods so far  In this method, once again voters will be allowed to express their complete preference order  Unlike the Condorcet method, we will assign points to the candidates based on each ballot

 We assign points to the candidates based on where they are ranked on each ballot  The points we assign should be the same for all of the ballots in a given election, but can vary from one election to another  The points must be assigned nonincreasingly: the points cannot go up as we go down the ballot

 Suppose we assign points like this:  5 points for 1 st place  3 points for 2 nd place  1 point for 3 rd place Number of Voters Preference Order 6Milk > Soda > Juice 5Soda > Juice > Milk 4Juice > Soda > Milk

 Determine the winner by multiplying the number of ballots of each type by the number of points each candidate receives Number of Voters Preference Order 6Milk > Soda > Juice 5Soda > Juice > Milk 4Juice > Soda > Milk

 5 points for 1 st place  3 points for 2 nd place  1 point for 3 rd place Number of Voters Preference OrderMilkSodaJuice 6Milk > Soda > Juice 5Soda > Juice > Milk 4Juice > Soda > Milk

 5 points for 1 st place  3 points for 2 nd place  1 point for 3 rd place Number of Voters Preference OrderMilkSodaJuice 6Milk > Soda > Juice30 5Soda > Juice > Milk5 4Juice > Soda > Milk4

 5 points for 1 st place  3 points for 2 nd place  1 point for 3 rd place Number of Voters Preference OrderMilkSodaJuice 6Milk > Soda > Juice3018 5Soda > Juice > Milk525 4Juice > Soda > Milk412

 5 points for 1 st place  3 points for 2 nd place  1 point for 3 rd place Number of Voters Preference OrderMilkSodaJuice 6Milk > Soda > Juice Soda > Juice > Milk Juice > Soda > Milk41220

 Milk gets 39 points  Soda gets 55 points  Juice gets 41 points  Soda wins! Number of Voters Preference OrderMilkSodaJuice 6Milk > Soda > Juice Soda > Juice > Milk Juice > Soda > Milk41220

 Sports  Major League Baseball MVP  NCAA rankings  Heisman Trophy  Education  Used by many universities (including Michigan and UCLA) to elect student representatives  Others  A form of rank voting was used by the Roman Senate beginning around the year 105

 The Borda Count is a special kind of rank method  With 3 candidates, the scoring is 2, 1, 0  With 4 candidates, the scoring is 3, 2, 1, 0  With 5 candidates, the scoring is 4, 3, 2, 1, 0  etc.  Last place is always worth 0

 Rank methods do not satisfy the Condorcet winner criterion  In this profile, the Condorcet winner is A  However, the Borda count winner is B VotersPreference Order 4A > B > C 3B > C > A

 Notice that C is a loser either way  If we get rid of C, notice what happens… VotersPreference Order 4A > B > C 3B > C > A

 Notice that C is a loser either way  If we get rid of C, notice what happens…  …now the Borda count winner is A VotersPreference Order 4A > B 3B > A

 If we start with this profile, A is the clear winner  But adding C into the mix causes A to lose using the Borda count  In this way, C is a “spoiler” VotersPreference Order 4A > B 3B > A

 Voters prefer A over B  A third candidate C shows up  Now voters prefer B over A

 After finishing dinner, you and your friends decide to order dessert.  The waiter tells you he has two choices: apple pie and blueberry pie.  You order the apple pie.  After a few minutes the waiter returns and says that he forgot to tell you that they also have cherry pie.  You and your friends talk it over and decide to have blueberry pie.

 In the 2000 Presidential election, if the election had been between only Al Gore and George W. Bush, the winner would have been Al Gore  However, when we add Ralph Nader into the election, the winner switches to George W. Bush

 The spoiler effect is sometimes called the independence of irrelevant of alternatives condition, or IIA for short  In a sense, the third candidate (the “spoiler”) is irrelevant in the sense that he or she cannot win the election

 Look at a particular profile and try to identify a candidate you think might be a spoiler  Determine the winner of the election with the spoiler, and also determine the winner if the spoiler is removed  If the winner switches between two non- spoiler candidates, then the method you are using suffers from the spoiler effect

 A beats B, but when C shows up, B wins C is a spoiler!  A beats B, but when C shows up, A still wins No spoiler!  A beats B, but when C shows up, C wins No spoiler!

 We now have two criteria for judging the fairness of an election method  Condorcet winner criterion (CWC)  Independence of irrelevant alternatives (IIA)  We still haven’t found an election method that satisfies both of these conditions

 Well, actually, the Condorcet method satisfies both conditions  But as we have seen, Condorcet’s method will often fail to decide a winner, so it’s not really usable

 Ideally, we want an election method that always gives a winner, and satisfies our fairness conditions  In the next section we will consider several alternative voting methods, and test them using these and other conditions