Mathematical Thinking. Chapter 9 Voting Systems

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

Arrow s Impossibility Theorem

9.3 Other Voting Systems for Three or More Candidates

1.6 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.

Elections with Only 2 Alternatives

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

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

Fairness Criteria. Review: Election Methods

Voting: Issues, Problems, and Systems, Continued

Exercises For DATA AND DECISIONS. Part I Voting

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

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

Chapter 1 Practice Test Questions

The Mathematics of Voting. The Mathematics of Voting

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

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

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

12.2 Defects in Voting Methods

The Impossibilities of Voting

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

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

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

The Mathematics of 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.

Voting: Issues, Problems, and Systems

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

The Mathematics of Voting

answers to some of the sample exercises : Public Choice

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

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

Chapter 9: Social Choice: The Impossible Dream

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

Voting Criteria April

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

MATH 1340 Mathematics & Politics

Social welfare functions

Economics 470 Some Notes on Simple Alternatives to Majority Rule

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

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

Intro to Contemporary Math

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

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

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

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

CS 886: Multiagent Systems. Fall 2016 Kate Larson

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

Sect 13.2 Flaws of Voting Methods

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

Math for Liberal Arts MAT 110: Chapter 12 Notes

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

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

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

Computational Social Choice: Spring 2007

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

Main idea: Voting systems matter.

Introduction to the Theory of Voting

Social Choice & Mechanism Design

Introduction: The Mathematics of Voting

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

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

Homework 7 Answers PS 30 November 2013

Voting Methods

Math for Liberal Studies

Lecture 16: Voting systems

The mathematics of voting, power, and sharing Part 1

Rock the Vote or Vote The Rock

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

Many Social Choice Rules

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

VOTING SYSTEMS AND ARROW S THEOREM

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

How should we count the votes?

Simple methods for single winner elections

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

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

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

Rationality & Social Choice. Dougherty, POLS 8000

2-Candidate Voting Method: Majority Rule

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.

Arrow s Impossibility Theorem on Social Choice Systems

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

Social Choice Theory. Denis Bouyssou CNRS LAMSADE

Lecture 11. Voting. Outline

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

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

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

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

Josh Engwer (TTU) Voting Methods 15 July / 49

Algorithms, Games, and Networks February 7, Lecture 8

Chapter 4: Voting and Social Choice.

(c) 2013 Janice L. Epstein Voting Methods 1

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

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

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

Math Circle Voting Methods Practice. March 31, 2013

Constructing voting paradoxes with logic and symmetry

CSC304 Lecture 14. Begin Computational Social Choice: Voting 1: Introduction, Axioms, Rules. CSC304 - Nisarg Shah 1

Voting System: elections

Transcription:

Mathematical Thinking Chapter 9 Voting Systems

Voting Systems A voting system is a rule for transforming a set of individual preferences into a single group decision. What are the desirable properties of a fair voting system? Which voting systems have these properties? Do perfectly fair voting systems exist? Voting theory lies at the intersection of mathematics, computer science, economics, and political science.

Voting Systems Terminology: voters choose among different options or candidates. Simplifying assumptions: Each voter is able to rank the candidates without any ties. Sometimes we assume an odd number of voters. There are two basic cases to consider: Two candidates. Everything is cut-and-dried. Three or more candidates. Subtle and complex.

Majority Rule Fairness properties All voters are treated equally: if any two voters were to exchange marked ballots before submitting them, the outcome of the election would not change.

Majority Rule Fairness properties All voters are treated equally: if any two voters were to exchange marked ballots before submitting them, the outcome of the election would not change. Both candidates are treated equally: if a new election were held and each voter reversed his or her vote, the outcome would be the opposite.

Majority Rule Fairness properties All voters are treated equally: if any two voters were to exchange marked ballots before submitting them, the outcome of the election would not change. Both candidates are treated equally: if a new election were held and each voter reversed his or her vote, the outcome would be the opposite. Monotone: Suppose X beats Y by majority rule in some election. If a voter s preference for Y were modified to be a preference for X, the outcome would not change.

May s Theorem (1952) Among all two-candidate voting systems that never result in a tie, majority rule is the only one that treats all voters equally, treats both candidates equally, and is monotone. In other words, majority rule is the only fair voting system for two candidates. Food for thought: Prof. X Prof. Y Prof. Z Janet A A F Jasper B B B

Preference Ballots A preference ballot is a ranking of the candidates. By convention, it is written vertically. An election is a set of preference ballots. A B B C C C C A B A A B Who wins this election?

Plurality Voting The candidate with the greatest number of first place votes is the winner. A B B C C C C A B A A B

Plurality Voting Who wins? 6 5 3 1 GB AG RN PB AG RN AG GB PB GB GB AG RN PB PB RN But wait...

Condorcet Method The winner is the candidate who is preferred by a majority of voters over each other candidate. 6 5 3 1 GB AG RN PB AG RN AG GB PB GB GB AG RN PB PB RN Equivalently: the winner would defeat each other candidate in a one-on-one contest determined by majority rule.

1980 Election for US Senate in NY D Amato, Holtzman, Javits 22 23 15 29 9 4 D D H H J J H J D J H D J H J D D H

Condorcet Voting Paradox A B C B C A C A B

Condorcet Winner Criterion A voting system satisfies the CWC if it is consistent with the Condorcet method: it selects the Condorcet winner whenever there is one. A voting system that satisfies the CWC is essentially an extended version of the Condorcet method that deals with ties in some way. Does Plurality Voting satisfy the CWC?

Rank Methods Each position on a preference balance is worth a certain number of points. Used for sports polls, Hall of Fame elections, and political elections in some countries. Track meet with four schools: Event 1 Event 2 Event 3 Event 4 Event 5 5 CL MI BU BU SH 3 BU SH SH MI CL 2 MI CL MI CL MI 1 SH BU CL SH BU

Borda Count Used for sports polls, Hall of Fame elections, and political elections in some countries. For n candidates, first place is worth n 1 points, second place is worth n 2 points, and so on. 2 A A A B B 1 B B B C C 0 C C C A A

Borda Count Who is the racquetball player of the day? 2 A A A B B 1 B B B C C 0 C C C A A According to Borda count...? According to Plurality voting...?

Borda Count Who wins? 2 A A A C C 1 B B B B B 0 C C C A A 2 A A A B B 1 B B B C C 0 C C C A A And now?

Independence of Irrelevant Alternatives A voting system satisfies the IIA if it is impossible for a candidate X to move from losing to winning status unless the relative order of X and the winner is reversed on at least one ballot.

Sequential Pairwise Voting Agenda: A, B, C, D A C B B A D D B C C D A D wins, but...

Pareto Condition A voting system satisfies the Pareto Condition if it is impossible for a candidate X to win if there is another candidate whom every voter prefers over X.

Pareto Condition A voting system satisfies the Pareto Condition if it is impossible for a candidate X to win if there is another candidate whom every voter prefers over X. If the voting system used C C A to decide this election A A B satisfies the Pareto B B C Condition, then we know B cannot be the winner. But that does not mean A wins. For example, if plurality voting is used, C wins.

Hare System A runoff method 2016 Summer Olympics in Rio de Janeiro Election of public officials in Ireland Least preferred = fewest first-place votes A A B B C C C C C A B B A A B Round 1: C eliminated Round 2: B eliminated 2 2 1 1 1 C D C B A A A D D B B C A A D D B B C C Round 1: A & B eliminated Round 2: C eliminated

Hare System Failure of monotonicity 5 4 3 1 A C B B B B C A C A A C 5 4 3 1 A C B A B B C B C A A C

Plurality Runoff 4 3 3 2 1 A B C D E B A A B D C C B C C D D D A B E E E E A 4 4 3 2 A B C D B A D C C C A A D D B B Both of these elections show that Plurality Runoff is not the same as the Hare System. The first election shows that the Hare System is not monotone.

Does a completely fair voting system exist?

Arrow s Impossibility Theorem Kenneth Arrow, Nobel Laureate Proved in his 1951 Ph.D. thesis. First appeared in 1950: A Difficulty in the Concept of Social Welfare, Journal of Political Economy Popularized in 1951 book: Social Choice and Individual Values (Wiley & Sons)

Arrow s Impossibility Theorem The only possible voting system for three or more candidates that always produces a winner satisfies the Pareto Condition satisfies the IIA is a dictatorship.

Weak Version There is no voting system for three or more candidates and an odd number of voters that always produces a winner. satisfies the CWC. satisfies the IIA. Proof sketch in book. Implications for social welfare functions?

Organ Transplant Patients are ranked using multiple criteria, including: waiting time probability of success probability of future donors being suitable Each criterion is like a voter. Patient X ranked higher on each individual criterion than Y, but Y is selected. Patient X has higher priority that Y. One of the criteria is changed, but the order of X and Y according to that criterion remains the same, and yet Y now has higher priority.

Approval Voting Current uses: Election to the Baseball Hall of Fame Election to the National Academy of Sciences Choosing the Secretary General of the United Nations It is practical and has much to commend it, but it is not perfect (the Impossibility Theorem applies). Limits the expression of voter preferences.