Lecture 11. Voting. Outline

Similar documents
Arrow s Impossibility Theorem

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.

Fairness Criteria. Review: Election Methods

Math Circle Voting Methods Practice. March 31, 2013

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Elections with Only 2 Alternatives

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

Problems with Group Decision Making

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

Main idea: Voting systems matter.

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.

PROBLEM SET #2: VOTING RULES

What is the Best Election Method?

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

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

Public Choice. Slide 1

Many Social Choice Rules

How Should Members of Parliament (and Presidents) Be Elected? E. Maskin Institute for Advanced Study

Social Choice & Mechanism Design

Problems with Group Decision Making

Chapter 1 Practice Test Questions

9.3 Other Voting Systems for Three or More Candidates

Voting: Issues, Problems, and Systems, Continued

Reality Math Sam Kaplan, The University of North Carolina at Asheville Dot Sulock, The University of North Carolina at Asheville

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

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

Computational Social Choice: Spring 2007

Mathematical Thinking. Chapter 9 Voting Systems

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

Social Choice Theory. Denis Bouyssou CNRS LAMSADE

Voting Methods

Voting. Suppose that the outcome is determined by the mean of all voter s positions.

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

The Mathematics of Voting

Chapter 9: Social Choice: The Impossible Dream

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

CS 886: Multiagent Systems. Fall 2016 Kate Larson

answers to some of the sample exercises : Public Choice

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

Homework 7 Answers PS 30 November 2013

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

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

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

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

The Impossibilities of Voting

Arrow s Impossibility Theorem on Social Choice Systems

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

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

Simple methods for single winner elections

The Arrow Impossibility Theorem: Where Do We Go From Here?

Chapter 4: Voting and Social Choice.

Is Majority Rule the Best Voting Method? Partha Dasgupta and Eric Maskin

1 Voting In praise of democracy?

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

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

Voting Criteria April

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

VOTING SYSTEMS AND ARROW S THEOREM

Social choice theory

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

The Iowa Caucuses. (See Attached Page Below) B R C T R B R R C C B C T T T B

Math for Liberal Arts MAT 110: Chapter 12 Notes

Lecture 16: Voting systems

VOTING TO ELECT A SINGLE CANDIDATE

Social welfare functions

The Mathematics of Voting. The Mathematics of Voting

Electing the President. Chapter 12 Mathematical Modeling

Constructing voting paradoxes with logic and symmetry

Algorithms, Games, and Networks February 7, Lecture 8

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

Josh Engwer (TTU) Voting Methods 15 July / 49

Rationality & Social Choice. Dougherty, POLS 8000

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

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

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

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

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

The mathematics of voting, power, and sharing Part 1

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

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

Font Size: A A. Eric Maskin and Amartya Sen JANUARY 19, 2017 ISSUE. 1 of 7 2/21/ :01 AM

The Math of Rational Choice - Math 100 Spring 2015

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

c M. J. Wooldridge, used by permission/updated by Simon Parsons, Spring

Introduction to the Theory of Voting

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

Answers to Practice Problems. Median voter theorem, supermajority rule, & bicameralism.

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

12.2 Defects in Voting Methods

POSITIVE POLITICAL THEORY

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Voting: Issues, Problems, and Systems

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

Voting System: elections

Tufts University Summer of 2019 in Talloires Math 19, Mathematics of Social Choice

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

Strategic voting. with thanks to:

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

Voting and Markov Processes

Transcription:

Lecture 11 Voting Outline

Hanging Chads Again Did Ralph Nader cause the Bush presidency? A Paradox Left Middle Right 40 25 35 Robespierre Danton Lafarge D L R L R D

A Paradox Consider Robespierre versus Danton R wins 75:25 R versus L L wins 60:40 L versus D D wins 65:35 Depending on who runs against whom, the outcome can be very different. A Paradox Does the fact that R wins by the most make that more acceptable? In the current French system, there is first a multi-person election and, if no majority, then a runoff who would win in this case? Chirac vs. Jospin vs. LePen

Condorcet Rules Condorcet suggested the following rule. Have all voters list their entire ranking. Use the ranking to determine who beats whom on pair-wise comparisons. The winner is the one with the smallest maximum votes against. Approval Voting Suppose there is a list of (say) 6 candidates Voters are asked to vote for any of the candidates they find acceptable. Which candidates win depends on the rule. if only a fixed number of slots, say, 3 then the top 3 vote getters win if a minimum number of acceptable votes must win to get elected eg. proposed voting for HOF

Borda Count All candidates are ranked by voters Each ranking gets a certain number of points. eg. 1 st gets 10 points, 2 nd gets 8 etc. winner(s) are those with the most points. Example: Suppose we do a Borda Count with points, 3,2,1 on the R,D L example. A Paradox Robespierre Danton Lafarge 40*3+35*2+25= 215 25*3+40*2+35= 190 40 25 35 Robespierre Danton Lafarge D L R L R D 35*3+25*2+40= 195

Borda Count Sincere voting would lead to a victory for Robespierre with 215 Again, this is the worst outcome for the Center party. If instead of voting sincerely, they lied and ranked Lafarge first, they could ensure that their least favorite candidate loses. (As Lafarge would then get 60*3+40=220) Arrow s Impossibility Theorem Observe that all of these rules create incentives for voters not to vote sincerely that is, they may strategically misrepresent their true desires. Kenneth Arrow (Nobel Prize, 1972) demonstrated that this was a general truth whenever there are three or more alternatives, (and agents true preferences could take any ranking) there will be an incentive to lie in any voting scheme.

Why Vote? Note that Arrow s Theorem does NOT apply if there are only two choices. In that case, majority voting induces sincere behavior: it is always a best response to vote truthfully. (You can probably prove this for yourself) Why Vote?: Are you pivotal? However, when does your vote matter? Suppose there are exactly 2n+1 people including you. Your vote only has an impact if the other 2n people split exactly evenly. In this case, we say you are pivotal (What about the other voters?)

When Are you pivotal? Suppose everyone has a 50% chance of preferring one candidate over the other. What are the chances that you are pivotal? That is, what are the chances the other 2n voters split exactly evenly? How many ways can you divide 2n into two equal groups? (2n!)/(n!n!) Each grouping occurs with probability (1/2 )n (1/2) n = ( 1/4) n Now suppose it costs you $5 to vote. In a group of 100,000 other people what would it have to be worth to you to have your side win? Probability of Pivotal. (n,2n) Probability (2,4).375 (4,8).27 (8,16).20 (50,100).08 (500,1000).025 (50,000,100,000).0025

Order matters Current system: determine guilt or innocence, then fix sentence Roman Tradition Go through sentences from most severe to least and decide on whether appropriate Mandatory Sentencing Specify mandatory sentence then decide guilty or innocent Order matters Judge A Judge B Judge C Best Death Sentence Life in Prison Acquittal Middle Life in Prison Acquittal Death Sentence Worst Acquittal Death Sentence Life in Prison

Current System Judge B recognizes that if the defendant is found guilty, then the two of the three judges will pronounce the death penalty. Since the Death Penalty is the worst outcome for him, he can force an acquittal Thus, this system generates an Acquittal Roman Tradition Since more judges prefer the life sentence to Acquittal, if the death sentence is not pronounced in the first stage, that will occur Two out of three judges prefer the death penalty to a life sentence, so under this system, the Death penalty is imposed

Mandatory Sentencing If the judges decide that a life sentence should be mandatory if the defendant is found guilty, then since life outvotes acquittal, the defendant would get life If the judges decide that the death penalty should be mandatory if the defendant is found guilty, then since acquittal outvotes death, the defendant would be acquitted. Acquitted is outvoted by life, so the judges will select a mandatory life sentence. Summary This is another example of strategic voting. It illustrates that the procedure adopted can have an effect on the outcome when we consider the incentives it creates for vote manipulation.