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.

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

Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting 1.1Preference Ballots and Preference.
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 Mathematics of Elections
Mathematics The study of symbols, shapes, algorithms, sets, and patterns, using logical reasoning and quantitative calculation. Quantitative Reasoning:
VOTING SYSTEMS Section 2.5.
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.
 1. The majority criterion  2. Condorcet’s criterion  3. independence of irrelevant alternatives criterion  4. Monotonicity criterion.
Excursions in Modern Mathematics Sixth Edition
1.1, 1.2 Ballots and Plurality Method
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.
CRITERIA FOR A FAIR ELECTION
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.
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.
The Mathematics of Voting Chapter 1. Voting theory: application of methods that affect the outcome of an election. Sec 1: Preference Ballots and Schedules.
© 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.
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,
Let’s take a class vote. How many of you are registered to vote?
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods.
Part 4: Voting Topics - Continued
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.
© 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.
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.
Voting System Review Borda – Sequential Run-Off – Run-Off –
1.
1 The Process of Computing Election Victories Computational Sociology: Social Choice and Voting Methods CS110: Introduction to Computer Science – Lab Module.
Voting and Apportionment
Plurality and Borda Count Method
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
8.2 Voting Possibilities and Fairness Criteria
Impossibility and Other Alternative Voting Methods
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
1.3 The Borda Count Method.
Lecture 1: Voting and Election Math
Elections with More Than Two Candidates
Warm Up – 5/27 - Monday How many people voted in the election?
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.
Plurality with Elimination
Warm Up – 1/27 - Monday Who wins by Plurality with Elimination?
Quiz – 1/24 - Friday How many people voted in the election?
Section 14.1 Voting Methods.
Flaws of the Voting Methods
Voting Fairness.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

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 is democratic and always fair is mathematically impossible.  Basically, any system that we could ever create will have inherent flaws.

 What does “democratic” and “fair” mean?  There are four criteria that mathematicians and political scientists have agreed a fair voting system should meet.

 A majority of first place votes (over 50%) is different from a plurality, which is just the largest quantity of first place votes.

Number of Votes 632 First ChoiceEGF Second ChoiceFHG Third ChoiceGFH Fourth ChoiceHEE Clearly, Candidate E should win since they have more than half of the 1 st place votes. But under the Borda count, the results are much different. E = 29 pts, F = 32 pts, G = 30 pts, and H = 19 pts This puts candidate E in third place, with candidate F winning the election – A clear violation of the Majority Criterion.

“Daffy the duck and Jock the West Highland Terrier.” Virginmedia.com

 If candidate is favored when compared separately – that is, head-to-head – with every other candidate, then that candidate should win the election.  In a pairwise comparison, it is possible to have a three-way tie, where A beats B, B beats C, and C beats A. This was shown by the Marquis de Condorcet whose name is sometimes associated with the head-to-head criterion (the Condorcet Criterion).

Number of Votes8644 First ChoiceACCB Second ChoiceBBAA Third ChoiceCABC In a Pairwise Comparison, A beats B (12 to 10), and A beats C (12 to 10). This makes A the winner in this method. But if the Plurality method were used, C would win the election with 10 votes, more than A’s 8 or B’s 4.

 Who knew math could look this impressive… Ross, Chip, Prof. “Julia Set.” Abacus.bates.edu,

 If a candidate wins an election and, in a reelection, the only changes are changes that favor the candidate, then that candidate should win the reelection.

 An initial poll is taken to see where people stand (before the actual election):  If this initial poll was run under plurality with elimination, then V would be eliminated and W would beat G with 36 votes (to 22). Number of Votes st placeWVGG 2 nd placeGWVW 3 rd placeVGWV

 Because of the results of the initial “election”, the 8 people in the last column change their votes to match those in the 1 st column: Number of Votes st placeWVGG 2 nd placeGWVW 3 rd placeVGWV Number of Votes st placeWVG 2 nd placeGWV 3 rd placeVGW

 When this new configuration is run (for the actual election), the results are now different  Now, candidate G will be eliminated (instead of V), and V will win the election with 30 votes (to W’s 28). Number of Votes st placeWVG 2 nd placeGWV 3 rd placeVGW

 If a candidate wins an election and, in a recount, the only changes are that one or more of the other candidates are removed from the ballot, then that candidate should still win the election.

 Here is an election run with pairwise comparison  After running the comparisons, E has 2 pts, F and G tie with 1.5 each, and H has 1 pt. Number of Votes st placeEGHH 2 nd placeFFEE 3 rd placeGHGF 4 th placeHEFG

 Because they lost the initial voting, candidates F and G pull out of the election. This is what remains of the preference table…  Now, because of the removed candidates, H now defeats E in the reelection. Number of votes st placeEHHH 2 nd placeHEEE

Fairness Criteria Plurality Method Borda CountPlurality with Elimination Pairwise Comparison Majority Criterion Always satisfies May not satisfy Always satisfies Always satisfies Head-to- Head May not satisfy Always satisfies MonotonicityAlways satisfies Always satisfies May not satisfy Always satisfies Irrelevant Alternatives May not satisfy

 P ; #1, 5, 7, 9