Chapter 4: Voting and Social Choice.

Similar documents
answers to some of the sample exercises : Public Choice

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

Lecture 16: Voting systems

Elections with Only 2 Alternatives

Fairness Criteria. Review: Election Methods

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

Problems with Group Decision Making

CS 886: Multiagent Systems. Fall 2016 Kate Larson

The Impossibilities of Voting

Social Choice & Mechanism Design

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Arrow s Impossibility Theorem

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

Voting Criteria April

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

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

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

Problems with Group Decision Making

1.6 Arrow s Impossibility Theorem

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

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

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

Social welfare functions

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

Introduction to the Theory of Voting

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

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

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

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.

Mathematical Thinking. Chapter 9 Voting Systems

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

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

Public Choice. Slide 1

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

Homework 7 Answers PS 30 November 2013

Voting: Issues, Problems, and Systems, Continued

Chapter 1 Practice Test Questions

Rationality & Social Choice. Dougherty, POLS 8000

Arrow s Impossibility Theorem on Social Choice Systems

Introduction to Social Choice

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

Computational Social Choice: Spring 2007

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

History of Social Choice and Welfare Economics

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Lecture 11. Voting. Outline

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

The Mathematics of Voting. The Mathematics of Voting

9.3 Other Voting Systems for Three or More Candidates

Decision making and problem solving Lecture 10. Group techniques Voting MAVT for group decisions

1 Voting In praise of democracy?

Constructing voting paradoxes with logic and symmetry

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

Algorithms, Games, and Networks February 7, Lecture 8

Math Circle Voting Methods Practice. March 31, 2013

Voting Paradoxes and Group Coherence

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

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

Warm-up Day 3 Given these preference schedules, identify the Plurality, Borda, Runoff, Sequential Runoff, and Condorcet winners.

Social Choice Theory. Denis Bouyssou CNRS LAMSADE

PROBLEM SET #2: VOTING RULES

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

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

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

MATH 1340 Mathematics & Politics

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

A New Method of the Single Transferable Vote and its Axiomatic Justification

Many Social Choice Rules

Intro to Contemporary Math

Chapter 9: Social Choice: The Impossible Dream

Main idea: Voting systems matter.

Rationality of Voting and Voting Systems: Lecture II

Democratic Rules in Context

Game Theory. Jiang, Bo ( 江波 )

12.2 Defects in Voting Methods

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

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

Warm-up Day 3. Phones OFF and in pockets! 1) Given these preference schedules, identify the Condorcet, Runoff, and Sequential Runoff winners.

POSITIVE POLITICAL THEORY

Voting Methods

Voting and preference aggregation

How should we count the votes?

Voting and preference aggregation

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

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

VOTING SYSTEMS AND ARROW S THEOREM

Computational Social Choice: Spring 2017

Strategic voting. with thanks to:

The Borda Majority Count

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

Complexity of Terminating Preference Elicitation

First Principle Black s Median Voter Theorem (S&B definition):

Voting System: elections

Social choice theory

Is Democracy Possible?

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

Transcription:

Chapter 4: Voting and Social Choice. Topics: Ordinal Welfarism Condorcet and Borda: 2 alternatives for majority voting Voting over Resource Allocation Single-Peaked Preferences Intermediate Preferences Preference Aggregation and Arrow s Impossibility Theorem 1. Ordinal Welfarism. Some situations: cardinal welfarism impossible Ordinal welfarism: based on ordering of individual preferences. Central Postulate: individual welfare entirely captured by a preference ordering of possible outcomes A: set of possible outcomes, or choice set R: relation between options: complete and transitive Rational choices: if R exists such that selected S(B) is highest of the ranked outcomes according to R. Welfarist Program (in it s ordinal form) needed to analyze social choice to analyze which compromises are just. Example: Pareto. Two social choice theory models: interpretations Voting Problem normative (benevolent dictator) or strategic voting (private info) Preference Aggregation order all outcomes, search for Problem collective preference instead of best Use collective utility function. 1

2. Condorcet and Borda. Critique on plurality (majority) voting: only top of preferences matters: entire preference relation ignored. Borda: weight all personal preferences in A; highest score wins Condorcet: based on majority relation: b P m a, b P m c, c P m a b wins. Remarks: Borda-scores (scoring methods) are in fact cardinal utilities, unrelated to personal feelings Borda and Condorcet can lead to the same, as well as to different results, dependent on the relative position of preferences: Borda takes into account entire preference profile, Condorcet also focuses on whole profile, but not at once. Major problem of this: Condorcet method may lead to cycles Possible outcome: delete weakest link: smallest majority ignored. Problem then: Reunion Paradox : total group split in two, one cycles (delete w.l), one not, then unified: not necessarily the same winner as if Condorcet method is applied in whole group. Note: Any scoring method (Borda) is immune to this problem. 3. Voting over Resource Allocation. Elections sometimes not over small group of options, so impractical to address scores to potential outcomes (a large choice set A: how to divide a homogeneous private good among group of selfish people?). Problem: relatively small coalitions can impose large negative externalities on other groups. Destructive Competition: veto power (for several possible coalitions!) occurs, leading to cycles instability and unpredictability! 2

4. Single-Peaked Preferences. Which characteristics for individual preferences are needed for a transitive majority relation? If preferences are single-peaked, transitivity of the majority relation is guaranteed. Example: how to locate a facility among the line [0,1]? Assumptions: Large number of voters, spread continuously in [0,1], Disutility in case of living far away from it: u i = - y-x i Distribution F: at location z: 1 F(z) living on [z,1] (no one living at z) Median of F is y*: F (y*) = ½. y* is the classical utilitarian solution as well as the Condorcet-winner. Definition: Preference Relation R is single-peaked (in the ordering of A) with peak x i, if x i is the top outcome of R i in A, and for all outcome x ( x i ), R i prefers any outcome between x i and x to x itself. Majority relation is transitive and single-peaked. Consequence: In case of single-peaked preferences, agents only need to report their peaks, which leads to a Condorcet-winner. If so: no incentive to lie: report peak is always best strategy (the majority always consists of true peaks ). Condorcet-method preferred above all scoring-methods with respect to this problem, because all of these methods fail to be strategy proof (even if preferences are single-peaked). Conclusion: Condorcet-method useful if the outcomes can be arranged along a one-dimensional line and individual preferences are single peaked. (As soon as the single-peaked assumption is not fulfilled anymore, also this method fails the strategy proof. Cycling and hence the undesired instability in the voting process occurs. Search for another assumption about preferences to make sure that the majority relation is transitive.) 3

5. Intermediate Preferences. I.P. is a second assumption about preferences such that a Condorcet winner exists, or in other words, that the majority relation in transitive. I.P. method: ordering of agents instead of outcomes (single peaked pref.) If agents I, j both apb so do all agents in between i and j. Now the majority relation is transitive if [ N(a,b) + N(b,c) ] > ½ N;\ That is: the majority has apb and bpc. Example 4.7: agents voting over which surplus sharing model will be used. Example 4.8: even in absence of s.p.p., the IP-property still holds, so that majority voting always delivers a Condorcetwinner. Conclusion: a majority ranking exists, even in the absence of s.p.p. 6. Preference Aggregation and Arrow s Impossibility Theorem. Recall: social choice problem consists of the choice set A, N agents and the preference relation R i (N agents choose a according to their R i ). Solve the problem of different personal preferences if society chooses with an aggregation method F: social preference relation R* = F(R). Assumptions made in Social Choice Theory: Process leading to social outcome should be based on well-founded axioms, This process should allow positive predictions (no instability). Unfortunately: Arrow s Impossibility Theorem: The search for rationality of collective choice is hopeless (if these assumptions have to be taken in account). 4

Two simple aggregation methods: Condorcet: general will: R m = F(R) Problem: some R s cycle, leading to instability. Deleting these weakest links contrasts to first assumption: freedom of choice for everyone. Borda provides aggregation method for all preference profiles in A, and the majority relation is transitive. Problem in this case: majority may choose a out of (a,b,c), whereas the Borda winner might be b because of its relative position over c. In other words: this means that the overall outcome b is not independent of the irrelevant outcome c Because the contest is between a and b, c should be irrelevant according to the assumption of Independence of Irrelevant Alternatives: A collective R, R*, should only depend on individual preferences between concerned outcomes. Suppose Condorcet method is accepted (delete w.l.). Even then it s not a correct aggregation method, because IIA violated! Arrow s Impossibility Theorem Any aggregation function leading to a rational collective preference and obeying the IIA-principle, must be very undesirable because of its lack of efficiency or of fairness. If efficient aggregation method is needed, the only rational solution becomes one of dictatorship, which contrasts with fairness. A fair distribution: if always the same R 0 is selected (very inefficient!) Two solutions: Restriction of domain: exclude non-single peaked or non-intermediate preferences Weaken rationality: allow several possible majorities (yet: instability!) 5