Fairness Criteria and Arrow’s Theorem Section 1.4 Animation.

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
Voting Methods Continued
Voting and social choice Vincent Conitzer
Math 1010 ‘Mathematical Thought and Practice’ An active learning approach to a liberal arts mathematics course.
The Voting Problem: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
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.
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
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Voting Review Material
Plurality with elimination, Runoff method, Condorcet criterion.
CPS Voting and social choice
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.
Arrow’s Theorem The search for the perfect election decision procedure.
CPS Voting and social choice Vincent Conitzer
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,
Great Theoretical Ideas in Computer Science.
Let’s take a class vote. How many of you are registered to vote?
Voting Methods Examples of Voting Methods (other than majority rules) –Plurality –Borda Count –Hare System –Sequential Pairwise –Approval Voting.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 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.
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.
Initiative 318 (IRV) & Election Methods A presentation of issues addressed by Washington State Initiative 318 and a discussion of possible alternatives.
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.
1 The Process of Computing Election Victories Computational Sociology: Social Choice and Voting Methods CS110: Introduction to Computer Science – Lab Module.
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
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.
Range Voting
Warm Up – 5/27 - Monday 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?
Flaws of the Voting Methods
Arrow’s Conditions and Approval Voting
Voting Fairness.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

Fairness Criteria and Arrow’s Theorem Section 1.4 Animation

1.4 Summary, Arrow's Theorem 2 Hey, Dr. Arrow. I’ve found a cool voting system that I think is really fair. I call it the “PERFECT” method and here’s how it works... That’s great, son. Now here are the 4 things you have to show me.

1.4 Summary, Arrow's Theorem criterion Candidate B Candidate A If one candidate has. Then the “PERFECT” method should always choose that candidate Order is IMPORTANT

1.4 Summary, Arrow's Theorem criterion If one candidate can. then the “PERFECT” method should always choose that candidate Animation

1.4 Summary, Arrow's Theorem 5 3.Monotonicity criterion Animation Candidate A wins an election using the “PERFECT” method For some reason, possibly a court order, a. must be held In between elections all the voters who change their preference ballots do so such that A in their ballots Then A should win the second election using “PERFECT”

1.4 Summary, Arrow's Theorem 6 4. Independence of Irrelevant Alternatives criterion Candidate A wins an election using the “PERFECT” method For some reason a second election must be held In between elections. of the first election drops out Then A should win the second election using “PERFECT”

1.4 Summary, Arrow's Theorem 7 Arrow’s Theorem Any voting system that one can devise must. at least one of the fairness criteria in election Important Theme #2

1.4 Summary, Arrow's Theorem 8 Borda violates the Majority criterion 522Pts KCL3 CLD2 LDC1 DKK0 IF. THEN. Order is Important

1.4 Summary, Arrow's Theorem 9 Plurality violates the Condorcet criterion KCD CDL LLC DKK IF. THEN. Order is Important

1.4 Summary, Arrow's Theorem 10 IRV violates the Monotonicity criterion (After election 1, the 5 voters in column 2 reverse O and B) BBOG GOBO OGGB ELECTION 1. ELECTION 2.

1.4 Summary, Arrow's Theorem 11 The Hare method violates the Irrelevant Alternative criterion. (Assume that candidate C drops out of the race after the 1 st election) ELECTION 1. ELECTION ABCD BDDA CABC DCAB

1.4 Summary, Arrow's Theorem 12 Approval voting violates the Majority criterion The candidates in RED are the “approved” candidates ABACA DCDDD CABAB BDCBC ELECTION 1. ELECTION 2.

1.4 Summary, Arrow's Theorem 13 The Plurality voting method always satisfies the Majority criterion 1.True 2.False

1.4 Summary, Arrow's Theorem 14 IRV always satisfies the Majority criterion 1.True 2.False

1.4 Summary, Arrow's Theorem 15 The Condorcet method always satisfies the Condorcet criterion 1.True 2.False

1.4 Summary, Arrow's Theorem 16 To show that a voting method (call it X) does not satisfy the Majority criterion you must show there is 1. No majority winner 2. A majority winner and voting method X picks that winner 3. A majority winner but voting method X picks a different candidate. 4. None of the above

1.4 Summary, Arrow's Theorem 17 To show that a voting method (call it X) does not satisfy the Monotonicity criterion you must show that a candidate 1. Wins 1 st election using method X, but does not win 2 nd 2. Wins neither election using method X. 3. Loses the 1 st election using X, but wins 2 nd 4. None of the above

1.4 Summary, Arrow's Theorem 18 Arrow’s Theorem says that 1. At least one of the 4 criteria is violated in every election 2. At lest one of the 4 criteria is violated in some election 3. All of the 4 criteria are violated in some election 4. None of the above

1.4 Summary, Arrow's Theorem 19 End of 1.4

1.4 Summary, Arrow's Theorem 20 Mirror, Mirror on the Wall the Fairest of Them All? Who’s What’s

1.4 Summary, Arrow's Theorem 21 Kenneth Arrow (1952) Won the Nobel Prize in Economics Constructed four criteria that any "fair" voting system should satisfy Known as Arrow’s Fairness Criteria

1.4 Summary, Arrow's Theorem 22 Election 1 using “PERFECT” Election 2 using “PERFECT” Candidates I win! Not so fast. There were some shenanigans in Precinct 6. We’re doing this one again In the meantime only one voter changes her preference ballot and she moves the winner up in her ballot The winner of election 1 wins again But of course

1.4 Summary, Arrow's Theorem 23 Election 1 using “PERFECT” Election 2 using “PERFECT” Candidates I win! Not so fast folks. There were some shenanigans in Precinct 6. We’re doing this one again In the meantime one of the losing candidates drops out of the race The winner of election 1 wins again No surprise

1.4 Summary, Arrow's Theorem 24 Meta - Material