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

Similar documents
The Mathematics of Voting. The Mathematics of Voting

Fairness Criteria. Review: Election Methods

The Impossibilities of Voting

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

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

Arrow s Impossibility Theorem

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

12.2 Defects in Voting Methods

1.6 Arrow s Impossibility Theorem

Chapter 1 Practice Test Questions

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

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

Exercises For DATA AND DECISIONS. Part I Voting

Elections with Only 2 Alternatives

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.

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

Intro to Contemporary Math

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

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

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

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

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

Voting: Issues, Problems, and Systems, Continued

answers to some of the sample exercises : Public Choice

Mathematical Thinking. Chapter 9 Voting Systems

The Mathematics of Voting

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.

9.3 Other Voting Systems for Three or More Candidates

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

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

Sect 13.2 Flaws of Voting Methods

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

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

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

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

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

Introduction: The Mathematics of Voting

The Mathematics of Voting

Economics 470 Some Notes on Simple Alternatives to Majority Rule

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

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

Voting Criteria April

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

Social Choice & Mechanism Design

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

Voting Methods

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

Math for Liberal Studies

Social welfare functions

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

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

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

Syllabus update: Now keeping best 3 of 4 tests

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

Math for Liberal Arts MAT 110: Chapter 12 Notes

Practice TEST: Chapter 14

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

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

Lecture 16: Voting systems

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

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

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

Homework 7 Answers PS 30 November 2013

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

CS 886: Multiagent Systems. Fall 2016 Kate Larson

(c) 2013 Janice L. Epstein Voting Methods 1

Many Social Choice Rules

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

Introduction to the Theory of Voting

Math Circle Voting Methods Practice. March 31, 2013

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

Introduction to Social Choice

Simple methods for single winner elections

Rationality of Voting and Voting Systems: Lecture II

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

Main idea: Voting systems matter.

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

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

The Mathematics of Elections

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

VOTING SYSTEMS AND ARROW S THEOREM

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

Voting System: elections

Rock the Vote or Vote The Rock

Josh Engwer (TTU) Voting Methods 15 July / 49

Computational Social Choice: Spring 2007

Voting Fairness Idea: Condorcet Criterion (CO)

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

Section 7.1: Voting Systems. Plurality Method The candidate who receives the greatest number of votes is the winner.

The Math of Rational Choice - Math 100 Spring 2015

How should we count the votes?

2-Candidate Voting Method: Majority Rule

Chapter 4: Voting and Social Choice.

MATH 1340 Mathematics & Politics

Algorithms, Games, and Networks February 7, Lecture 8

Public Choice. Slide 1

Lecture 12: Topics in Voting Theory

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

Decision making and problem solving Lecture 10. Group techniques Voting MAVT for group decisions

Transcription:

We have discussed: Voting Theory Arrow s Impossibility Theorem Voting Methods: Plurality Borda Count Plurality with Elimination Pairwise Comparisons Voting Criteria: Majority Criterion Condorcet Criterion Monotonicity Criterion Independence of Irrelevant Alternatives Criterion Who gets second? Third? etc. Rankings The MAS is electing president, vice president and treasurer. Let first choice be president, second choice the vice president, etc. Who wins which position under the plurality method? Number of voters 0 First choice A C B C Second choice B B C Third choice C B C B Fourth choice A A A A

2 Office Place Candidate # first place votes President First A Vice Second C Treasurer Third Fourth B Call ranking methods Extended Use Extended Borda Count to assign positions for the MAS election. Borda Count results: A: + 0 + + + = 79 B: 3 + 0 3 + 2 + + 2 = 06 C: 2 + 0 + 3 + 2 + = 0 : + 0 2 + + 3 + 3 = Ranking: B,C,,A Use Extended Plurality-with-Elimination to assign positions for the MAS election. Number of voters 0 First choice A C B C Second choice B B C Third choice C B C B Fourth choice A A A A Ranking:, A, C, B

3 Try Extended Pairwise Comparison on MAS example: From previous work: A B A C A 0 0 0 B C B C 0 0 0 Ranking: C, B,, A Try Extended Plurality-with-Elimination on the Where to Eat inner? example. Preference Schedule: Where to eat? Number of voters 2 5 First choice A B C Second choice B C A Third choice C A B Ranking: C, A, B

Recursive Ranking Methods Ranks candidates by using the chosen voting method to find each place. Step : ecide on a voting method Step 2: Use the method to find the winner- this candidate gets first place Step 3: Make a new preference schedule without the first place candidate. Step : Use the modified preference schedule and chosen voting method to find the winner- this candidiate gets second place. Step 5: Make a new preference schedule without the first or second place candidates. Repeat as needed until all candidates have been ranked. MAS Example Number of voters 0 First choice A C B C Second choice B B C Third choice C B C B Fourth choice A A A A

5 Recursive Plurality Method: Step : Note- use Plurality Step 2: A wins Step 3: Preference schedule without A Number of voters 0 First choice B C B C Second choice C B C Third choice B C B Step : Find winner by plurality: B Step 5: Remove B from schedule: Number of voters 0 First choice C C C Second choice C C Step 6: Find winner by plurality.(last time) C has 25 votes, has 2. Ranking: First Place: A Second Place: B Third Place: C Fourth Place:

6 Try Recursive Pairwise: A B A C A 0 0 0 B C B C 0 0 0 C is winner, so remove C from the schedule. Count again, and B wins. Remove B. Between and A, wins. Ranking for MAS Recursive Pairwise: First: C Second: B Third: Fourth: A

7 Recursive Plurality-with-Elimination Number of voters 0 First choice A C B C Second choice B B C Third choice C B C B Fourth choice A A A A Plurality with Elimination: Eliminate the candidates with the fewest first place votes until one candidate has a majority. (9 votes in this example) From Previous Work, is winner. Recursive Plurality with Elimination: Remove as first place, do the method again to find second place. Number of voters 0 First choice A C C B C Second choice B B B C B Third choice C A A A A o plurality with elimination again. Notice C has 9 votes, a majority. C wins second place overall.

Number of voters 0 First choice A B B B B Second choice B A A A A B wins this round, taking third overall. A is last. Ranking: First: Second: C Third: B Fourth: A Try Recursive Plurality-with-Elimination on the Favorite Fruit example. Preference Schedule: Favorite Fruit Number of voters 2 2 First choice M B M Second choice P M A Third choice A A P Fourth choice B P B Round : M has majority, gets first place.

9 Round 2: Modified preference schedule Preference Schedule: Favorite Fruit Number of voters 2 2 First choice P B A Second choice A A P Third choice B P B No one has majority, A has fewest first place votes. With A removed, P has a majority and takes second place. Preference Schedule: Favorite Fruit Number of voters 2 2 First choice A B A Second choice B A B A has majority, takes third. B is last. Ranking First: M Second: P Third: A Fourth: B

0 Chapter One Summary Voting Theory Arrow s Impossibility Theorem Voting Methods: Plurality Borda Count Plurality with Elimination Pairwise Comparisons Extended Plurality Extended Borda Count Extended Plurality with Elimination Extended Pairwise Comparisons Recursive Plurality Recursive Borda Count Recursive Pairwise Comparisons Recursive Plurality with Elimination Voting Criteria: Majority Criterion Condorcet Criterion Monotonicity Criterion Independence of Irrelevant Alternatives Criterion