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

Similar documents
The Mathematics of Voting. The Mathematics of Voting

1.6 Arrow s Impossibility Theorem

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.

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

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

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

Chapter 1 Practice Test Questions

Fairness Criteria. Review: Election Methods

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.

12.2 Defects in Voting Methods

Elections with Only 2 Alternatives

Voting: Issues, Problems, and Systems, Continued

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

The Impossibilities of Voting

Intro to Contemporary Math

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

Mathematical Thinking. Chapter 9 Voting Systems

9.3 Other Voting Systems for Three or More Candidates

Introduction: The Mathematics of Voting

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

Main idea: Voting systems matter.

Exercises For DATA AND DECISIONS. Part I Voting

Sect 13.2 Flaws of Voting Methods

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

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

The Mathematics of Voting

Josh Engwer (TTU) Voting Methods 15 July / 49

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

Voting Methods

Math for Liberal Arts MAT 110: Chapter 12 Notes

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

answers to some of the sample exercises : Public Choice

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

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

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

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

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, Continued. Voting II 1/27

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

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

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

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

The Mathematics of Voting

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

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

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

Math for Liberal Studies

Voting: Issues, Problems, and Systems

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

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

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

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

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

Math Circle Voting Methods Practice. March 31, 2013

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

Chapter 9: Social Choice: The Impossible Dream

The Mathematics of Elections

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

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 rules: (Dixit and Skeath, ch 14) Recall parkland provision decision:

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

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

Social welfare functions

The Math of Rational Choice - Math 100 Spring 2015

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

Computational Social Choice: Spring 2007

Rock the Vote or Vote The Rock

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

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

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

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Arrow s Impossibility Theorem on Social Choice Systems

Simple methods for single winner elections

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

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

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

Introduction to the Theory of Voting

MATH 1340 Mathematics & Politics

Many Social Choice Rules

Voting Criteria April

2-Candidate Voting Method: Majority Rule

VOTING SYSTEMS AND ARROW S THEOREM

Rationality & Social Choice. Dougherty, POLS 8000

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

(c) 2013 Janice L. Epstein Voting Methods 1

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

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

Practice TEST: Chapter 14

Lecture 11. Voting. Outline

How should we count the votes?

Homework 7 Answers PS 30 November 2013

Social Choice & Mechanism Design

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

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

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

CS 886: Multiagent Systems. Fall 2016 Kate Larson

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

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

Lecture 16: Voting systems

Transcription:

Part II Other Methods of Voting and Other "Fairness Criteria" Plurality with Elimination Method Round 1. Count the first place votes for each candidate, just as you would in the plurality method. If a candidate has a majority of first place votes, that candidate is the winner. Otherwise, eliminate the candidate (or candidates if there is a tie) with the fewest first place votes.

Plurality with Elimination Method Round 2. Cross out the name(s) of the candidates eliminated from the preference and recount the first place votes. Plurality with Elimination Method Round 3, 4, etc. Repeat the process, each time eliminating one or more candidates until there is a candidate with a majority of first place votes. That candidate is the winner of the election.

So what is wrong with the plurality with elimination method? The Monotonicity Criterion If candidate X is a winner of an election and, in a reelection, the only changes in the ballots are changes that favor X (and only X), then X should remain a winner of the election. Suppose the votes are as follows: Monotonicity Criterion 39 35 26 is eliminated, thus transferring votes to, who is elected with a majority. Four years later... She then serves a full term, and does such a good job that she persuades ten of 's supporters to change their votes to her at the next election. Who wins by Elimination in this election? Why does that seem wrong? The Method of Pairwise Comparisons In a pairwise comparison between between X and Y, every vote is assigned to either X or Y, the vote going to whichever of the two candidates is listed higher on the ballot. The winner is the one with the most votes; if the two candidates split the votes equally, it ends in a tie. Final Tally: A 3, B 2.5, C 2, D 1.5, E 1. (Choice A loses to B and beats C,D, and E) A wins.

So what is wrong with the method of pairwise comparisons? The Independence of Irrelevant Alternatives Criterion (IIA) If candidate X is a winner of an election and in a recount one of the non winning candidates is removed from the ballots, then X should still be a winner of the election. Eliminate C (an irrelevant alternative) from this election and B wins (rather than A). Using oour ballots from class for the presidential election... Romney = A Paul = B Gingrich = C Obama = D Who wins under each of the methods? Plurality = Borda Count = Elimination = Pairwise Comparison I changed the number of the 5th ballot to 6. And we get three different winners under the four methods

How Many Pairwise Comparisons? In an election between 5 candidates, there were 10 pairwise comparisons. We could also count as an problem. How? How many more comparisons would there be with 6 candidates? Methods of Vote Counting Plurality Borda Count Plurality with Elimination Pairwise Comparisons Others Fairness Criteria Majority Criterion Condorcet Criterion Monotonicity Criterion Independence of Irrelevant Alternatives Criterion Others Arrow s Impossibility Theorem It is mathematically impossible for a democratic voting method to satisfy all of the fairness criteria (in every possible case, when there are three or more candidates). Wikipedia Voting Systems Page Wikipedia Arrows Impossibility Theorem Wikipedia Page on Kenneth Aarow

Nice Web Page to Compare Several Types of Voting Methods Examples from Homework to Work on in Class. They all use the same preference ballots. Election for the chair of the Mathematics Department. Candidates Argand, Brandt, Chavez, Dietz, and Epstein. 3. How many people voted? How many first place votes needed for majority? Which candidate had most first place votes? Which candidate had the most last place votes? 17. Find the winner under the Borda Count Method? Examples from Homework to Work on in Class. They all use the same preference ballots. Election for the chair of the Mathematics Department. Candidates Argand, Brandt, Chavez, Dietz, and Epstein. 27. Find the winner under plurality with elimination method. Suppose that before the election, Chavez withdraws from the race. Find the winner under plurality with elimination.

Examples from Homework to Work on in Class. They all use the same preference ballots. Election for the chair of the Mathematics Department. Candidates Argand, Brandt, Chavez, Dietz, and Epstein. 27. Find the winner using the method of pairwise comparison.

Attachments Heisman Trophy Winner Selection Alternate Voting Methods for Presidential Primaries Results of Bush, Gore, Nader Presidential Vote in 2000 Wikipedia Article on Voting Methods and Criteria Monotonicity Criterion Wikipedia Voting Systems Page wikipedia Arrows Impossibility Theorem Wikipedia Page on Kenneth Aarow Nice Web Page to Compare Several Types of Voting Methods