Fair Elections Are they possible?. Acknowledgment Many of the examples are taken from Excursions in Modern Mathematics by Peter Tannenbaum and Robert.

Slides:



Advertisements
Similar presentations
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Advertisements

Which units are you most interested in covering? Unit A –Management Science Unit B – Growth Unit C – Shape and Form Unit D – Statistics.
Voting Methods Continued
Math 1010 ‘Mathematical Thought and Practice’ An active learning approach to a liberal arts mathematics course.
How “impossible” is it to design a Voting rule? Angelina Vidali University of Athens.
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
The Plurality Method The Borda Count Method
1.1, 1.2 Ballots and Plurality Method
Voting Review Material
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
Homework Read Pages 6 – 23 Page 30: 18, 19, 24, 28, 29, 30, 33, 59, 60, 71.
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.
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.
Mathematics for Liberal Arts Chapter 1 The Mathematics of Voting.
1 Voting: Perception and Reality Do voters vote in their best interest? When they do, does the outcome of the vote reflect those interests? What type of.
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 10: The Manipulability of Voting Systems Lesson Plan An Introduction to Manipulability Majority Rule and Condorcet’s Method The Manipulability.
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.
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.
Voting Tie Breakers. With each method described – plurality method, Borda count method, plurality with elimination method, and pairwise comparison method.
Why We Should Use the Plurality with Elimination Voting Method.
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.
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.
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.
Voting: Does the Majority Always Rule?
Choosing the Lesser Evil: Helping Students Understand Voting Systems
1.
Plurality with elimination, Runoff method, Condorcet criterion
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
8.2 Voting Possibilities and Fairness Criteria
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
1.3 The Borda Count Method.
Lecture 1: Voting and Election Math
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.
Introduction to Social Choice
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:

Fair Elections Are they possible?

Acknowledgment Many of the examples are taken from Excursions in Modern Mathematics by Peter Tannenbaum and Robert Arnold

Presidential Election Not decided by majority vote Decided by electoral college In 2000, Bush won without receiving a majority of votes

Senate and House Elections Majority wins If no candidate wins a majority, then the outcome depends on the state’s rules

Today’s Assumptions At least two choices Voters give preference list: A>B means A preferred over B VoteA B C D Means A>B>C>D

Who Wins? Given everyone’s preference vote, what method should be used to determine winner? Some bad methods: –My vote wins: Called dictatorship –Ignore the votes and pick one at random: Decision should be deterministic –Always pick A as the winner regardless of vote: Imposition, Method should be non- impositional

Vote for Class President No. Votes st ACDBC 2 nd BBCDD 3 rd CDBCB 4thDAAAA

Plurality Method Candidate with most first place votes wins In case of class president, A wins We will not worry about ties. (Ways to resolve ties, or just have more than one winner!)

Plurality Method Advantage If majority of voters place a choice as their first preference, then that choice wins. Disadvantage Ignores the lower preference choices Majority Criterion: If a choice receives a majority of the top preference votes, then that choice should win

Plurality Method No. votes st ABC 2 nd BCB 3rdCAA A wins plurality, but if B goes head to head with either A or C, B wins!

Plurality Method Used for many political elections (common in England, India, US, Canada) Often used to pick corporate executive officers

Condercet Criterion If any choice wins in a head-to-head comparison over every other choice, then that choice should win. Plurality does not satisfy Condercet criterion –Means that plurality will not satisfy Condercet criterion for some voting outcome, but for some voting outcomes it might

Insincere Voting Sometimes in order to avoid undesirable winner, voter may put first choice second Other schemes, may move second choice to last No. votes st ABC 2 nd BCB 3rdCAA No. votes st ABB 2 nd BCC 3rdCAA

Borda Count Assign points for each vote base on preference ExampleA 3 points D2 points B1 point C0 points

Borda Count Who wins class president? A79 B106 C104 D81 B wins!

Borda Count No. Voters st ABC 2nd BCD 3 rd CDB 4 th DAA A6 x 3 = 18 B6 x x x 1 = 21 C6 x x x 3 = 19 D2 x x 2 = 8 Violates Majority Criterion and Condercet

Borda Count Used in some political elections (Slovenia and Micronesia) Baseball MPV in AL and NL Heisman Trophy Universities often use it for hiring

Plurality with Elimination 1.If a choice has a majority of first place votes, that choice wins 2.Eliminate choice with fewest first place votes and pretend the election was only among the other choices 3.Back to 1.

Plurality with Elimination Who wins class president? D

Plurality with Elimination Three candidates in an election. Word gets out who is voting for who. Consequently, a few people change their votes so they vote for a winner. No. Votes st ABCA 2 nd BCAC 3rdCABB No. Votes st ABC 2 nd BCA 3rdCAB

Plurality with Elimination Advantage –Majority Criterion Satisfied Disadvantage –Violates Monotonicity Criterion: If votes are changed that only improves the winners position, the winner should not change

Plurality with Elimination Variations used in political elections (France) Often used in hiring Olympic Committee uses to determine location of Olympics

Pairwise Comparison For each pair of choices, x and y, count the number of votes that places x before y and the number that places y before x. One point to the winner, ½ point if tie Tally all the points and the most points wins

Pairwise Comparison Who wins class president? A 14, B 23 … B gets 1 point A 14, C 23 … C gets 1 point A 14, D 23 … D gets 1 point B 18, C 19 … C gets 1 point B 28, D 9 … B gets 1 point C 25, D 12 … C gets 1 point C Wins with 3 points!

Pairwise Comparison No. Votes st ABBCCDE 2 nd DAABDAC 3 rd CCDAAED 4 th BDEDBCB 5thEECEEBA A vrs B B 1 A vrs C A 1 A vrs D A 1 A vrs E A 1 B vrs C C 1 B vrs D B.5 D.5 B vrs E B 1 C vrs D C 1 C vrs E E 1 D vrs E D 1 A: 3 B: 2.5 C: 2 D: 1.5 E: 1 Winner is A But what if C withdraws just before vote?

Pairwise Comparison Advantage –Satisfies Majority –Satisfies Condercet –Satisfies Monotonicity Disadvantage –Does not satisfy Independence-of- Irrelevant-Alternative Criterion: If x is the winner and a choice other than x is removed, x should still be the winner.

Pairwise Comparison Not currently used in any political election – variation last used in Marquette Michigan in the 1920’s Variation used by Wikimedia Foundation for election of Trustees Various other private organizations

Who Should be Class President? Four reasonable methods yielded four different answers! Critical that before voting takes place, method of determining winner is well established! But, is there some method that satisfies all the fairness criteria?

Is Fairness an Illusion? No. Votes st ABC 2 nd BCA 3rdCAB Theorem: If a voting scheme satisfies the Majority Criterion, it cannot satisfy the Independence-of-Alternative Criterion. Proof: Suppose A wins. If B withdraws, then C wins. Suppose B wins. If C withdraws, then A wins. Suppose C wins. If A withdraws, then B wins.

Arrows Theorem Theorem: If the method to determine the winner is deterministic, non-impositional, and it satisfies both Monotonicity and Independence-of-Alternative criteria, then it is a dictatorship. Sometimes people say there is no fair way to determine who wins!

Summary MajorityCondercetMonotonicityIndependence Plurality YesNoYesNo Borda Count No YesNo Plurality Elimination YesNo Pairwise Comparison Yes No

Best Method Let’s vote on which method we think is best. Before we vote, we have to decide which method to use to determine winner. Let’s vote on which method to use to determine the best method. Before we vote on which method to use, we have to …