POSITIVE POLITICAL THEORY

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

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

Public Choice. Slide 1

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

answers to some of the sample exercises : Public Choice

CS 886: Multiagent Systems. Fall 2016 Kate Larson

Social Choice & Mechanism Design

1 Voting In praise of democracy?

The Impossibilities of Voting

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

Voting Criteria April

Arrow s Impossibility Theorem

Many Social Choice Rules

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

Fairness Criteria. Review: Election Methods

Algorithms, Games, and Networks February 7, Lecture 8

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Mathematical Thinking. Chapter 9 Voting Systems

1.6 Arrow s Impossibility Theorem

Chapter 1 Practice Test Questions

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

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

Problems with Group Decision Making

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

Social Choice: The Impossible Dream. 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.

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

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

Lecture 16: Voting systems

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

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

Main idea: Voting systems matter.

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

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

Problems with Group Decision Making

Chapter 4: Voting and Social Choice.

Simple methods for single winner elections

Lecture 11. Voting. Outline

Elections with Only 2 Alternatives

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

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

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

Computational Social Choice: Spring 2007

Homework 7 Answers PS 30 November 2013

Voting System: elections

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

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

12.2 Defects in Voting Methods

The Mathematics of Voting

Rationality & Social Choice. Dougherty, POLS 8000

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

Voting and preference aggregation

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

9.3 Other Voting Systems for Three or More Candidates

The Mathematics of Voting

Economics 470 Some Notes on Simple Alternatives to Majority Rule

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

Exercises For DATA AND DECISIONS. Part I Voting

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

The mathematics of voting, power, and sharing Part 1

Lecture 12: Topics in Voting Theory

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

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

Voting: Issues, Problems, and Systems, Continued

Introduction to Social Choice

Voting and preference aggregation

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

Introduction to the Theory of Voting

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

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

HANDBOOK OF SOCIAL CHOICE AND VOTING Jac C. Heckelman and Nicholas R. Miller, editors.

Social welfare functions

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

Intro Prefs & Voting Electoral comp. Voter Turnout Agency GIP SIP Rent seeking Partisans. Political Economics. Dr. Marc Gronwald Dr.

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

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.

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

THE MEDIAN VOTER THEOREM (ONE DIMENSION)

What is the Best Election Method?

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

Strategic voting. with thanks to:

Voting. Hannu Nurmi. Game Theory and Models of Voting. Public Choice Research Centre and Department of Political Science University of Turku

Rock the Vote or Vote The Rock

Game Theory. Jiang, Bo ( 江波 )

Comparison of Voting Systems

Electing the President. Chapter 17 Mathematical Modeling

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

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

The Math of Rational Choice - Math 100 Spring 2015

Computational Social Choice: Spring 2017

David R. M. Thompson, Omer Lev, Kevin Leyton-Brown & Jeffrey S. Rosenschein COMSOC 2012 Kraków, Poland

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

Safe Votes, Sincere Votes, and Strategizing

Social Rankings in Human-Computer Committees

Democratic Rules in Context

Josh Engwer (TTU) Voting Methods 15 July / 49

Approaches to Voting Systems

The Mathematics of Voting. The Mathematics of Voting

Electing the President. Chapter 12 Mathematical Modeling

Math for Liberal Arts MAT 110: Chapter 12 Notes

Transcription:

POSITIVE POITICA THEORY SOME IMPORTANT THEOREMS AME THEORY IN POITICA SCIENCE

Mirror mirror on the wall which is the fairest of them all????? alatasaray Fenerbahce Besiktas Turkcell Telsim Aria DSP DP CHP DTP AKP MHP XYZ

Strategy and Voting implications of strategic behavior on voting situations different voting procedures: different outcomes which voting procedure to choose how to manipulate the outcome through strategic voting

Model A: a set of alternatives that you have to choose from Ex: political parties candidates for a committee social projects (where to spend the tax money?) N: a set of voters each voter has an individual ranking of the alternatives i.e. first best, second best, third best, etc. Denoted by a binary relation, P a P b means a is ranked higher than b P is transitive: if a P b and b P c, then a P c

How will the people in N choose from the alternatives in A? They vote. (But how?) Voting rules and procedures When there are two alternatives Majority rule: the alternative with the majority of votes (i.e. > 50%) wins Ex: vote between Fenerbahce and Besiktas

When there are more alternatives A. Binary methods (pairwise voting): majority voting between pairs of alternatives in a given order 1. Condorcet method (Jean Antoine Nicholas Caritat) Condorcet winner : beats everything else in majority voting 2. Amendment procedure (when there is a status-quo alternative) First, vote between a and b ( a, b two new proposals) then, vote between the winner and c (c status-quo)

B. Plurative methods: Voting on all the alternatives at once! 1. Plurality rule The alternative with the most number of votes wins Ex: voting between saray, Fbahce, and Besiktas 2. Borda count Each agent ranks alternatives Ex: a P b P c Points assigned a gets 3, b gets 2, c gets 1 Add up points, highest wins Ex: Eurovision song contest (not exactly?), biri bizi gözetliyor

B. Plurative methods: Voting on all the alternatives at once! 3. Approval voting Each voter chooses the alternatives that she approves The alternative with the highest approval votes wins or can choose a set by setting a threshold Ex: saray, Fbahce, Besiktas (which ones do you approve?)

C. Mixed Methods: Mixtures of the previous two types! 1. Majority runoff Each voter chooses one alternative that she wants chosen If an alternative is the majority winner, it wins otherwise, majority voting between the first and the second. 2. Voting in rounds Use a single vote or a ranking (e.g. Borda) in each round At the end of each round, eliminate the worst-performing alt.

C. Mixed Methods: Mixtures of the previous two types! 3. Proportional representation When choosing a set of alternatives (e.g. senators) The chosen set must mirror the voters votes Ex: If votes are 40% AKP, 35% CHP, 25% DP the parliament is 40% AKP, 35% CHP, 25% DP 4. Single transferable vote (Hare procedure) Voters declare ranking and vote for the highest ranked alt. Bottom alternatives eliminated: their votes are transferred

Can choose any one of these rules for your society The outcome will depend on the voting procedure used Can choose one strategically Also: can manipulate each Voting Paradoxes Some voting procedures lead to curious outcomes

Condorcet Paradox: (with majority voting) What is the social ranking between alternatives, A, and? EFT enerous Average imited CENTER Average imited enerous RIHT imited enerous Average beats A beats beats An intransitive ranking Who is the winner? (with majority voting) (each voter has transitive ranking) IURE 14.1 Councillor Preferences Over Welfare Policies Copyright 2000 by W.W. Norton & Company

Reversal Paradox (with the Borda rule): Sportswriters trying choose among Ibrahim Kutluay, Mirsad Turkcan, Hidayet Turkoglu, and Kerem Tunceri 1 2 3 4 5 6 7 MT IK MT HT IK IK HT 4 HT MT HT KT MT MT KT 3 KT HT KT IK HT HT IK 2 IK KT IK MT KT KT MT 1 Apply the Borda rule IURE 14.2 Sportswriter Preferences for Award Candidates Copyright 2000 by W.W. Norton & Company

Hidayet gets 20 points (he wins the award) Ibrahim gets 19 points Mirsad gets 19 points Kerem gets 13 points They discover Kerem can not be a candidate because? Should this effect who wins the award?

1 2 3 4 5 6 7 MT IK MT HT IK IK HT 3 HT MT HT IK MT MT IK 2 IK HT IK MT HT HT MT 1 Ibrahim: 15 points (the new winner) Mirsad: 14 points Hidayet: 13 points IURE 14.3 Sportswriter Preferences Over a Narrowed Field Copyright 2000 by W.W. Norton & Company

Agenda paradox (binary voting procedures): The chair decides the order of voting (i.e. sets the agenda) she can get any outcome she wants EFT enerous Average imited CENTER Average imited enerous RIHT imited enerous Average beats A beats beats (with majority voting) Ex: (chair EFT) and A => A and A => The real game is setting the agenda (or choosing the chair)

Change the voting method, change the outcome: strategically choosing the voting method Ex: 100 voters, 40 voters A P B P C 25 voters B P C P A 35 voters C P B P A Plurality rule : A wins Borda rule : B wins (225 points) (C 195 points, A 180 points) Majority runoff: C wins (A and C move to second round)

Evaluating vote aggregation methods Preference aggregation method: individual rankings =>social ranking Arrow s theorem: If a preference aggregation method satisfies these: 1. All alternatives must be ranked: complete 2. The ranking must be transitive: transitive 3. If everybody ranks a higher than b, social ranking does the same: Pareto condition 4. Social ranking of a and b doesn t depend on how people rank other alternatives: independence of irrelevant alternatives Then it is dictatorial!!!

Very strong result, very famous, Arrow s Ph.D. thesis Ex: Borda violates independence of irrelevant alternatives Other criteria: Condorcet: if there is a Condorcet winner, it should be selected Non-manipulability: by lying about your ranking, you can t get an alternative you like more to be chosen ibbard-satterthwaite Theorem: All nondictatorial voting methods are manipulable What happens when people manipulate the voting outcome?

Strategic Voting ames in which people lie about their rankings or vote for an alternative they don t rank at top Plurality rule: Two major candidates and a spoiler (divides the votes) say spoiler is your top choice vote for him? Spoilers usually get less votes than they would under honesty Ex: Britain (two major parties in the parliament) Proportional rule: Does not have this problem Ex: Italy More parties in the parliament (but smaller parties) ess decisive government, better for minorities

The City Council: beats A beats beats (with majority voting) EFT is the chair agenda: first vote between Average and imited the winner (A) is voted against enerous EFT enerous Average imited What can CENTER do? CENTER Average imited enerous RIHT imited enerous Average Vote for imited (it wins) Everybody votes strategically we have a game IURE 14.1 Councillor Preferences Over Welfare Policies use rollback Copyright 2000 by W.W. Norton & Company

If second-round is between A and : truthful voting (a) A versus election for A: Right votes for : CENTER CENTER A A EFT A A A A EFT A A IURE 14.4 A Election Outcomes in Two Possible Second-Round Votes Copyright 2000 by W.W. Norton & Company

If second-round is between and : truthful voting (b) versus election for : Right votes for : CENTER CENTER EFT EFT IURE 14.4 B Election Outcomes in Two Possible Second-Round Votes Copyright 2000 by W.W. Norton & Company

The first-round: strategic voting Right votes or A: for : CENTER CENTER A A EFT A EFT A IURE 14.5 Election Outcomes Based on First-Round Votes Copyright 2000 by W.W. Norton & Company

NOTE: Chair will realize this and choose the agenda accordingly first-round: against (equilibrium outcome: ) Borda rule: how can you manipulate it rank the most powerful adversary to your top choice as last everybody does the same: prisoners dilemma

What about games in which the candidates act strategically? Each candidate s payoff is the number of votes she gets. Ex: Politicians strategically choosing their political position One dimensional policy space Median voter theorem Ex: from left to right or government s budget for education extreme left center extreme right

Each voter has single-peaked preferences A voter s payoff function Voter s Peak Political Position The game: 1. 2 candidates simultaneously choose their policies 2. Voters vote (majority voting) NOTE: with 2 candidates, voting honestly is the best

NOTE: the voters top choices are distributed on the policy space 1 voter 1 voter 2 voters 1 voter edian: the midpoint(s) of a distribution in. 50% of the points to the left and min 50% of the points to the right Median voter: the voter whose top choice is the median of the distribution of the top choices Median voter theorem: Both candidates will place themselves on the top choice of the median voter

Number of Voters (millions) Discrete political spectrum (9 million voters) 3 2 1 F C R FR Political Position IURE 14.6 Discrete Distribution of Voters Copyright 2000 by W.W. Norton & Company

EX-ACTOR F C R FR F 4.5, 4.5 1, 8 2, 7 3, 6 4.5, 4.5 8, 1 4.5, 4.5 3, 6 4.5, 4.5 6, 3 EX- OVERNOR C 7, 2 6, 3 4.5, 4.5 6, 3 7, 2 R 6, 3 4.5, 4.5 3, 6 4.5, 4.5 8, 1 FR 4.5, 4.5 3, 6 2, 7 1, 8 4.5, 4.5 IURE 14.7 Election Results: Symmetric Voter Distribution Copyright 2000 by W.W. Norton & Company

Discrete political spectrum with asymmetric dist. (9 million voters) Number of Voters (millions) 6 4 2 1 F C R FR Political Position

EX-ACTOR F C R FR F 4.5, 4.5 1, 8 3, 6 5, 4 5.5, 3.5 8, 1 4.5, 4.5 5, 4 5.5, 3.5 6, 3 EX- OVERNOR C 6, 3 4, 5 4.5, 4.5 6, 3 6.5, 2.5 R 4, 5 3.5, 5.5 3, 6 4.5, 4.5 7, 2 FR 3.5, 5.5 3, 6 2.5, 6.5 2, 7 4.5, 4.5 IURE 14.8 Election Results: Asymmetric Voter Distribution Copyright 2000 by W.W. Norton & Company

Same conclusion with a continuous distribution of voters histogram Ex: uniform distribution normal distribution distribution function The value of the function at a given policy: the number of people who ranks that policy first i.e. their peaks are at that policy No payoff table solve it on the graph

(a) Uniform distribution Number of votes 0 0.5 x 1 Political Position IURE 14.9 A Continuous Voter Distributions Copyright 2000 by W.W. Norton & Company

(b) Normal distribution Number of votes 0 0.5 1 Political Position IURE 14.9 B Continuous Voter Distributions Copyright 2000 by W.W. Norton & Company

A Philosophy eology Anthropology B Anthropology Philosophy eology C eology Anthropology Philosophy XERCISE 14.1 Copyright 2000 by W.W. Norton & Company

1 2 3 4 A A B C B B C B C C A A XERCISE 14.3 Copyright 2000 by W.W. Norton & Company

RANKIN I (18) ROUPS (AND THEIR SIZES) II (12) III (10) IV (9) V (4) VI (2) 1 T C B K H H 2 K H C B C B 3 H K H H K K 4 B B K C B C 5 C T T T T T XERCISE 14.7 Copyright 2000 by W.W. Norton & Company