Excursions in Modern Mathematics, 7e: 1.Conclusion - 2Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting CONCLUSION Elections, Fairness,

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

Arrow’s Conditions and Approval Voting
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.
CS 886: Electronic Market Design Social Choice (Preference Aggregation) September 20.
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.
Voting Theory.
Excursions in Modern Mathematics Sixth Edition
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
1 The Mathematics of Voting
Fair Elections Are they possible?. Acknowledgment Many of the examples are taken from Excursions in Modern Mathematics by Peter Tannenbaum and Robert.
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.
5.1 Sampling Distributions for Counts and Proportions.
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.
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.
Arrow’s Theorem The search for the perfect election decision procedure.
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.
Chapter 10: The Manipulability of Voting Systems Lesson Plan An Introduction to Manipulability Majority Rule and Condorcet’s Method The Manipulability.
© 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?
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.
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.
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: 2.Conclusion - 2Copyright © 2010 Pearson Education, Inc. 2 The Mathematics of Power CONCLUSION.
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 –
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.
Arrow’s Impossibility Theorem
1.
1 The Process of Computing Election Victories Computational Sociology: Social Choice and Voting Methods CS110: Introduction to Computer Science – Lab Module.
1 The Mathematics of Voting
Impossibility and Other Alternative Voting Methods
1.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 10: The Manipulability of Voting Systems Lesson Plan
8.2 Voting Possibilities and Fairness Criteria
Impossibility and Other Alternative Voting Methods
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
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.
Warm Up – 1/27 - Monday Who wins by Plurality with Elimination?
Quiz – 1/24 - Friday How many people voted in the election?
Flaws of the Voting Methods
Arrow’s Conditions and Approval Voting
Voting Fairness.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

Excursions in Modern Mathematics, 7e: 1.Conclusion - 2Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting CONCLUSION Elections, Fairness, and Arrow’s Impossibility Theorem

Excursions in Modern Mathematics, 7e: 1.Conclusion - 3Copyright © 2010 Pearson Education, Inc. “small” elections of various kinds play a pervasive and important role in all our lives, from getting a job to deciding where to go to dinner there are many different formal methods that can be used to decide the outcome of an election we focused on four basic methods- mostly because they are simple and commonly used - but there are many others, some quite elaborate and exotic Themes of Chapter 1

Excursions in Modern Mathematics, 7e: 1.Conclusion - 4Copyright © 2010 Pearson Education, Inc. we saw that the results of an election can change if we change the voting method Themes of Chapter 1 The Math Club example dramatically illustrated this point - each of the four voting methods produced a different winner. Since there were four candidates, we can say that each of them won the election - just pick the “right” voting method.

Excursions in Modern Mathematics, 7e: 1.Conclusion - 5Copyright © 2010 Pearson Education, Inc. Given an abundance of voting methods, how do we determine which are “good” voting methods and which are not so good? In a democratic society the most important quality we seek in a voting method is that of fairness. This leads us to the last, but probably most important, theme of this chapter - the notion of fairness criteria. Fairness criteria set the basic standards that a fair election should satisfy. We discussed four of them in this chapter - let’s review what they were: Themes of Chapter 1

Excursions in Modern Mathematics, 7e: 1.Conclusion - 6Copyright © 2010 Pearson Education, Inc. The Majority Criterion A majority candidate should always win the election. After all, it seems clearly unfair when a candidate with a majority of the first-place votes does not win. Fairness Criteria

Excursions in Modern Mathematics, 7e: 1.Conclusion - 7Copyright © 2010 Pearson Education, Inc. The Condorcet Criterion A Condorcet candidate should always win the election. When the candidates are compared two at a time, the Condorcet candidate beats each of the other candidates. How could it be fair to declare a different candidate as the winner? Fairness Criteria

Excursions in Modern Mathematics, 7e: 1.Conclusion - 8Copyright © 2010 Pearson Education, Inc. The Monotonicity Criterion Suppose candidate X is a winner of the election, but for one reason or another there is a new election. If the only changes in the ballots are changes in favor of candidate X (and only X), then X should win the new election. Fairness Criteria

Excursions in Modern Mathematics, 7e: 1.Conclusion - 9Copyright © 2010 Pearson Education, Inc. The Independence-of-Irrelevant- Alternatives Criterion (IIA) Suppose candidate X is a winner of the election, but for one reason or another there is a new election. If the only changes are that one of the other candidates withdraws or is disqualified, then X should win the new election. The flip side of this criterion is that a winner of the election should not be penalized by the introduction of irrelevant new candidates who have no chance of winning. Fairness Criteria

Excursions in Modern Mathematics, 7e: 1.Conclusion - 10Copyright © 2010 Pearson Education, Inc. Other fairness criteria beyond the ones listed above have been proposed, but these four are sufficient to establish a minimum standard of fairness - a fair voting method should clearly satisfy all four of the above. Surprisingly, none of the four voting methods we discussed in this chapter meets this minimum standard - far from it! Fairness Criteria

Excursions in Modern Mathematics, 7e: 1.Conclusion - 11Copyright © 2010 Pearson Education, Inc. Borda count method violates the Majority criterion, the Condorcet criterion, and the IIA criterion. Plurality-with-elimination method violates the Condorcet criterion, the monotonicity criterion, and the IIA criterion. Pair-wise comparisons method violates the IIA criterion. Fairness Criteria

Excursions in Modern Mathematics, 7e: 1.Conclusion - 12Copyright © 2010 Pearson Education, Inc. What voting method satisfies the minimum standards of fairness set forth by the above four criteria? For democratic elections involving three or more candidates, the answer is that there is no such voting method. Given the obvious importance of having fair elections in a democracy, how is it possible that no one has come up with such a voting method? Fair Voting Method

Excursions in Modern Mathematics, 7e: 1.Conclusion - 13Copyright © 2010 Pearson Education, Inc. In 1949 mathematical economist Kenneth Arrow demonstrated that this is indeed an impossible task. Arrow’s impossibility theorem essentially says (his exact formulation of the theorem is slightly different from the one given here) that it is mathematically impossible for a democratic voting method to satisfy all of the fairness criteria. Arrow’s impossibility theorem is surprising and paradoxical. It tells us that making decisions in a consistently fair way is inherently impossible in a democratic society. Arrow’s Impossibility Theorem