Math Circle Voting Methods Practice. March 31, 2013

Similar documents
Chapter 9: Social Choice: The Impossible Dream Lesson Plan

The Impossibilities of Voting

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

Voting Criteria April

Elections with Only 2 Alternatives

9.3 Other Voting Systems for Three or More Candidates

Main idea: Voting systems matter.

The mathematics of voting, power, and sharing Part 1

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

Arrow s Impossibility Theorem

Math for Liberal Arts MAT 110: Chapter 12 Notes

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

1.6 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.

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

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

Lecture 11. Voting. Outline

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.

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

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

Chapter 1 Practice Test Questions

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

Fairness Criteria. Review: Election Methods

Josh Engwer (TTU) Voting Methods 15 July / 49

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

Voting: Issues, Problems, and Systems, Continued

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

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

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

Voting Methods

Chapter 9: Social Choice: The Impossible Dream

Many Social Choice Rules

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

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

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

The Mathematics of Voting. The Mathematics of Voting

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

Simple methods for single winner elections

MATH 1340 Mathematics & Politics

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

What is the Best Election Method?

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

PROBLEM SET #2: VOTING RULES

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

Math for Liberal Studies

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

answers to some of the sample exercises : Public Choice

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

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

Font Size: A A. Eric Maskin and Amartya Sen JANUARY 19, 2017 ISSUE. 1 of 7 2/21/ :01 AM

2-Candidate Voting Method: Majority Rule

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

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: Issues, Problems, and Systems. Voting I 1/36

Math for Liberal Studies

12.2 Defects in Voting Methods

Homework 7 Answers PS 30 November 2013

The Mathematics of Voting

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

Intro to Contemporary Math

Lecture 16: Voting systems

VOTING SYSTEMS AND ARROW S THEOREM

Is Majority Rule the Best Voting Method? Partha Dasgupta and Eric Maskin

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

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

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

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

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

Social welfare functions

Sect 13.2 Flaws of Voting Methods

Exercises For DATA AND DECISIONS. Part I Voting

Mathematical Thinking. Chapter 9 Voting Systems

The Mathematics of Voting

Vote for Best Candy...

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

Social Choice & Mechanism Design

Preference Forms These tables may be useful for scratch work.

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

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

1.1 The Basic Elements of an Election 1.2 The Plurality Method

Problems with Group Decision Making

Rock the Vote or Vote The Rock

The Iowa Caucuses. (See Attached Page Below) B R C T R B R R C C B C T T T B

Computational Social Choice: Spring 2007

Voting: Issues, Problems, and Systems

How should we count the votes?

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

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

Chapter 4: Voting and Social Choice.

Arrow s Impossibility Theorem on Social Choice Systems

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

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

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

Voting in Maine s Ranked Choice Election. A non-partisan guide to ranked choice elections

Possible voting reforms in the United States

Problems with Group Decision Making

Reality Math Sam Kaplan, The University of North Carolina at Asheville Dot Sulock, The University of North Carolina at Asheville

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

Public Choice. Slide 1

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

Transcription:

Voting Methods Practice 1) Three students are running for class vice president: Chad, Courtney and Gwyn. Each student ranked the candidates in order of preference. The chart below shows the results of the voting. 6 boys 4 boys 8 girls 4 girls First choice Chad Chad Gwyn Courtney Second choice Courtney Gwyn Courtney Gwyn Third choice Gwyn Courtney Chad Chad Notes on reading the chart: The first row tells you how many students voted with a ranking that is indicated by the corresponding column. For example, the entry in the first row, last column tells you that four girls turned in ballots with 1-Courtney, 2-Gwyn, and 3-Chad. (a) How many students voted? How many boys? How many girls? (b) Use the Plurality Voting Method to determine who wins the election. (c) Use the Vote-for-Two Method to determine the winner.

(d) president. Use the Borda Count Method to determine the class s new vice (e) Does anything seem strange? (f) If you had voted 1-Chad, 2-Courtney, 3-Gwyn, which voting method would you prefer? Why? (g) Does the fact that there are more boys than girls in the class seem to affect the outcome for any of the methods?

Transitivity and Condorcet Winners If a person prefers A over B, and B over C, then it stands to reason that she must prefer A over C. But when more than one person expresses their preferences for three or more alternatives, odd things can happen that might not seem reasonable. Transitivity: If a > b and b > c, then a > c. This works for real numbers, and for an individual s preferences in an election with three candidates. For example, let s say there is going to be a big celebration dinner for the Math Circle participants and their families. There will be sixty people attending. Professor Thornton books the party room at a fancy restaurant. In order to keep things easier to manage, there will be only one menu offering. The choices are salmon or chicken. Professor Thornton asks everyone to submit their preferences, and will use these to select the dinner that the majority prefers. The results are that 40 people voted for salmon, and 20 for chicken. So Blake intends to order salmon. But when he calls the restaurant, the owner says that there has been a problem with their fish guy, and now the choice is chicken or beef. It turns out that 45 people would prefer chicken, and 15 would prefer beef. So Blake orders the chicken, and considers the job done. But the next day, the owner calls to say that she has a new fish guy that she really likes, and there is a salmonella scare, so many people are avoiding chicken. She wants to know if Blake would rather switch back to the group s original first choice, salmon. He is tempted to just say yes, but knows that since the students have just learned a bunch about voting, they will be happy to vote again, so he asks them which they prefer: salmon or chicken? To his surprise, these are the results: 35 people prefer beef, and 25 prefer salmon. How can this be?

1) Can you complete this chart to accurately illustrate the voting preferences of the voters? 25 people people 15 people First choice salmon beef Second choice beef salmon Third choice chicken 2) What if the 15 people in the last column had actually voted for 1) beef, 2) chicken, 3) salmon? 25 people people 15 people First choice salmon beef Second choice beef chicken Third choice salmon In this case, chicken would be called the Condorcet winner. That is, if chicken were pitted in a one-on-one race against any one of the other choices, it would win. Unfortunately, as we just saw, there isn t always a Condorcet winner. 3) Look at the results from the classroom voting on the first worksheet. How many students preferred Courtney over Chad? How many students preferred Chad over Gwyn? How many students preferred Courtney over Gwyn? 4) Is Courtney a Condorcet winner? Is there a Condorcet winner in that election?

Arrow s Impossibility Theorem Arrow s Impossibility Theorem (Starbird/Berger) When there are three or more alternatives, it is impossible to devise any voting scheme (that is, a rule for taking the voters transitively ranked orderings of the candidates and producing one cumulative ranking for the group) other than a dictatorship that will order the alternatives or select the winner in a manner that satisfies the following principles: 1) Go along with the consensus If it is unanimous, then we have a winner. 2) Throwing out a loser will not change the election. 3) Changing a vote to favor a candidate will not result in that candidate s ranking dropping. Example 1: It is possible in the runoff scenario 1 that Sarah might be preferred by all of the students over the eventual winner. This illustrates how principle 1 might fail. Example 2: Many people believe that, had Ralph Nader dropped out of the 2000 U.S. presidential race, Al Gore would have won the election. This illustrates how principle 2 might fail. Example 3: Classroom runoff example shows how principle 3 might fail. Applications: Economics, Social Choices, Game Theory

Runoffs and Throwing Out Losers Examples The class from the first example is going to have a new election. This time, there are two boys and three girls running for the position: Chad, Cliff, Courtney, Gwyn and Sarah. Recall that there are 10 boys in the class, and 12 girls. The new election will be held as a runoff. This means that there will be two rounds of voting. For the first round, the voters express their first choice, and the two candidates with the most votes go on to the second round. The candidate with the most votes after the second round wins. 1) Suppose the boys votes are split evenly between Chad and Cliff, and the girls votes are split evenly among the three female candidates. Who will be in the runoff? Let s say that the second round is very close, but Chad manages to win over Cliff. 2) Suppose that before the first round of voting, Chad campaigns harder, and gets more than 5 of the boys votes. Who will be in the runoff this time? The girl that is running against Chad has the backing of all the other girls in the class, and handily beats him in the runoff. 3) Does this seem fair? Originally, she might have had fewer votes than Chad when there were five candidates. Recall: One of Arrow s principles is that if a voter changes his or her vote to now favor a given candidate (as at least one of the boys did), then that change should not lead to a worse result for that candidate. So the runoff method doesn t satisfy that principle.

Now the class is going to try another voting method for the election involving the five candidates Chad, Cliff, Courtney, Gwyn and Sarah. We will call this method Throwing Out Losers. Each voter indicates their least favorite candidate. The candidate who gets the most of the least favorite votes is eliminated, then the process is repeated until there is a winner. 4) Suppose that Sarah is the first choice of each girl, but the boys like her the least. The girls equally dislike Chad and Cliff more than the other candidates. Is there a way for Chad to win this election? Explain. 5) Even though Sarah was the first choice of most of the class, there is no way for her to win this election. Does that seem fair? 6) Suppose that before the election is held, Cliff decides not to run. Assuming that they follow the pattern already established, how will the girls vote in the first round? 7) What happened to Chad? He would have won if Cliff (who didn t have a chance of winning) had stayed in the election. Does that seem fair? This shows how the second principle of Arrow s Theorem can fail. Throwing out a loser changed the result. It also shows that this method doesn t necessarily reflect the preference of the majority of the group, since Sarah could lose even though she would beat any other candidate in a head-to-head contest.