Math for Liberal Studies

Similar documents
Math for Liberal Arts MAT 110: Chapter 12 Notes

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

9.3 Other Voting Systems for Three or More Candidates

Exercises For DATA AND DECISIONS. Part I Voting

Elections with Only 2 Alternatives

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

The Mathematics of Voting. The Mathematics of Voting

12.2 Defects in Voting Methods

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

Fairness Criteria. Review: Election Methods

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

Arrow s Impossibility Theorem

1.6 Arrow s Impossibility Theorem

MATH 1340 Mathematics & Politics

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

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

Introduction: The Mathematics of Voting

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

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

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

The Impossibilities of Voting

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

Voting Criteria April

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

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

Voting: Issues, Problems, and Systems, Continued

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

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

Social welfare functions

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

Mathematical Thinking. Chapter 9 Voting Systems

Voting Methods

Chapter 1 Practice Test Questions

Intro to Contemporary Math

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

Many Social Choice Rules

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

Math for Liberal Studies

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

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

Vote for Best Candy...

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

Rock the Vote or Vote The Rock

Economics 470 Some Notes on Simple Alternatives to Majority Rule

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

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

Josh Engwer (TTU) Voting Methods 15 July / 49

answers to some of the sample exercises : Public Choice

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

The Mathematics of Elections

Math Circle Voting Methods Practice. March 31, 2013

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

How should we count the votes?

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

Voting with Bidirectional Elimination

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

The Mathematics of Voting

PROBLEM SET #2: VOTING RULES

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

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

Simple methods for single winner elections

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

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

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

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

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

Lecture 16: Voting systems

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

Main idea: Voting systems matter.

Voting. Hannu Nurmi. Game Theory and Models of Voting. Public Choice Research Centre and Department of Political Science University of Turku

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

Constructing voting paradoxes with logic and symmetry

Voting: Issues, Problems, and Systems

Chapter 9: Social Choice: The Impossible Dream

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

Syllabus update: Now keeping best 3 of 4 tests

The mathematics of voting, power, and sharing Part 1

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

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.

Kybernetika. Robert Bystrický Different approaches to weighted voting systems based on preferential positions

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

VOTING SYSTEMS AND ARROW S THEOREM

Public Choice. Slide 1

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

Computational Social Choice: Spring 2007

Social Choice & Mechanism Design

Rationality of Voting and Voting Systems: Lecture II

Homework 7 Answers PS 30 November 2013

(c) 2013 Janice L. Epstein Voting Methods 1

2-Candidate Voting Method: Majority Rule

Voting Systems. High School Circle I. June 4, 2017

1.1 The Basic Elements of an Election 1.2 The Plurality Method

Voting Fairness Idea: Condorcet Criterion (CO)

The Mathematics of Voting

The Math of Rational Choice - Math 100 Spring 2015

Computational Social Choice: Spring 2017

Sect 13.2 Flaws of Voting Methods

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

Voting Lecture 3: 2-Candidate Voting Spring Morgan Schreffler Office: POT Teaching.

Transcription:

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 a few more: sequential pairwise voting contingency voting instant-runoff voting

Idea: We like pairwise voting since we can use majority rule If we look at all pairwise elections (Condorcet s method), we sometimes don t get a winner In sequential pairwise voting, we put the candidates in order on a list, called an agenda

We pit the first two candidates on the agenda against each other. The winner moves on to face the next candidate on the list, and so on. The candidate remaining at the end is the winner. This process resembles a tournament bracket, and has the advantage that, unlike Condorcet s method, we always get a winner

Let s use sequential pairwise voting with this profile and the agenda Adam, Beth, Chris, David Voters Preference Order 4 A > B > D > C 3 C > A > B > D 3 B > D > C > A

First we consider the Adam vs. Beth matchup Voters Preference Order 4 A > B > D > C 3 C > A > B > D 3 B > D > C > A

Adam wins, 7 to 3 Voters Preference Order So Adam moves on to face Chris 4 A > B > D > C 3 C > A > B > D 3 B > D > C > A

Adam vs. Chris Voters Preference Order Chris wins 6 to 4 4 A > B > D > C 3 C > A > B > D 3 B > D > C > A

Adam vs. Chris Voters Preference Order Chris wins 6 to 4 4 A > B > D > C 3 C > A > B > D 3 B > D > C > A

The final matchup is Chris vs. David David wins 7 to 3 Voters Preference Order 4 A > B > D > C 3 C > A > B > D 3 B > D > C > A

The final matchup is Chris vs. David David wins 7 to 3 Voters Preference Order 4 A > B > D > C 3 C > A > B > D 3 B > D > C > A

So David is the winner of the election Voters Preference Order 4 A > B > D > C 3 C > A > B > D 3 B > D > C > A

If we look closely at this agenda, we notice that every single voter prefers B over D, and yet D was our winner! Voters Preference Order 4 A > B > D > C 3 C > A > B > D 3 B > D > C > A If we had used the agenda B, D, C, A, the first matchup would be B vs. D, which B wins 10 to 0!

In fact, by cleverly choosing the right agenda, we could make any of the four candidates win this election Voters Preference Order 4 A > B > D > C 3 C > A > B > D 3 B > D > C > A Sequential pairwise voting does not satisfy the Pareto condition

If every single voter prefers one candidate over another, then the second candidate should not be the winner Named for Vilfredo Pareto (1848-1923), Italian economist Does plurality satisfy the Pareto condition?

If every voter in a plurality election prefers A over B, then how many first-place votes does B get? Zero! Therefore B cannot be the winner So plurality does satisfy the Pareto condition

A runoff election occurs after an initial election when a clear winner has not been decided. Runoff elections are common in situations where there are three or more candidates and none of them get a majority of the votes. For example, there was recently a runoff election during the 2008 Georgia Senate race.

There were three candidates: Saxby Chambliss (R) Jim Martin (D) Allen Buckley (Libertarian)

The results of the November election were Chambliss 1,867,090 (49.8%) Martin 1,757,419 (46.8%) Buckley 128,002 (3.4%) Chambliss was the plurality winner

However, Georgia law mandates a runoff election when no candidate receives a majority The runoff is a majority rule vote between the top two candidates In this case, the runoff was in December between Chambliss and Martin

Why did there need to be a second election? Couldn t we just eliminate Buckley and use the existing votes? Chambliss 1,867,090 (49.8%) Martin 1,757,419 (46.8%) Buckley 128,002 (3.4%) If we do that, we disenfranchise 128,002 voters!

There is no way to know who those 128,002 voters would have chosen with only Chambliss and Martin as their choices The runoff election was held in early December 2008

Since the runoff was only deciding this one contest, turnout was much lower than in November Chambliss 1,228,033 (57.4%) Martin 909,923 (42.6%) Chambliss won his 2 nd term in the Senate

If the voters in Georgia had been asked for their full preference orders rather than just their top choice, then the second election would not have been necessary We would know who the Buckley voters would have voted for, and the winner could have been calculated instantly

Voters rank all candidates in a preference order If one candidate wins a majority of the firstplace votes, then that candidate is the winner If not, then we eliminate all candidates except the two who got the most first-place votes. Then, using the full voter profile, the winner of an election between those two candidates is decided by majority rule.

Consider this profile C has the most first place votes (10), but this is not a majority Number of Voters Preference 8 C > A > B > D 6 B > D > C > A 4 A > C > D > B 3 D > A > B > C 2 C > A > D > B The top two are B and C

We eliminate A and D The winner of the B vs. C matchup is C (14 to 9) Number of Voters Preference 8 C > A > B > D 6 B > D > C > A 4 A > C > D > B 3 D > A > B > C 2 C > A > D > B So C is the contingency winner

Contingent voting seems like a good method However, it has a serious problem that we will see in the next example Suppose we have an election with three candidates: Alison, Barbara, and Christine We ll use contingent voting to decide the winner

Here is the voter profile A has the most first place votes, but not a majority Number of Voters The top two are A and B, so we eliminate C Preference 37 A > B > C 35 B > C > A 28 C > A > B

Here is the voter profile A has the most first place votes, but not a majority Number of Voters The top two are A and B, so we eliminate C A wins the A vs. B matchup, 65 to 35 Preference 37 A > B > C 35 B > C > A 28 C > A > B

Number of Voters Let s suppose some time goes by, and now there is another election with the same candidates Preference 37 A > B > C 35 B > C > A 28 C > A > B This time, some of the voters who had B ranked first decide that they like A better now

Suppose 10 voters who had preference B>C>A now have preference A>B>C Number of Voters Preference 37 A > B > C 35 B > C > A 28 C > A > B

Suppose 10 voters who had preference B>C>A now have preference A>B>C Number of Voters +10 Preference 37 A > B > C 10 35 B > C > A 28 C > A > B

Suppose 10 voters who had preference B>C>A now have preference A>B>C Number of Voters Preference 47 A > B > C 25 B > C > A 28 C > A > B Notice that A has moved up on those ballots, but the other candidates stayed in the same order (B>C)

Who wins now? Number of Voters A now has 47 first place votes, but that still is not a majority Preference 47 A > B > C 25 B > C > A 28 C > A > B Now A and C are the top two, so eliminate B

Who wins now? Number of Voters A now has 47 first place votes, but that still is not a majority Preference 47 A > B > C 25 B > C > A 28 C > A > B Now A and C are the top two, so eliminate B But now C wins the A vs. C matchup, 53 to 47!

By moving A higher on their ballots, those 10 voters caused A to lose the election! This shows that contingent voting is not monotone

Recall that we used the word monotone when we discussed two-candidate elections With two candidates, monotone means: if one or more voters change their votes from the loser to the winner, then the original winner should still be the winner

Recall that we used the word monotone when we discussed two-candidate elections With more than two candidates, monotone means: if one or more voters change their ballot so that the original winner is ranked higher (but the order of the other candidates is not changed), then the original winner should still be the winner

In our example, the original winner was Alison Then some voters moved Alison from last place on their ballots up to first place, but kept the order of the other candidates the same The result was that Alison was no longer the winner!

This is a variation of the contingent method Instead of eliminating all but the top two right away, we eliminate candidates one at a time

First check to see if any candidate has received a majority of the first-place votes If not, then the candidate that received the fewest first-place votes is eliminated Recalculate the voter preferences, and again check to see if a candidate now has a majority of the first-place votes. If not, then repeat this process, eliminating candidates until one candidate has a majority.

In this profile, A has 4 first-place votes, B has 3, C has 3, and D has 2 No candidate has a majority Voters Preference Order 4 A > B > C > D 3 C > D > B > A 3 B > C > D > A 2 D > B > A > C So we eliminate the candidate in last place: D

Now A has 4 votes, B has 5, and C has 3 Still no majority, so we eliminate C Voters Preference Order 4 A > B > C > D 3 C > D > B > A 3 B > C > D > A 2 D > B > A > C

Finally we have A with 4 votes and B with 8 So B wins! Voters Preference Order 4 A > B > C > D 3 C > D > B > A 3 B > C > D > A 2 D > B > A > C

From 1946 2009 the Oscar for Best Picture was determined from 5 candidates via plurality vote. Preferential voting has been traditionally been used by the Academy in determining nominees. Changed to a preferential voting system because they thought it was more fair due to increase in nominees (10) and the number of potential voters.

If there is a tie for who to eliminate when you are using the instant-runoff method, eliminate all the tied candidates, unless this would eliminate everyone

Notice that with three candidates, contingent voting and instant-runoff voting are the same thing Since we showed contingent voting isn t monotone using an example with 3 candidates, that same example shows that instant-runoff also fails the monotone condition also

We have studied many methods, and found problems with each one Condorcet s method sometimes doesn t give a winner Plurality voting fails the Condorcet winner criterion Rank methods suffer from the spoiler effect Sequential pairwise voting fails the Pareto condition Runoff methods fail the monotone condition

We could continue to search for a fair voting system that doesn t suffer from any of these problems We could also consider trying to use a different kind of ballot, since all of the systems we have considered so far use preference-order ballots We ll explore these ideas in the next section