Elections with Only 2 Alternatives

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

9.3 Other Voting Systems for Three or More Candidates

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

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Voting: Issues, Problems, and Systems, Continued

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

Exercises For DATA AND DECISIONS. Part I Voting

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

Mathematical Thinking. Chapter 9 Voting Systems

The Mathematics of Voting. The Mathematics of Voting

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

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

Arrow s Impossibility Theorem

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

Fairness Criteria. Review: Election Methods

1.6 Arrow s Impossibility Theorem

The Impossibilities of Voting

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

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

Chapter 1 Practice Test Questions

Voting Criteria April

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.

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

Economics 470 Some Notes on Simple Alternatives to Majority Rule

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

Math for Liberal Arts MAT 110: Chapter 12 Notes

12.2 Defects in Voting Methods

answers to some of the sample exercises : Public Choice

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

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

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

Intro to Contemporary Math

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

Social welfare functions

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

Math for Liberal Studies

Computational Social Choice: Spring 2007

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

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

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

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

Homework 7 Answers PS 30 November 2013

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

MATH 1340 Mathematics & Politics

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

Many Social Choice Rules

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

Chapter 9: Social Choice: The Impossible Dream

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

Math Circle Voting Methods Practice. March 31, 2013

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

Voting Methods

Main idea: Voting systems matter.

The Mathematics of Voting

Social Choice & Mechanism Design

Chapter 4: Voting and Social Choice.

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

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

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

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

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

Introduction to the Theory of Voting

Syllabus update: Now keeping best 3 of 4 tests

Sect 13.2 Flaws of Voting Methods

Introduction: The Mathematics of Voting

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

The Mathematics of Voting

CS 886: Multiagent Systems. Fall 2016 Kate Larson

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

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

Math for Liberal Studies

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

Public Choice. Slide 1

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

How should we count the votes?

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

Lecture 11. Voting. Outline

Simple methods for single winner elections

Introduction to Social Choice

Lecture 16: Voting systems

Problems with Group Decision Making

PROBLEM SET #2: VOTING RULES

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

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

The mathematics of voting, power, and sharing Part 1

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

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

Josh Engwer (TTU) Voting Methods 15 July / 49

2-Candidate Voting Method: Majority Rule

Voting: Issues, Problems, and Systems

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

Voting System: elections

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

Rationality of Voting and Voting Systems: Lecture II

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

Arrow s Impossibility Theorem on Social Choice Systems

Problems with Group Decision Making

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

Constructing voting paradoxes with logic and symmetry

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

Transcription:

Math 203: Chapter 12: Voting Systems and Drawbacks: How do we decide the best voting system? Elections with Only 2 Alternatives What is an individual preference list? Majority Rules: Pick 1 of 2 candidates and one with most votes wins. (1) All voters treated equally. (2) Both candidates treated equally. (3) New election held and single voter changed vote from previous loser to previous winner. Then, the outcome is the same if all other voters kept their original vote. Other Options (1) Dictatorship (2) Imposed Rule (3) Minority Rule May s Theorem: If the number of voters is odd and we are only interested in a voting system that never ends in a tie, then the majority rule is the ONLY system for 2 alternatives that satisfy the three conditions above.

Elections with 3 or More Alternatives Assume the ballot is individual preference list. Allow ties, but assume in the real-world, this wouldn t happen, or can be broken by some random decision. (1) Plurality Voting and the Condorcet Winner Criterion Here, only the first place votes count. Example 1: 2000 Election, Part 1 What does it mean to be a Condorcet winner? Who was the Condorcet winner in the example? The Condorcet Winner Criterion (CWC) is satisfied in a voting procedure if for every possible sequence of preference lists, either (1) there is no CW (often the case), or (2) there is a CW, they re unique, and they are the unique winner of the election. Can we satisfy CWC in plurality voting? Plurality ignores 2nd choice, if one exists. There may be a candidate which is no one s first choice, but everyone s close second choice. Example 2: 2000 Election, Part 2 Another drawback: Manipulability: There are situations where there is an advantage to vote for someone who misrepresents your true preference. Vote Bush or Gore, rather than Nader because Nader will lose anyway.

(2) The Borda Count Rank all contestants/candidates/alternatives along with deciding a winner, and who finished 2nd, 3rd, etc. Assume points to each voter s rankings are in a nonincreasing order, that is, a voter s first choice receives more points than a voter s second choice, etc. The Borda Count is a rank method of voting where n alternatives and a first place vote receives n 1 points, a second place vote receives n 2 votes, and so on. The last place receives 0 points. Example 1: Other ranking methods: Track Meet Calculate the Borda Score of candidate A by counting the number of occurrences of other candidate names below candidate A s name. Example 2: Football Teams What is the Borda Score of each team? Modified Example 2: Football Teams What is the independence of irrelevant alternatives?

A voting system is said to satisfy the independence of irrelevant alternatives (IIA) if it is impossible for an alternative B to move from nonwinner status to winner status unless at least one voter reverses the order in which they had B and the winning alternative ranked. Example 3: Candidates A,B,C What is sincere voting? Burda said My scheme is only intended for honest men!

(3) Sequential Pairwise Voting and the Pareto Condition What is an agenda? How is it different from a preference list? Sequential Pairwise Voting starts with an agenda and pits the first alternative against the second in a one on one contest. The winner (or both if tie) moves on to confront third alternative and so on. Losers are deleted. Continue to those remaining, and hence the winners. Does the agenda affect the outcome given a preference list? Example 1: Exercise 18 from Text: Other ranking methods: Track Meet Does Agenda 1 bother you? What is the Pareto Condition?

(4) The Hare System Where is this system used? The Hare System proceeds to arrive at a winner by repeatedly deleting those alternatives that are least preferred or appear at the opt of the fewest preference lists. Repeat. If two or more alternatives remain and all would be eliminated in next round, then there s a tie. Example 1: 13 Voters A voting system has monotonicity if... Read and make sure you understand the example on page 420-421.

Insurmountable Difficulties Problems with any system with 3 or more alternatives, just just the four we ve discussed Condorcet s Example: Condorcet s Voting Paradox is that it s possible for 2/3 society to prefer A over B, 2/3 prefer B over C, and 2/3 prefer C over A. Arrow s Impossibility Theorem: There does not exist and never will exist any social choice procedure that satisfies both CWC and IIA. Can We Do Better? We re OK with 2 alternatives. We have problems with 3 or more alternatives. What do we do? What is approval voting? When is approval voting appropriate? Have we eliminated problems if we use approval voting?