Explaining the Impossible: Kenneth Arrow s Nobel Prize Winning Theorem on Elections

Similar documents
Voting: Issues, Problems, and Systems, Continued

Arrow s Impossibility Theorem

1.6 Arrow s Impossibility Theorem

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Fairness Criteria. Review: Election Methods

Elections with Only 2 Alternatives

Fairness Criteria. Majority Criterion: If a candidate receives a majority of the first place votes, that candidate should win the election.

Head-to-Head Winner. To decide if a Head-to-Head winner exists: Every candidate is matched on a one-on-one basis with every other candidate.

Mathematical Thinking. Chapter 9 Voting Systems

Measuring Fairness. Paul Koester () MA 111, Voting Theory September 7, / 25

Exercises For DATA AND DECISIONS. Part I Voting

Voting: Issues, Problems, and Systems. Voting I 1/36

Recall: Properties of ranking rules. Recall: Properties of ranking rules. Kenneth Arrow. Recall: Properties of ranking rules. Strategically vulnerable

The Impossibilities of Voting

Voting: Issues, Problems, and Systems. Voting I 1/31

Math116Chap1VotingPart2.notebook January 12, Part II. Other Methods of Voting and Other "Fairness Criteria"

Voting: Issues, Problems, and Systems

Chapter 1 Practice Test Questions

Voting rules: (Dixit and Skeath, ch 14) Recall parkland provision decision:

Math for Liberal Arts MAT 110: Chapter 12 Notes

The search for a perfect voting system. MATH 105: Contemporary Mathematics. University of Louisville. October 31, 2017

The Mathematics of Voting and Elections: A Hands-On Approach. Instructor s Manual. Jonathan K. Hodge Grand Valley State University

Voting: Issues, Problems, and Systems, Continued. Voting II 1/27

9.3 Other Voting Systems for Three or More Candidates

SOCIAL CHOICES (Voting Methods) THE PROBLEM. Social Choice and Voting. Terminologies

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

12.2 Defects in Voting Methods

Voting Criteria: Majority Criterion Condorcet Criterion Monotonicity Criterion Independence of Irrelevant Alternatives Criterion

Math Circle Voting Methods Practice. March 31, 2013

Social Choice: The Impossible Dream. Check off these skills when you feel that you have mastered them.

Arrow s Impossibility Theorem on Social Choice Systems

Desirable properties of social choice procedures. We now outline a number of properties that are desirable for these social choice procedures:

The Mathematics of Voting

Voting Criteria April

Main idea: Voting systems matter.

The Mathematics of Voting. The Mathematics of Voting

answers to some of the sample exercises : Public Choice

Chapter 9: Social Choice: The Impossible Dream

Intro to Contemporary Math

Write all responses on separate paper. Use complete sentences, charts and diagrams, as appropriate.

Arrow s Conditions and Approval Voting. Which group-ranking method is best?

Voting Methods for Municipal Elections: Propaganda, Field Experiments and what USA voters want from an Election Algorithm

Lecture 11. Voting. Outline

Chapter 10. The Manipulability of Voting Systems. For All Practical Purposes: Effective Teaching. Chapter Briefing

that changes needed to be made when electing their Presidential nominee. Iowa, at the time had a

Chapter 4: Voting and Social Choice.

Voting Protocols. Introduction. Social choice: preference aggregation Our settings. Voting protocols are examples of social choice mechanisms

Social Choice Theory. Denis Bouyssou CNRS LAMSADE

The Arrow Impossibility Theorem: Where Do We Go From Here?

Social welfare functions

MATH 1340 Mathematics & Politics

How should we count the votes?

The Electoral College

Fair Division in Theory and Practice

Math for Liberal Studies

MATH4999 Capstone Projects in Mathematics and Economics Topic 3 Voting methods and social choice theory

Dictatorships Are Not the Only Option: An Exploration of Voting Theory

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

The Mathematics of Voting

Rock the Vote or Vote The Rock

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Mathematics of Voting Systems. Tanya Leise Mathematics & Statistics Amherst College

Computational Social Choice: Spring 2007

PROBLEM SET #2: VOTING RULES

Presidential Election Democrat Grover Cleveland versus Benjamin Harrison. ************************************ Difference of 100,456

Introduction to Theory of Voting. Chapter 2 of Computational Social Choice by William Zwicker

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Grade 6 Math Circles Winter February 27/28 The Mathematics of Voting - Solutions

Section 3: The Borda Count Method. Example 4: Using the preference schedule from Example 3, identify the Borda candidate.

Mathematics and Social Choice Theory. Topic 4 Voting methods with more than 2 alternatives. 4.1 Social choice procedures

Make the Math Club Great Again! The Mathematics of Democratic Voting

Introduction to the Theory of Voting

Social Choice. CSC304 Lecture 21 November 28, Allan Borodin Adapted from Craig Boutilier s slides

Rationality & Social Choice. Dougherty, POLS 8000

Social choice theory

VOTING SYSTEMS AND ARROW S THEOREM

Section Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

The Manipulability of Voting Systems. Check off these skills when you feel that you have mastered them.

The mathematics of voting, power, and sharing Part 1

Topics on the Border of Economics and Computation December 18, Lecture 8

Election Theory. How voters and parties behave strategically in democratic systems. Mark Crowley

Math for Liberal Studies

CSC304 Lecture 16. Voting 3: Axiomatic, Statistical, and Utilitarian Approaches to Voting. CSC304 - Nisarg Shah 1

The Executive Branch

Voting Definitions and Theorems Spring Dr. Martin Montgomery Office: POT 761

Grade 7/8 Math Circles Winter March 6/7/8 The Mathematics of Voting

Possible voting reforms in the United States

How Should Members of Parliament (and Presidents) Be Elected? E. Maskin Institute for Advanced Study

Mathematics of the Electoral College. Robbie Robinson Professor of Mathematics The George Washington University

What is the Best Election Method?

Elections. How we choose the people who govern us

Social Choice & Mechanism Design

Simple methods for single winner elections

Voting Methods

Today s plan: Section : Plurality with Elimination Method and a second Fairness Criterion: The Monotocity Criterion.

(67686) Mathematical Foundations of AI June 18, Lecture 6

Introduction to Social Choice

The actual midterm will probably not be multiple choice. You should also study your notes, the textbook, and the homework.

Constructing voting paradoxes with logic and symmetry

Transcription:

Explaining the Impossible: Kenneth Arrow s Nobel Prize Winning Theorem on Elections Dr. Rick Klima Appalachian State University Boone, North Carolina U.S. Presidential Vote Totals, 2000 Candidate Bush Gore Nader Others Abstained Popular Votes 50,456,002 50,999,897 2,882,955 1,066,246 (a lot) Electoral Votes 271 266 0 0 1

U.S. Presidential Vote Totals, 1876 Candidate Hayes Tilden Others Popular Votes 4,034,311 4,288,546 90,244 Electoral Votes 185 184 0 Majority Criterion If there is a candidate in an election who is preferred as the winner by a majority (more than half) of the voters, then that candidate should be the winner of the election.

Associated Press Top 20 Football Poll November 25, 1968 Team First Place Votes Borda Points 1. Ohio State 21.5 935 2. USC 24.5 925 3. Penn State 3 773 4. Georgia 1 597 5. Kansas 0 524 California Gubernatorial Recall Election, 2003 135 candidates were on the ballot.

California Gubernatorial Recall Election, 2003 135 candidates were on the ballot. What is the smallest percentage of the votes that Arnold Schwarzenegger could have received and won the election? (Less than 1%) What is the largest percentage of voters who could have preferred Arnold the least among the 135 candidates in order for him to have won? (More than 99%) Minnesota Gubernatorial Election, 1998 Percentage of Voters Rank 35% 28% 20% 17% 1 Coleman Humphrey Ventura Ventura 2 Humphrey Coleman Coleman Humphrey 3 Ventura Ventura Humphrey Coleman

Condorcet Loser Criterion If there is a candidate in an election who would lose a head-to-head contest against each of his or her opponents, then that candidate should not be the winner of the election. Condorcet Winner Criterion If there is a candidate in an election who would win a head-to-head contest against each of his or her opponents, then that candidate should be the winner of the election.

IOC Voting for Site of 2004 Olympics City Athens Buenos Aires Cape Town Rome Stockholm Votes 32 16 16 23 20 City Buenos Aires Cape Town Abstained Votes 44 62 1 City Athens Cape Town Rome Stockholm Votes 38 22 28 19 City Athens Cape Town Rome Votes 52 20 35 City Votes Athens 66 Rome 41 Women s Figure Skating Judging 2002 Olympics Position First Second Third Before Final Competitor Skated Michelle Kwan Sarah Hughes After Final Competitor Skated Sarah Hughes Irina Slutskaya Michelle Kwan

Independence of Irrelevant Alternatives Criterion Suppose candidate A finishes ahead of candidate B in an election. If it is decided that one of the other candidates will be removed from the ballots, and the ballots (with the one candidate removed) will be reevaluated, then A should still finish ahead of B. I began to get the idea that maybe there was no voting method that would satisfy all the conditions that I regarded as reasonable. It was at this point that I set out to prove it. And it actually turned out to be a matter of only a few days work.

Arrow s Actual Impossibility Theorem For an election with more than two candidates, it is impossible for a voting system to satisfy all of the following five conditions: Independence of Irrelevant Alternatives (IIA) Monotonicity - Changes to the ballots cast in an election that favor only one candidate should never cause that candidate to drop in the final ranking of the candidates. Universality - Voting systems should never restrict how the voters in an election are allowed to rank the candidates. Citizen Sovereignty - Every final ranking of the candidates in an election should be possible through some combination of personal rankings by the voters. Nondictatorship - There should never be a voter in an election for whom the voter s personal ranking of the candidates is always identical to the final ranking of the candidates.

Arrow s Theorem The Proof To Prove: For an election with more than two candidates, a voting system that satisfies IIA, monotonicity, universality, and citizen sovereignty must be a dictatorship. Unanimity (The Pareto Condition) - If all of the voters in an election prefer candidate A over candidate B, then A should finish ahead of B in the election. Lemma 1: For an election with more than two candidates, a voting system that satisfies IIA, monotonicity, and citizen sovereignty must satisfy unanimity. Arrow s Theorem The Proof Lemma 1: For an election with more than two candidates, a voting system that satisfies IIA, monotonicity, and citizen sovereignty must satisfy unanimity. Sketch of Proof: Let S 1 be a collection of preferences in which all of the voters prefer candidate A over candidate B. Citizen sovereignty implies that there must be a collection S 2 of preferences for which A finishes ahead of B. Create S 3 from S 2 by moving A ahead of B in all of the voter preferences. Monotonicity implies that A will finish ahead of B given S 3. IIA then implies that A will finish ahead of B given S 1.!

Arrow s Theorem The Proof Lemma 2: For an election with more than two candidates and a voting system that satisfies IIA, universality, and unanimity, if every voter ranks candidate B alone in first or last, then B must finish alone in first or last. Sketch of Proof: Suppose B does not finish alone in first or last. Find candidates A and C for which A finishes ahead of or tied with B, and C finishes behind or tied with B. Note then that A must finish ahead of or tied with C. If every voter moves C above A on their ballot, but makes no other changes, then unanimity implies that C must finish ahead of A. But IIA also implies that A must still finish ahead of or tied with C.! Arrow s Theorem The Proof Theorem: For an election with more than two candidates, a voting system that satisfies IIA, universality, and unanimity must be a dictatorship. Sketch of Proof: Call the voters v 1, v 2,, v n (in some order), and consider the case when every voter ranks candidate B alone in last. Then unanimity implies B must finish alone in last. Consider the voters one-by-one (in order) moving B on their ballot from alone in last to alone in first. Unanimity implies there must be a voter v j for whom when v j moves B to first, for the first time B moves to finishing first. We claim that this pivotal voter v j is a dictator.

Arrow s Theorem The Proof Sketch of Proof (Continued): Rank v 1!!! v j-1 v j v j+1!!! First B!!! B??!!!? M M M M M M Last?!!!? B B!!! B Table 1: B finishes last Rank v 1!!! v j-1 v j v j+1!!! First B!!! B B?!!!? M M M M M M Last?!!!?? B!!! B Table 2: B finishes first v n v n Arrow s Theorem The Proof Sketch of Proof (Continued): Consider candidates A and C, neither being B, and let S 1 be a collection of voter preferences for which v j prefers A over C. Create a collection S 2 of voter preferences by making the following changes to S 1, none of which by IIA can affect how A and C would finish relative to each other: v 1,, v j-1 move B to being alone in first v j moves B to between A and C v j+1,, v n move B to being alone in last Then A relates to B in S 2 as in Table 1 (where B finishes last), and B relates to C in S 2 as in Table 2 (where B finishes first). By IIA, A must finish ahead of C given S 2, and thus also by IIA, A must finish ahead of C given S 1.

Arrow s Theorem The Proof Sketch of Proof (Continued): Consider candidates A and B, and suppose that for some other candidate C the pivotal voter is v i. Then v i completely controls how every pair of candidates not including C would finish relative to each other. But v j can clearly affect how A and B would finish relative to each other. Thus v i = v j.! Voting is a basic tool of every democracy. We vote to choose the name for a pet dog, a textbook, a department chair, a U.S. Senator, the president of the United States. But does the election outcome capture what the voters really want? Not necessarily.

Intensity of Binary Independence Criterion Suppose candidate A finishes ahead of candidate B in an election. If the ballots are changed, but the number of candidates ranked between A and B is not changed on any of the ballots, and the ballots are reevaluated, then A should still finish ahead of B. Saari s Non-Impossibility Theorem For an election with more than two candidates, it is possible for a voting system to satisfy all of the following five conditions: Intensity of Binary Independence Monotonicity Universality Citizen Sovereignty Nondictatorship And the Borda count is one such voting system! But wait can t the Borda count violate the majority criterion?

California Gubernatorial Recall Election, 2003 (Hypothetical) Rank 1 51% of voters Schwarzenegger 49% of voters Leo Gallagher 2 Leo Gallagher Gary Coleman M M M 135 Gary Coleman Schwarzenegger