Intro to Contemporary Math

Similar documents
1.6 Arrow s Impossibility Theorem

Arrow s Impossibility Theorem

The Mathematics of Voting. The Mathematics of Voting

Chapter 1 Practice Test Questions

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

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

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

Fairness Criteria. Review: Election Methods

The Impossibilities of Voting

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

Voting: Issues, Problems, and Systems, Continued

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

Exercises For DATA AND DECISIONS. Part I Voting

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.

Elections with Only 2 Alternatives

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

12.2 Defects in Voting Methods

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.

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

9.3 Other Voting Systems for Three or More Candidates

MATH 1340 Mathematics & Politics

Math for Liberal Arts MAT 110: Chapter 12 Notes

Mathematical Thinking. Chapter 9 Voting Systems

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

The Mathematics of Voting

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

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

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

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

Sect 13.2 Flaws of Voting Methods

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

Voting Criteria April

Voting Methods

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

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

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

Introduction: The Mathematics of Voting

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

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

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

Social welfare functions

Main idea: Voting systems matter.

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

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

Math for Liberal Studies

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

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

Simple methods for single winner elections

answers to some of the sample exercises : Public Choice

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

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

Syllabus update: Now keeping best 3 of 4 tests

2-Candidate Voting Method: Majority Rule

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

Homework 7 Answers PS 30 November 2013

Chapter 9: Social Choice: The Impossible Dream

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

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

The Mathematics of Voting

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

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

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

CS 886: Multiagent Systems. Fall 2016 Kate Larson

Math Circle Voting Methods Practice. March 31, 2013

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Constructing voting paradoxes with logic and symmetry

Computational Social Choice: Spring 2007

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

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

Introduction to the Theory of Voting

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

Rationality & Social Choice. Dougherty, POLS 8000

Josh Engwer (TTU) Voting Methods 15 July / 49

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Math for Liberal Studies

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.

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

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

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

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

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

Voting Fairness Idea: Condorcet Criterion (CO)

Lecture 16: Voting systems

The Mathematics of Elections

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

Lecture 12: Topics in Voting Theory

Practice TEST: Chapter 14

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

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

Introduction to Social Choice

Rock the Vote or Vote The Rock

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

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

Voting System: elections

MATH 1340 Mathematics & Politics

Rationality of Voting and Voting Systems: Lecture II

Social Choice Theory. Denis Bouyssou CNRS LAMSADE

Transcription:

Intro to Contemporary Math Independence of Irrelevant Alternatives Criteria Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK

Agenda Independence of Irrelevant Alternatives Criteria Testing Voting Methods The Perfect Voting Method

Announcements The fourth homework assignment (HW3) is due next Monday Exam 1 is next Wednesday

Today's Criterion Independence of Irrelevant Alternatives Criterion (IIA): After a winner is declared, if a losing candidate is removed (due to quitting or disqualication) and the election is done again without this candidate, the original winner should win this new election.

Testing for the IIA Criterion (IIA) To test if a voting method violates (fails) IIA, we must: 1) Find an election using the voting method 2) Determine the winner using the voting method 3) Remove a losing candidate 4) Determine the winner of the modied election Outcomes: Invalid: You remove the original winner. Inconclusive: Original winner still wins. Perhaps removing a dierent candidate may work. Violation: Original winner loses the modied election.

Testing for the IIA Criterion (IIA) To test if a voting method violates (fails) IIA, we must: 1) Find an election using the voting method 2) Determine the winner using the voting method 3) Remove a losing candidate 4) Determine the winner of the modied election Outcomes: Invalid: You remove the original winner. Inconclusive: Original winner still wins. Perhaps removing a dierent candidate may work. Violation: Original winner loses the modied election.

Testing for the IIA Criterion (IIA) Outcomes: Invalid: You remove the original winner. Inconclusive: Original winner still wins. Perhaps removing a dierent candidate may work. Violation: Original winner loses the modied election.

Testing for the IIA Criterion (IIA) To test if a voting method satises (passes) IIA, we must: 1) Study the rules of the voting method 2) Determine if a losing candidate getting removed can aect the performance of other candidates. If removing losing candidates will never change the outcome of an election, the voting method satises the IIA criterion.

?(9.1) Plurality and IIA 2 3 4 Azure Cobalt Blue Blue Azure Azure Cobalt Blue Cobalt Press the rst letter of the color that wins with Plurality.

Plurality and IIA 2 3 4 Azure Cobalt Blue Blue Azure Azure Cobalt Blue Cobalt Blue wins with the plurality method. The IIA criterion says that if we remove a losing candidate and run the plurality method again, Blue, the original winner, should still win.

Plurality and IIA Let us see what happens if Cobalt quits: 2 3 4 Azure Blue Blue Azure Azure Blue

?(9.2) Plurality and IIA Move up, ll in blanks: 2 3 4 Azure Azure Blue Blue Blue Azure Press the rst letter of the color that wins with Plurality now.

?(9.3) Plurality and IIA 2 3 4 Azure Azure Blue Blue Blue Azure Azure now wins. Blue loses. This shows: 1) Plurality can violate IIA 2) Plurality always satises IIA 3) Nothing (Inconclusive) 4) Nothing (Invalid test)

Plurality and IIA This example shows that the plurality method violates the IIA criterion, because Blue won the original election, and lost after Cobalt's removal.

Plurality and IIA What happens if we remove Blue? 2 3 4 Azure Cobalt Blue Blue Azure Azure Cobalt Blue Cobalt

?(9.4) Plurality and IIA 2 3 4 Azure Cobalt Azure Cobalt Azure Cobalt Press the rst letter of the color that wins with Plurality now.

?(9.5) Plurality and IIA Azure now wins. This shows: 1) Plurality can violate IIA 2) Plurality always satises IIA 3) Nothing (Inconclusive) 4) Nothing (Invalid test) 2 3 4 Azure Cobalt Azure Cobalt Azure Cobalt

Plurality and IIA Removing Blue will make Blue not win the modied election, but this example does not show a violation of the IIA criterion, because the original winner was removed, not one of the losing candidates. This is an invalid example for IIA because we removed the winner.

Plurality and IIA What happens if we remove Azure? 2 3 4 Azure Cobalt Blue Blue Azure Azure Cobalt Blue Cobalt

?(9.6) Plurality and IIA 2 3 4 Blue Cobalt Blue Cobalt Blue Cobalt Press the rst letter of the color that wins with Plurality now.

?(9.7) Plurality and IIA Blue wins. This shows: 1) Plurality can violate IIA 2) Plurality always satises IIA 3) Nothing (Inconclusive) 4) Nothing (Invalid test) 2 3 4 Blue Cobalt Blue Cobalt Blue Cobalt

Plurality and IIA This test was inconclusive - it does not tell us if Plurality can violate IIA or always satisfy it. Blue won after the removal, so it is not a violation, but this alone does not tell us if Plurality always satises IIA. In fact, we saw Plurality violate IIA earlier with a dierent removal.

?(9.8) Borda Count and IIA 5 4 Azure Blue Blue Cobalt Cobalt Azure Press the rst letter of the color that wins with Borda count.

Borda Count and IIA 5 4 Azure Blue Blue Cobalt Cobalt Azure Azure gets 5(3) + 4(1) = 15 + 4 = 19 points. Blue wins with 5(2) + 4(3) = 10 + 12 = 22 points. Cobalt gets only 5(1) + 4(2) = 13 points.

Borda Count and IIA Cobalt is removed: 5 4 Azure Blue Blue Azure

?(9.9) Borda Count and IIA Cobalt is removed: 5 4 Azure Blue Blue Azure Press the rst letter of the color that wins with Borda count.

Borda Count and IIA 5 4 Azure Blue Blue Azure Azure gets 5(2) + 4(1) = 10 + 4 = 14 points. Blue gets 5(1) + 4(2) = 5 + 8 = 13 points.

Borda Count and IIA Original: Azure gets 5(3) + 4(1) = 15 + 4 = 19 points. Blue gets 5(2) + 4(3) = 10 + 12 = 22 points. Modied: Azure gets 5(2) + 4(1) = 10 + 4 = 14 points. Blue gets 5(1) + 4(2) = 5 + 8 = 13 points.

Borda Count and IIA This example shows that the Borda Count method violates the IIA criterion, because Blue won the original election, and Azure won after Cobalt's removal.

?(9.10) Plurality with Elimination and IIA 7 8 6 Blue Cobalt Azure Azure Azure Blue Cobalt Blue Cobalt Need 11 rst place votes to win. Press the rst letter of the color that gets eliminated.

Plurality with Elimination and IIA Eliminate Azure 7 8 6 Blue Cobalt Azure Azure Azure Blue Cobalt Blue Cobalt

Plurality with Elimination and IIA Eliminate Azure 7 8 6 Blue Cobalt Blue Cobalt Blue Cobalt

?(9.11) Plurality with Elimination and IIA 7 8 6 Blue Cobalt Blue Cobalt Blue Cobalt Press the rst letter of the color that won.

Plurality with Elimination and IIA 7 8 6 Blue Cobalt Blue Cobalt Blue Cobalt Blue won with 13 out of 21 rst place votes.

Plurality with Elimination and IIA Let's remove Cobalt. 7 8 6 Blue Cobalt Azure Azure Azure Blue Cobalt Blue Cobalt

Plurality with Elimination and IIA Let's remove Cobalt. 7 8 6 Blue Azure Azure Azure Blue Blue

Plurality with Elimination and IIA 7 8 6 Blue Azure Azure Azure Blue Blue Azure automatically wins with 14 rst place votes. Blue loses.

Plurality with Elimination and IIA This example shows that PwE violates IIA! Blue won the original election, and Azure won after Cobalt's removal.

Pairwise Comparison and IIA Who wins with Pairwise Comparison? 5 5 6 4 D A C B A C B D C B D A B D A C

Pairwise Comparison and IIA 5 5 6 4 D A C B A C B D C B D A B D A C A vs B: 10 votes to 10 votes, A and B tie A vs C: 14 votes to 6 votes, A wins A vs D: 5 votes to 15 votes, D wins

Pairwise Comparison and IIA 5 5 6 4 D A C B A C B D C B D A B D A C B vs C: 4 votes to 16 votes, C wins B vs D: 15 votes to 5 votes, B wins C vs D: 11 votes to 9 votes, C wins

Pairwise Comparison and IIA A vs B: 10 to 10, Tie A vs C: 14 to 6, A wins A vs D: 5 to 15, D wins B vs C: 4 to 16, C wins B vs D: 15 to 5, B wins C vs D: 11 to 9, C wins A gets 1 1 2 points B gets 1 1 2 points C wins with 2 points D gets 1 point

Pairwise Comparison and IIA Remove D: 5 5 6 4 A A C B C C B A B B A C

Pairwise Comparison and IIA Remove D: 5 5 6 4 A A C B C C B A B B A C A vs B: 10 votes to 10 votes, A and B tie A vs C: 14 votes to 6 votes, A wins B vs C: 4 votes to 16 votes, C wins

Pairwise Comparison and IIA A vs B: 10 votes to 10 votes, A and B tie A vs C: 14 votes to 6 votes, A wins B vs C: 4 votes to 16 votes, C wins Note that these are the same camp sizes from the previous election. The only dierence is that the one-on-one comparisons involving D are removed.

Pairwise Comparison and IIA A vs B: 10 to 10, Tie A vs C: 14 to 6, A wins B vs C: 4 to 16, C wins A wins with 1 1 2 points B gets 1 2 point C gets 1 point

Pairwise Comparison and IIA A vs B: 10 to 10, Tie A vs C: 14 to 6, A wins A vs D: 5 to 15, D wins B vs C: 4 to 16, C wins B vs D: 15 to 5, B wins C vs D: 11 to 9, C wins A vs B: 10 to 10, Tie A vs C: 14 to 6, A wins B vs C: 4 to 16, C wins

Pairwise Comparison and IIA Pairwise Comparison violates IIA! C won the original election, and A won after D was removed.

IIA Compliance Results Plurality: Violation Borda count: Violation PwE: Violation Pairwise comparison: Violation!

IIA and Preference Ballots All four voting methods we have studied require voters to rank candidates. If someone leaves the election, their loss can upset the rankings, which can result in dierent outcomes.

Summary Method MA CO MO IIA Plurality Satisfy Violate Satisfy Violate Borda Violate Violate Satisfy Violate PwE. Satisfy Violate Violate Violate Pairwise Satisfy Satisfy Satisfy Violate

?(9.12) The Perfect Method? Is there a voting method which satises: Majority criterion Condorcet criterion Monotonicity criterion IIA criterion Press 1 for yes, 2 for no

The Perfect Method? NO

No Perfect Method Theorem (Arrow's Impossibility Theorem) It is impossible for a voting method to satisfy all four fairness criteria.

Summary The whole point behind fairness criteria is to not only state what a fair election should be like, but allow us to test whether a voting method satises or violates the criterion.

Fairness Criteria Summary The majority criterion and Condorcet criterion involve candidates who are popular in some way: The majority criterion wants a candidate who has over 50% of the rst place votes to win. The Condorcet criterion wants a candidate who wins all their pairwise comparisons to win.

Fairness Criteria Summary The monotonicity criterion wants every rst place vote to be helpful, or at least not harmful. The IIA criterion wants to keep losers who quit (or are otherwise removed) from aecting the election results.

Next time We will review for the exam Homework 3 is due next Monday