8.2 Voting Possibilities and Fairness Criteria

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.
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.
Excursions in Modern Mathematics Sixth Edition
1.1, 1.2 Ballots and Plurality Method
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Voting Review Material
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.
Social choice (voting) Vincent Conitzer > > > >
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.
Copyright © 2009 Pearson Education, Inc. Chapter 15 Section 2 - Slide Election Theory Flaws of Voting.
Chapter 15 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
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,
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods.
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: 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 –
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.
1.
1 The Process of Computing Election Victories Computational Sociology: Social Choice and Voting Methods CS110: Introduction to Computer Science – Lab Module.
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
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
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
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.
Warm Up – 5/27 - Monday How many people voted in the election?
Warm Up – 1/23 - Thursday How many people voted in the election?
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.
Voting systems Chi-Kwong Li.
MAT 105 Fall 2008 More Voting Methods.
p.33 (28 run off, 30 run off, 32, 34ab run off)
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
Arrow’s Conditions and Approval Voting
Voting Fairness.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

8.2 Voting Possibilities and Fairness Criteria Unit 4- Discrete Mathematics

The Fairness Criteria of Voting What do we mean by fair? Over the years, those who study voting theory have proposed numerous criteria which most people would expect a 'fair' preferential election method to satisfy. There are four Fairness Criteria: The Majority Criterion The Condorcet Criterion The Irrelevant Alternatives Criterion The Monotonicity Criterion Kenneth Arrow Mathematical economist who proved in 1952 that there is NO consistent method of making a fair choice among three or more candidates with preferential voting. Borda Winner = Boston

The Majority Criterion The voting methods we’ve been practicing are all used in real world situations but none are perfect. Majority Criterion- if a candidate has majority of the first place votes, then that candidate should be the winner Lets show that the BORDA METHOD fails the majority criterion. Look at the following voter profile with 20 members below voting on Boston, Chicago, Philly, and Orlando. Borda Winner = Boston 8 4 1st C B 2nd P O 3rd 4th

The Majority Criterion Borda Winner = Boston This method does not select the candidate with the “majority” of the votes, who should be Chicago. The Plurality, Pairwise, and Hare Methods do satisfy the Majority criterion. 8 4 1st C B 2nd P O 3rd 4th

The Majority Criterion Plurality- always satisfies Pairwise- always satisfies Borda-does not satisfy Hare- always satisfies

The Condorcet Criterion The candidate who can win a pairwise comparison with EVERY other candidate is called the Condorcet candidate. Condorcet Criterion- should be the winner of an election if they win in pairwise comparison. (This is sometimes called HEAD TO HEAD) Lets show that the PLURALITY method fails the Condorcet criterion.

The Condorcet Criterion Let’s try to prove the Condorcet Criterion again with an example. Remember, the Condorcet Winner is the winner of the pairwise comparison voting method.

The Condorcet Criterion Condorcet Criterion (aka Head to Head) Plurality- may not satisfy Pairwise- always satisfies Borda- may not satisfy Hare- may not satisfy

The Monotonicity Criterion Monotonicity Criterion- If a candidate wins an election, and, in a reelection, the only changes are changes that favor the candidate, then the same candidate should win the reelection. For example, if a candidate wins a straw vote (pre-election poll), then gains additional support in the actual election without losing any original support, that candidate should win the actual election. This criterion can actually be violated by the Hare Method, which can produce a different winner from the straw vote winner.

The Monotonicity Criterion Monotonicity Criterion- If a candidate wins an election, and, in a reelection, the only changes are changes that favor the candidate, then the same candidate should win the reelection. Ex: Using the Hare Method, C is the winner In the actual election, the 3 votes in the last column were changed to C, A, B, adding to the first column. Hare makes B the winner, even though C actually gained more votes through the switch.

The Monotonicity Criterion Plurality- always satisfies Pairwise- always satisfies Borda- always satisfies Hare- does not satisfy

The Irrelevant Alternatives Criterion Irrelevant Alternatives Criterion- If a candidate wins an election and, before the results are announced, one or more candidates withdraw from the running, the same candidate should be the winner on the recount All four voting methods may violate this criterion. Ex: Borda – C wins If A drops out, then B wins by Borda.

The Irrelevant Alternatives Criterion Plurality- may not satisfy Pairwise- may not satisfy Borda- may not satisfy Hare- may not satisfy

Summary! Criteria → Majority Condorcet Monotonicity Irrelevant Alt Plurality Satisfies VIOLATES Pairwise Borda Hare

Do Now Please! Practice Problems Worksheet Please complete #9!