The Problem with Majority Rule. Shepsle and Bonchek Chapter 4

Similar documents
Problems with Group Decision Making

Problems with Group Decision Making

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

Social Choice & Mechanism Design

Social Choice Theory. Denis Bouyssou CNRS LAMSADE

Exercises For DATA AND DECISIONS. Part I Voting

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

Elections with Only 2 Alternatives

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

MATH 1340 Mathematics & Politics

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

Voting Criteria April

Arrow s Impossibility Theorem

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

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

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

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

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

1.6 Arrow s Impossibility Theorem

Fairness Criteria. Review: Election Methods

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

Arrow s Impossibility Theorem on Social Choice Systems

Social welfare functions

Social choice theory

Chapter 9: Social Choice: The Impossible Dream

Introduction to the Theory of Voting

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

Chapter 4: Voting and Social Choice.

Introduction to Social Choice

The Impossibilities of Voting

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

The mathematics of voting, power, and sharing Part 1

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

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

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

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

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

Mathematical Thinking. Chapter 9 Voting Systems

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

CS 886: Multiagent Systems. Fall 2016 Kate Larson

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Lecture 12: Topics in Voting Theory

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

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

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

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.

answers to some of the sample exercises : Public Choice

Game Theory. Jiang, Bo ( 江波 )

Public Choice. Slide 1

Lecture 16: Voting systems

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

Voting System: elections

VOTING SYSTEMS AND ARROW S THEOREM

2-Candidate Voting Method: Majority Rule

Is Democracy Possible?

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

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

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

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

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

Approaches to Voting Systems

Voting: Issues, Problems, and Systems, Continued

Computational Social Choice: Spring 2007

The Mathematics of Voting

The Borda count in n-dimensional issue space*

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

VOTING ON INCOME REDISTRIBUTION: HOW A LITTLE BIT OF ALTRUISM CREATES TRANSITIVITY DONALD WITTMAN ECONOMICS DEPARTMENT UNIVERSITY OF CALIFORNIA

History of Social Choice and Welfare Economics

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

Chapter 1 Practice Test Questions

Rationality & Social Choice. Dougherty, POLS 8000

1 Aggregating Preferences

Dictatorships Are Not the Only Option: An Exploration of Voting Theory

Rationality of Voting and Voting Systems: Lecture II

Computational social choice Combinatorial voting. Lirong Xia

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

CONNECTING AND RESOLVING SEN S AND ARROW S THEOREMS. Donald G. Saari Northwestern University

1 Voting In praise of democracy?

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

Public Choice : (c) Single Peaked Preferences and the Median Voter Theorem

Constructing voting paradoxes with logic and symmetry

Math Circle Voting Methods Practice. March 31, 2013

Democratic Rules in Context

Supporting Information Political Quid Pro Quo Agreements: An Experimental Study

Voting Paradoxes and Group Coherence

12.2 Defects in Voting Methods

MATH 1340 Mathematics & Politics

The Mathematics of Voting

Rock the Vote or Vote The Rock

Web Chapter 3 Political Economy

What is the Best Election Method?

Crowdsourcing Applications of Voting Theory

How should we count the votes?

Chapter 2 Positive vs Normative Analysis

Strategy and Effectiveness: An Analysis of Preferential Ballot Voting Methods

Sect 13.2 Flaws of Voting Methods

SOCIAL CHOICE THEORY, GAME THEORY, AND POSITIVE POLITICAL THEORY

Introduction to International Relations Lecture 5: Domestic Politics and Social Choice

Electing the President. Chapter 17 Mathematical Modeling

Intro to Contemporary Math

Transcription:

The Problem with Majority Rule Shepsle and Bonchek Chapter 4

Majority Rule is problematic 1. Who s the majority? 2. Sometimes there is no decisive winner Condorcet s paradox: A group composed of individuals with with individually transitive preferences do not necessarily have transitive preferences as a collectivity 3. When the group s preferences are intransitive there is either no stable outcome or the outcome is determined by the rules of the game. Typically, the rule designating an agenda setter is decisive

Today, we're going to explore the implcations of these problems by asking: 1. How general" a problem is "cyclical" majorities? 2. What's so special about majority rule anyway? 3. What can be done?

Are "intransitive group preferences" a common problem? Sure, Andrew, Bonnie, and Chuck ran into trouble deciding, but. they had other issues too (Red Sox? You gotta be kiddin me!) Are groups of normal, canoli-eating, Yankee game watchin people likely to have the same problem?

It depends. Probability of group intransitivity=f(m,n) where m is the number of alternative and n is the number of voters

Specifically. p(intransit ivity)? # of " problem" preference n ( m!) configurat ions p(intransit ivity)? # of " problem " preference configurations n ( m? ( m? 1)? ( m? 2)?...? 2? 1)

Probability of a cyclical majority, f(m,n) (m) Number of voters (n) 3 5 7 9 11 limit 3.056.069.075.078.080.088 4.111.139.150.156.160.176 5.160.20.215.251 6.202.315 limit? 1.00?1.00? 1.00? 1.00?1.00?1.00

Example: Divide the Dollars Suppose there are three regions in a town and they've just been given $1000 dollars to divide - if they can agree how to divide it.

Divide the Dollars - details let s(e), s(c), and s(w) be the shares going to East, Central, and West, respectively. a sharing scheme (strategy combination) (s(e); s(c); s(w)) is feasible if each component is nonnegative, and the components sum to something less than $1000. A sharing scheme is efficient if the values sum to $1000 (nothing is wasted). Representatives make alternating offers until they settle on a division of the pie that defeats all additional proposals

What happens? Well, we can say that the outcome will be efficient, but we can't say much more than that. Why?

Divide the Dollar: Proposal 1 To share is fair West 33% East 34% Central 33%

Divide the Dollar: Proposal 2 Go @#$%! West Man Central 50% West 0% East 50%

Divide the Dollar: Proposal 3 West says to East: I m easy, I don t want alot West 30% Central 0% East 70%

Divide the Dollare: Proposal 4 Can t we find a fair solution? West 33% East 34% Central 33%

Majority Cycle in Divide the Dollar Game 2. (500,500,0) P EC (333 1/3; 333 1/3; 333 1/3) 3. (700,0,300) P EW (500,500,0) 4. (333 1/3; 333 1/3; 333 1/3) P CW (700,0,300) 5. (500,500,0) P EC (333 1/3; 333 1/3; 333 1/3) 6. (700,0,300) P EW (500,500,0) 7. (333 1/3; 333 1/3; 333 1/3) P CW (700,0,300).etc

Shift the tax burden: Proposal 1 share the love Income 33% Wealth 34% Land 33%

Shift the tax burden: Proposal 2 Family values: Protect inheritance, and protect our nation s farms Wealth 20% Income 60% Land 20%

Shift the tax burden: Proposal 3 Soak the rich! Income 10% Land 10% Wealth 80%

Shift the tax burden: Proposal 4 Save our cities! Land 15% Income 10% Wealth 75%

Shift the tax burden: Proposal 5 Family values: Protect inheritance, and protect our nation s farms Income 40% Wealth 50% Land 10%

Cycling majorities shifting the tax burden Proposal Proposer 2 Rich Cut taxes on wealth, land 3 Wage-earners Cut taxes on income, land 4 Rich Cut taxes on income, wealth 5 Farmer Cut taxes on wealth, land 6 Wage-earners Cut taxes on??

Conclusion Majority rule seems to be deeply flawed in handling the most political of political problems

What's so special about majority rule?

May showed that Majority rule <=> A, N, M So arguing for against majority rule means arguing for or agains A,N, or M

Condition A (Anonymity) Social preferences depend only on the collection of individual preferences, not on who has which preference.

Condition N (Neutrality) changing rank of j and k in each group members preferences changes rank of j and k in group preferences (i.e. naming the alternatives is arbitrary)

Condition M (Monotonicity) - if j is at least as good a k from the group s standpoint, and j becomes more desirable to one of the members, then j is now strictly better than k from the standpoint of the group.

When does majority rule make sense? ex. Should grades be determined by majority rule? ex. Should what I have for breakfast be decided by majority rule? ex. Should amendments to the constitution be decided by majority rule? ex. Should students at a public high school be allowed to vote on whether or not to have organized prayer at football games?

We already saw that Majority rule creates practical problems in some situations May not be normatively appealing in all situation So why don t we ditch it?

Arrows theorem Majority rule is not special The pathologies of majority rule apply to any group decision procedure that meets some minimal standards

These minimal standards can be thought of a generalizations of May s conditions for majority rule May Condition Arrow Condition Anonymity Dictatorship Neutrality Independence Monotonicity Pareto Optimality

A (Anonymity) is a special case of what Arrow called "Non-Dictatorship" (D) There is no distinguished individual i*? G whose preferences dictate the group preference, independent of other members.

N (Neutrality) is a special case of what Arrow called "Independence from Irrelevant Alternatives" (I) if j and k stand in a particular relationship to each other for each member of the group, and this relationship does not change, then neither should the group preference between j and k

M (Monotonicity) is a special case of what Arrow called "Unanimity" (P) or Pareto Optimality If every member of G prefers j to k (or is indifferent between them), then the group preference must reflect a preference for j over k (or an indifference between them.

Arrow argued that any reasonable procedure for making group choices should involve D, I, and P, and two other criteria: Condition U (Universal admissibility) (each i e G may adopt any strong or weak complete and transitive preference ordering over the alternatives in A) Rationality assumption R G transitive. is complete and

Arrow s theorem There exists no mechanism for translating the preferences of rational individuals into a coherent group preference that simultaneously satisfies conditions U,P,I, and D

Conclusion Arrow showed that if you accept U,P,I as untouchable (May shows us that advocating majority rule amounts to making U,P,I untouchable) you have accept either 1. Dictatorship 2. The potential for intransitivity