Voting: Issues, Problems, and Systems, Continued

Similar documents
1.6 Arrow s Impossibility Theorem

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

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

Arrow s Impossibility Theorem

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

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

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

Voting: Issues, Problems, and Systems

Elections with Only 2 Alternatives

9.3 Other Voting Systems for Three or More Candidates

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

The Impossibilities of Voting

Fairness Criteria. Review: Election Methods

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

Exercises For DATA AND DECISIONS. Part I Voting

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

Mathematical Thinking. Chapter 9 Voting Systems

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

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

12.2 Defects in Voting Methods

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

The Mathematics of Voting. The Mathematics of Voting

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

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

Math for Liberal Arts MAT 110: Chapter 12 Notes

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

Intro to Contemporary Math

Chapter 1 Practice Test Questions

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

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

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.

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

Math for Liberal Studies

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

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

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

Voting Criteria April

The Mathematics of Voting

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

answers to some of the sample exercises : Public Choice

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Sect 13.2 Flaws of Voting Methods

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

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

Social welfare functions

MATH 1340 Mathematics & Politics

The Mathematics of Voting

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

Many Social Choice Rules

Computational Social Choice: Spring 2007

Josh Engwer (TTU) Voting Methods 15 July / 49

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

In this lecture we will cover the following voting methods and fairness criterion.

Name Date I. Consider the preference schedule in an election with 5 candidates.

Introduction to the Theory of Voting

In deciding upon a winner, there is always one main goal: to reflect the preferences of the people in the most fair way possible.

Voting Methods

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

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

Main idea: Voting systems matter.

Introduction: The Mathematics of Voting

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

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

Math for Liberal Studies

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

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

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

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

Math Circle Voting Methods Practice. March 31, 2013

The mathematics of voting, power, and sharing Part 1

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

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

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

PROBLEM SET #2: VOTING RULES

Simple methods for single winner elections

Social Choice & Mechanism Design

Chapter 9: Social Choice: The Impossible Dream

Syllabus update: Now keeping best 3 of 4 tests

Practice TEST: Chapter 14

In deciding upon a winner, there is always one main goal: to reflect the preferences of the people in the most fair way possible.

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

What is the Best Election Method?

Rationality & Social Choice. Dougherty, POLS 8000

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

Majority- more than half of the votes Plurality- the most first place votes. The Majority Criterion

n(n 1) 2 C = total population total number of seats amount of increase original amount

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

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

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

Lecture 16: Voting systems

: It is mathematically impossible for a democratic voting method to satisfy all of the fairness criteria was proven in 1949.

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

Fair Division in Theory and Practice

Lecture 11. Voting. Outline

c M. J. Wooldridge, used by permission/updated by Simon Parsons, Spring

How should we count the votes?

Public Choice. Slide 1

Rationality of Voting and Voting Systems: Lecture II

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

Find the winner of the election using majority rule given the results below: Choices (ABC) (ACB) (BAC) (BCA) (CAB) (CBA) Number of Votes

Transcription:

Voting: Issues, Problems, and Systems, Continued 7 March 2014 Voting III 7 March 2014 1/27

Last Time We ve discussed several voting systems and conditions which may or may not be satisfied by a system. We ll review them. But first, let s look at some clips from reporting of the 2000 presidential election. 1 Florida called for Gore 2 Gore declared the winner in Pennsylvania 3 The vote in Florida is now too close to call Voting III 7 March 2014 2/27

Plurality Voting The method we use in the U.S. to decide most elections is called Plurality Voting. In this method, a voter chooses one candidate, and the candidate with the most votes wins. It is nearly the most simple method of deciding elections. Voting III 7 March 2014 3/27

The Borda Count With the Borda count voters rank order the candidates. If there are n candidates, each first place vote is worth n 1 points, each second place vote is worth n 2 points, and so on. The person who received the most points wins the election. Voting III 7 March 2014 4/27

Sequential Pairwise Voting In this voting system, voters rank candidates as in the Borda count. The winner is determined by comparing pairs of candidates. The loser between a comparison is eliminated and the winner is then compared to the next candidate. The last person remaining is then the winner of the election. Voting III 7 March 2014 5/27

The Hare System In the Hare system, candidates are ranked. The candidate (or candidates) with the fewest number of first place votes is eliminated. This process continues until one candidate remains, and is then elected. Once a candidate is elected, we remove that candidate from each ballot. For example, if B is eliminated, then a ballot which lists C > B > A would then be reinterpreted to have C > A. That is, C would be listed first and A second. Voting III 7 March 2014 6/27

The Four Conditions Condorcet winner criterion: The Condorcet winner (preferred over all others head to head), if there is one, always wins the election. Independence of Irrelevant Alternatives: It is impossible for a non-winning candidate B to change to winner unless at least one voter reverses the order in which they listed B and the winner. Pareto: If everybody prefers one candidate to another, then the latter is not elected. Monotonicity: If no voter were to switch his/her preference between the winner and another, then the outcome of the election would be the same. Voting III 7 March 2014 7/27

The following table summarizes how each system behaves with respect to each of the conditions. A yes means the system satisfies the condition. CWC IIA Pareto Mono Plurality no no yes yes Borda no no yes yes Sequential yes no no yes Hare no no yes no CWC = Condorcet Winner Condition IIA = Independence of Irrelevant Alternatives Mono = Monotonicity Condition Voting III 7 March 2014 8/27

Back to the 1998 Minnesota Gubernatorial Election How would the 1998 Minnesota gubernatorial election come out if other voting systems were used? To answer this we d need to have had candidates rank ordered. Let s suppose the voters would rank the three candidates, Coleman, Humphrey, and Ventura, as follows. This table is not based on exit polls. I made up the table, trying to make a reasonable guess as to what would have happened. Recall that Ventura received 37% of the first place votes, while Coleman received 35% and Humphrey 28%. 20% 25% 8% 10% 20% 17% H C H C V V C H V V C H V V C H H C Voting III 7 March 2014 9/27

Using the Borda Count With the Borda count, since there are three candidates, we assign 2 points for first place votes, 1 point for second place votes, and 0 points for third place votes. To make it easier, we pretend there are 100 votes, so the percentage refers to the number of votes. 20% 25% 8% 10% 20% 17% H C H C V V C H V V C H V V C H H C first place votes 2nd 3rd total points C 35 40 25 110 H 28 42 30 98 V 37 18 45 92 Voting III 7 March 2014 10/27

We computed Coleman s totals by: 35 2 + 40 1 + 25 0 = 70 + 40 = 110. The other totals were computed similarly. Thus, with the Borda count, Coleman wins the election. Voting III 7 March 2014 11/27

Sequential Pairwise Voting 20% 25% 8% 10% 20% 17% H C H C V V C H V V C H V V C H H C If we use sequential pairwise voting, and order them C, H, V, then Coleman is preferred to Humphrey 55% to 45%, so Humphrey is eliminated. Since Coleman is also preferred 55% to 45% over Ventura, so Coleman is elected in this system. It turns out that, in this election, the order in which we list the candidates does not affect the outcome Voting III 7 March 2014 12/27

Hare System If we use the Hare system, then Humphrey is eliminated since he received the fewest first place votes, 28%, compared to 35% and 37% for the other two candidates. We then reinterpret the ballot by eliminating Humphrey. This gives 20% 25% 8% 10% 20% 17% C C V C V V V V C V C C Voting III 7 March 2014 13/27

After reinterpreting the ballots, Coleman then has 55% first place votes to Ventura s 45%, so Coleman would win under the Hare system. So, in all of the systems, other than plurality voting, Coleman would win the election. Voting III 7 March 2014 14/27

The 1992 Presidential Election Revisited Let s make an estimate of how the voting would have been conducted if voters ranked the three main candidates, and determine who would be elected in each of the four systems we have studied. I ve made an attempt to predict how voters would rank the candidates, in order to come up with the following table. Voting III 7 March 2014 15/27

Borda count Rank 30% 13% 12% 25% 6% 13% First Clinton Clinton Bush Bush Perot Perot Second Bush Perot Clinton Perot Clinton Bush Third Perot Bush Perot Clinton Bush Clinton We assign 2 points for each first place vote and 1 point for each second place vote. To make the arithmetic easier, let s interpret the percentages as votes. Voting III 7 March 2014 16/27

Some Clicker Questions Rank 30% 13% 12% 25% 6% 13% First Clinton Clinton Bush Bush Perot Perot Second Bush Perot Clinton Perot Clinton Bush Third Perot Bush Perot Clinton Bush Clinton Q How many points does Clinton get? A Clinton: 43 first place votes and 18 second place votes. Total points, 43 2 + 18 1 = 104 Voting III 7 March 2014 17/27

Rank 30% 13% 12% 25% 6% 13% First Clinton Clinton Bush Bush Perot Perot Second Bush Perot Clinton Perot Clinton Bush Third Perot Bush Perot Clinton Bush Clinton Q How many points does Bush get? A Bush: 37 first place votes and 43 second place votes. Total points, 37 2 + 43 1 = 117 Voting III 7 March 2014 18/27

Rank 30% 13% 12% 25% 6% 13% First Clinton Clinton Bush Bush Perot Perot Second Bush Perot Clinton Perot Clinton Bush Third Perot Bush Perot Clinton Bush Clinton Q How many points does Perot get? A Perot: 19 first place votes and 38 second place votes. Total points, 19 2 + 38 1 = 76 Since Bush has the most points, he would be elected. Voting III 7 March 2014 19/27

Pairwise Sequential Voting Rank 30% 13% 12% 25% 6% 13% First Clinton Clinton Bush Bush Perot Perot Second Bush Perot Clinton Perot Clinton Bush Third Perot Bush Perot Clinton Bush Clinton Let us first order the candidates Bush, Clinton, Perot. We compare Clinton and Bush head to head. Bush is preferred to Clinton by 51% of the voters. Therefore, Clinton is eliminated. Bush is then compared to Perot head to head, and Bush is preferred. Perot is then eliminated. Bush is the one remaining, so he is elected. Other orderings of the candidates turn out to produce the same result. Voting III 7 March 2014 20/27

Hare System We first eliminate the candidate with the fewest first place votes. This is Perot, so he is eliminated. We next reinterpret each vote to rank only Clinton and Bush. This yields the following table. Original vote Rank 30% 13% 12% 25% 6% 13% First Clinton Clinton Bush Bush Perot Perot Second Bush Perot Clinton Perot Clinton Bush Third Perot Bush Perot Clinton Bush Clinton Reinterpreted vote Rank 30% 13% 12% 25% 6% 13% First Clinton Clinton Bush Bush Clinton Bush Second Bush Bush Clinton Clinton Clinton Bush Voting III 7 March 2014 21/27

Reinterpreted vote Rank 30% 13% 12% 25% 6% 13% First Clinton Clinton Bush Bush Clinton Bush Second Bush Bush Clinton Clinton Clinton Bush In the reinterpreted vote, Clinton receives 49% of the first place votes and Bush 51%. Therefore, Clinton is eliminated. Thus, Bush is elected with the Hare system. Voting III 7 March 2014 22/27

The 2000 Presidential Election Since Gore won the popular vote, he would have won with plurality voting. Gore would also have won with sequential pairwise voting, and with the Hare system. It is less clear to me who would have won with the Borda count. Voting III 7 March 2014 23/27

So, what voting system should we use? Thinking about the various voting systems we have considered, and the fact that all of them violate a reasonable condition, leads one to ask the following question: Is there a voting system which satisfies all four conditions we have introduced? Such a system would be better than any we have discussed. Voting III 7 March 2014 24/27

Arrow s Theorem Kenneth Arrow, who won the Nobel prize in Economics in 1972, proved in 1951 that all voting systems have flaws. More precisely, he proved that there does not and cannot exist a voting system which satisfies both the Condorcet Winner condition and the Independence of Irrelevant Alternatives. Arrow s theorem says, therefore, that no matter what voting system we use, there will be flaws with it. To determine what voting system to use in a given situation, we should then consider what advantages and disadvantages systems have, and what are our priorities. We can then try to pick a reasonable system that will reflect the priorities. In practice, this is a complicated political problem. Voting III 7 March 2014 25/27

Homework #6, due next Friday Assignment 6 is on the course website. It is due by next Friday. Next week we will discuss Apportionment. More specifically, we will discuss how seats in the U.S. House of Representatives have been and are assigned, or apportioned, among the states. Voting III 7 March 2014 26/27