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.

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

The Mathematics of Voting. The Mathematics of Voting

Arrow s Impossibility Theorem

1.6 Arrow s Impossibility Theorem

Chapter 1 Practice Test Questions

The Impossibilities of Voting

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

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

Sect 13.2 Flaws of Voting Methods

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

Fairness Criteria. Review: Election Methods

12.2 Defects in Voting Methods

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

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

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

Exercises For DATA AND DECISIONS. Part I Voting

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

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

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

Elections with Only 2 Alternatives

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

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

Intro to Contemporary Math

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

Voting: Issues, Problems, and Systems, Continued

Mathematical Thinking. Chapter 9 Voting Systems

The Mathematics of Voting

9.3 Other Voting Systems for Three or More Candidates

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

answers to some of the sample exercises : Public Choice

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

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

Voting Criteria April

Introduction: The Mathematics of Voting

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

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

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

Practice TEST: Chapter 14

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

Social welfare functions

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

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

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

MATH 1340 Mathematics & Politics

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

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

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

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

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

The Mathematics of Voting

Math Circle Voting Methods Practice. March 31, 2013

Main idea: Voting systems matter.

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

Rock the Vote or Vote The Rock

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

Lecture 11. Voting. Outline

How should we count the votes?

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

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

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

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

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

Voting Fairness Idea: Condorcet Criterion (CO)

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

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

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

Syllabus update: Now keeping best 3 of 4 tests

Math for Liberal Studies

Josh Engwer (TTU) Voting Methods 15 July / 49

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

PROBLEM SET #2: VOTING RULES

Chapter 9: Social Choice: The Impossible Dream

CS 886: Multiagent Systems. Fall 2016 Kate Larson

Social Choice Theory. Denis Bouyssou CNRS LAMSADE

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

2-Candidate Voting Method: Majority Rule

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Homework 7 Answers PS 30 November 2013

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

Voting Methods

Introduction to the Theory of Voting

Chapter 4: Voting and Social Choice.

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

Find the winner of the election using majority rule given the results below: Choices (ABC) (ACB) (BAC) (BCA) (CAB) (CBA) Number of Votes

VOTING SYSTEMS AND ARROW S THEOREM

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

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

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

Social Choice & Mechanism Design

Math for Liberal Arts MAT 110: Chapter 12 Notes

Topics on the Border of Economics and Computation December 18, Lecture 8

Lecture 16: Voting systems

Math for Liberal Studies

Problems with Group Decision Making

Rationality of Voting and Voting Systems: Lecture II

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

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

Rationality & Social Choice. Dougherty, POLS 8000

Transcription:

Head-to-Head Winner A candidate is a Head-to-Head winner if he or she beats all other candidates by majority rule when they meet head-to-head (one-on-one). To decide if a Head-to-Head winner exists: Every candidate is matched on a one-on-one basis with every other candidate. Drawback: there may not exist a Head-to-Head winner.

Example Head-to-Head Winner Example: Suppose that three candidates, A, B, and C are ranked as follows: Number of Votes 4 3 2 First Choice A B C Second Choice B C B Third Choice C A A A vs. B: B wins 5 to 4 A vs. C: C wins 5 to 4 B vs. C: B wins 7 to 2 B is the Head-to-Head winner. Note: if C were to drop out, the result is unchanged; the Plurality winner is not the Head-to-Head winner.

Example A group of 13 students have to decide among three types of pizza: Sausage (S), Pepperoni (P), and Cheese (C). Their preference rankings are shown below. Pepperoni pizza wins using the Borda count but Cheese is the head-to-head winner. Number of votes 5 4 2 2 First choice C P S P Second choice P C C S Third choice S S P C Borda count does not satisfy the Head-to-Head Criterion

Head-to-Head Criterion If a candidate is the head-to-head winner, the voting method selects that candidate as the winner. The Borda Count, Plurality, and Pluralitywith-Elimination methods do not satisfy the Head-to-Head Criterion.

Monotonicity When a candidate wins an election and, in a reelection, the only changes are changes that favor that candidate, then that same candidate should win the reelection. Number of votes 5 6 4 3 First choice A B Second choice B A Majority rule is monotone and is the only method for two-candidate elections that is monotone, treats voters equally, and treats both candidates equally.

Plurality-with-Elimination is Not Monotone Monotonicity: When a candidate wins an election and, in a reelection, the only changes are changes that favor that candidate, then that same candidate should win the reelection. Number of Votes 7 6 5 3 First choice A B C D Second choice B A B C Third choice C C A B Fourth choice D D D A D is eliminated. B is eliminated. A is the Winner.

Number of votes 7 6 5 3 First choice A B C D Second choice B A B C Third choice C C A B Fourth choice D D D A Number of Votes 7 6 5 3 First choice A B C A Second choice B A B D Third choice C C A C Fourth choice D D D B A is the winner, so now suppose the voters in the last column raise A to first place. Eliminate D. Eliminate C. B wins!

Monotonicity Criterion A voting method satisfies the Monotonicity Criterion if the method is monotone. The Plurality-with-Elimination method does not satisfy the Monotonicity Criterion. Plurality and the Borda Count do satisfy this criterion.

Irrelevant Alternatives Criterion When a voting system satisfies the Irrelevant Alternatives Criterion, the winner under this system always remains the winner when a nonwinner is dropped from the ballot. Number of Votes 4 3 2 First Choice A B C Second Choice B C B Third Choice C A A If C drops out, B becomes the winner with the Plurality method. Plurality Voting does not satisfy the Irrelevant Alternatives Criterion.

Fairness Criteria for Voting Methods Majority Criterion: If a candidate is the majority winner, the voting method selects that candidate as the winner. Head-to-Head Criterion: If a candidate is the head-to-head winner, the voting method selects that candidate as the winner. Monotonicity Criterion: If a candidate is the winner using the voting method, then the same candidate wins in a reelection where the only changes are changes that favor the candidate. Irrelevant Alternatives Criterion: If a candidate is the winner using the voting method, then the same candidate would win if a non-winner were to drop out. Is there a voting method that satisfies all of these criteria?

Arrow s Impossibility Theorem With three or more candidates, there cannot exist a voting system that always produces a winner and satisfies all four of the fairness criteria. This theorem is named for Kenneth Arrow who proved a version of this theorem in 1951.