NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING.

Slides:



Advertisements
Similar presentations
Presented by: Katherine Goulde
Advertisements

Voting and social choice Vincent Conitzer
1 Public choice Alexander W. Cappelen Econ
Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 9: Social Choice Lecturer: Moni Naor.
The Voting Problem: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
Public Finance (MPA405) Dr. Khurrum S. Mughal.
How “impossible” is it to design a Voting rule? Angelina Vidali University of Athens.
IMPOSSIBILITY AND MANIPULABILITY Section 9.3 and Chapter 10.
CS 886: Electronic Market Design Social Choice (Preference Aggregation) September 20.
VOTING SYSTEMS Section 2.5.
Voting Theory.
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING.
Arrow’s impossibility theorem EC-CS reading group Kenneth Arrow Journal of Political Economy, 1950.
Frank Cowell: Welfare Basics WELFARE: BASICS MICROECONOMICS Principles and Analysis Frank Cowell Useful, but optional Consumption basics Useful, but optional.
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING.
Social Choice: The Impossible Dream Michelle Blessing February 23, 2010 Michelle Blessing February 23, 2010.
Excursions in Modern Mathematics Sixth Edition
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Using a Modified Borda Count to Predict the Outcome of a Condorcet Tally on a Graphical Model 11/19/05 Galen Pickard, MIT Advisor: Dr. Whitman Richards,
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING.
Frank Cowell: Microeconomics Welfare: Basics MICROECONOMICS Principles and Analysis Frank Cowell Useful, but optional Consumption basics Useful, but optional.
Alex Tabarrok Arrow’s Theorem.
CPS Voting and social choice
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
Social Choice Theory By Shiyan Li. History The theory of social choice and voting has had a long history in the social sciences, dating back to early.
12 April: The Politics of Flatland Last time: Introduction to the unidimensional spatial model of voting and elections. Today: Extending the spatial model.
Social choice theory = preference aggregation = truthful voting Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING.
How is this math? Mathematics is essentially the application of deductive reasoning to the study relations among patterns, structures, shapes, forms and.
Social choice (voting) Vincent Conitzer > > > >
Overview Aggregating preferences The Social Welfare function The Pareto Criterion The Compensation Principle.
Chapter 9 Political Economy
An efficient distributed protocol for collective decision- making in combinatorial domains CMSS Feb , 2012 Minyi Li Intelligent Agent Technology.
Voting Geometry: A Mathematical Study of Voting Methods and Their Properties Alan T. Sherman Dept. of CSEE, UMBC March 27, 2006.
CPS Voting and social choice Vincent Conitzer
Slide 15-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
Copyright © 2009 Pearson Education, Inc. Chapter 15 Section 2 - Slide Election Theory Flaws of Voting.
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING.
Elections and Strategic Voting: Condorcet and Borda E. Maskin Harvard University.
Chapter 10: The Manipulability of Voting Systems Lesson Plan An Introduction to Manipulability Majority Rule and Condorcet’s Method The Manipulability.
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING.
Chapter 15 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Assoc. Prof. Yeşim Kuştepeli1 VOTING GAMES. Assoc. Prof. Yeşim Kuştepeli2 Outline Choosing Among Voting Mechanisms Majority Rule with Two Choices Plurality.
Math for Liberal Studies.  We have seen many methods, all of them flawed in some way  Which method should we use?  Maybe we shouldn’t use any of them,
Great Theoretical Ideas in Computer Science.
Let’s take a class vote. How many of you are registered to vote?
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 15.1 Voting Methods.
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
Arrow’s Impossibility Theorem. Question: Is there a public decision making process, voting method, or “Social Welfare Function” (SWF) that will tell us.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan Voting and Social Choice Majority Rule and Condorcet’s Method Other Voting Systems for Three.
Excursions in Modern Mathematics, 7e: 1.Conclusion - 2Copyright © 2010 Pearson Education, Inc. 1 The Mathematics of Voting CONCLUSION Elections, Fairness,
Political Economics Riccardo Puglisi Lecture 1 Content: The Political Economics Approach Methodological Tools Majoritarian Elections.
Arrow’s Impossibility Theorem
Impossibility and Other Alternative Voting Methods
1.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Chapter 10: The Manipulability of Voting Systems Lesson Plan
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Impossibility and Other Alternative Voting Methods
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Alex Tabarrok Arrow’s Theorem.
5-2 Election Theory Flaws of Voting.
Voting systems Chi-Kwong Li.
Voting and social choice
Quiz – 1/24 - Friday How many people voted in the election?
Section 14.1 Voting Methods.
Flaws of the Voting Methods
CPS Voting and social choice
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING IN GROUPS MUNGER AND MUNGER Slides for Chapter 7 The Collective Choice Problem: Impossibility

Outline of Chapter 7  Social choice  Deciding how to decide  Impossibility  Information and voting processes  Optimal majority rule  Borda count and approval voting  Proportional representation  Conclusion Slides Produced by Jeremy Spater, Duke University. All rights reserved.2

Social choice  Deciding how to decide how to decide  Group constitution  Deciding to be a group, and membership of group  Deciding how to decide  What is decision rule?  How to change rules?  Deciding  Everyday decisionmaking  Context of constituted group with relatively static decisionmaking rules 3

Deciding how to decide  Procedure for evaluating decision procedures  Start with sincere preference orderings  Assume membership static and uncontroversial  Define feasible set  Define criteria for judging decision rules  Specify available set of decision rules  Use criteria to select decision rule Slides Produced by Jeremy Spater, Duke University. All rights reserved.4

Deciding how to decide (2)  Example  A is Condorcet winner  Other groups won’t be happy if A is always selected  Might arrange to sometimes select another outcome Slides Produced by Jeremy Spater, Duke University. All rights reserved.5 Table 7.1: Four Subgroups of a Larger Group

General social choice and impossibility  Decisive set  A set of voters is decisive when their unanimous agreement is sufficient to make a decision regarding two alternatives, regardless of other group members’ preferences  Arrow’s paradox  The only choice mechanism that is complete, transitive, and obeys Pareto’s criterion is dictatorship.  Outline of impossibility theorem  Specify set of desirable characteristics for aggregation mechanism  Determine set of aggregation mechanisms that have these characteristics  Notice that dictatorship is the only aggregation mechanism with desired characteristics Slides Produced by Jeremy Spater, Duke University. All rights reserved.8

General social choice and impossibility (2)  Desirable characteristics:  Unanimity: if everyone prefers x over y, x is chosen over y  Transitivity: if x preferred to y and y preferred to z, x is preferred to z  Unrestricted domain: every preference ordering is possible for every individual  Independence of irrelevant alternatives: pairwise comparisons aren’t affected by ranking of other alternatives  Nondictatorship: There is no voter who always gets her way regardless of other voters.  Impossibility theorem:  Every collective choice mechanism that satisfies the first four characteristics violates the last one. Slides Produced by Jeremy Spater, Duke University. All rights reserved.9

Information and voting processes  The “independence of irrelevant alternatives” assumption excludes information from the voting process  Saari (2008) proposed voting mechanisms based on intensity of preferences  However, voters can falsify the intensity of their preferences  Gibbard-Satterthwaite theorem:  The alternative to dictatorship is manipulability  Takeaway: democracy isn’t perfect  Churchill: Democracy is the worst form of government except for all the others Slides Produced by Jeremy Spater, Duke University. All rights reserved.10

Optimal majority rule  How many citizens’ consent should be required to arrive at a decision?  Tradeoff between inclusion costs and exclusion costs  Three basic types of decisions  Access decisions: bring an issue for consideration. Sub-majority (e.g. seconding a motion)  Routine decisions: adopt a policy. Simple majority.  Changing the rules: supermajority. Slides Produced by Jeremy Spater, Duke University. All rights reserved.11

Equilibrium for larger majorities  K-majority Median Voter Theorem  Generalization of Median Voter Theorem  An alternative is an equilibrium if at least (N – K + 1) voters’ ideal points lie to either side.  Reduces to MVT for K = N/2 + 1  Supermajority rules privilege the status quo  For K = N, every Pareto allocation is an equilibrium  As K shrinks, set of equilibria shrinks  For K = N/2, equilibrium is median voter ideal point Slides Produced by Jeremy Spater, Duke University. All rights reserved.13

Borda count  Borda noted that plurality winner might be least preferred by a majority  Borda count: have each voter rank all alternatives  Assign “marks”: x gets one mark for each voter who ranks x first, two for second, etc.  Alternative with fewest “marks” wins  In practice some voters might not supply complete ranks  Rule for dealing with abstentions can affect outcome  Voters can lie (supply false rankings) to manipulate outcome Slides Produced by Jeremy Spater, Duke University. All rights reserved.16

Approval voting  Each voter vote for as many candidates as she likes  Candidate with most votes wins  Both Borda and approval voting violate Independence of Irrelevant Alternatives  Voters can strategically move alternatives up and down in the ranking to manipulate result  Borda is not path-independent  Depends on presence or absence of alternatives  Example on next slide shows effect of excluding an alternative on outcome Slides Produced by Jeremy Spater, Duke University. All rights reserved.18

Approval voting (2) Slides Produced by Jeremy Spater, Duke University. All rights reserved.19 Rank of alternative ABCBorda count x1225 z4116 w24410 y3339 Rank of alternative ABCBorda count x1225 z3115 w2338 Table 7.2: With Borda Count, Alternatives Matter Too Much Panel a: A comparison of x, z, and w with y also considered Panel b: A comparison of x; z, and w, deleting y

Proportional representation  Parties are awarded a proportion of seats based on their proportion of votes  A threshold is often imposed: below threshold, party gets no seats  Seating representatives is just the beginning: parties must form a coalition  Plurality or majority versus proportional representation:  Plurality or majority is often more expedient  Proportional representation includes a wider range of viewpoints Slides Produced by Jeremy Spater, Duke University. All rights reserved.20

Conclusion  Cox ’87: “degree of centrism” axis  Condorcet: maximum centrism  Candidates’ dominant strategy is to converge at median voter’s ideal point  Borda and approval voting  Nash equilibrium is for candidates to converge at median voter’s ideal point  Plurality rule: least centrism  Candidates spread themselves evenly across policy space  Impossibility theorem highlights difficulty of stable democratic rule  Alternative is dictatorship, which is unpalatable Slides Produced by Jeremy Spater, Duke University. All rights reserved.21