Alex Tabarrok Arrow’s Theorem.

Slides:



Advertisements
Similar presentations
Voting and social choice Vincent Conitzer
Advertisements

1 Public choice Alexander W. Cappelen Econ
Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 9: Social Choice Lecturer: Moni Naor.
© 2007 Thomson South-Western. ASYMMETRIC INFORMATION A difference in access to relevant knowledge is called information asymmetry.
The Voting Problem: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
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.
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.
Chapter 1: Methods of Voting
Voting Theory.
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.
Social Choice: The Impossible Dream Michelle Blessing February 23, 2010 Michelle Blessing February 23, 2010.
Excursions in Modern Mathematics Sixth Edition
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,
Approximating Optimal Social Choice under Metric Preferences Elliot Anshelevich Onkar Bhardwaj John Postl Rensselaer Polytechnic Institute (RPI), Troy,
Frank Cowell: Microeconomics Welfare: Basics MICROECONOMICS Principles and Analysis Frank Cowell Useful, but optional Consumption basics Useful, but optional.
Motivation: Condorcet Cycles Let people 1, 2 and 3 have to make a decision between options A, B, and C. Suppose they decide that majority voting is a good.
Arrow's Impossibility Theorem Kevin Feasel December 10, 2006
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.
We vote, but do we elect whom we really want? Don Saari Institute for Mathematical Behavioral Sciences University of California, Irvine, CA
1 Manipulation of Voting Schemes: A General Result By Allan Gibbard Presented by Rishi Kant.
Social choice theory = preference aggregation = truthful voting Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Social choice (voting) Vincent Conitzer > > > >
Overview Aggregating preferences The Social Welfare function The Pareto Criterion The Compensation Principle.
Decision Theory CHOICE (Social Choice) Professor : Dr. Liang Student : Kenwa Chu.
Voting Geometry: A Mathematical Study of Voting Methods and Their Properties Alan T. Sherman Dept. of CSEE, UMBC March 27, 2006.
Arrow’s Theorem The search for the perfect election decision procedure.
CPS Voting and social choice Vincent Conitzer
Alex Tabarrok. Individual Rankings (Inputs) BDA CCC ABD DAB Voting System (Aggregation Mechanism) Election Outcome (Global Ranking) B D A C.
Elections and Strategic Voting: Condorcet and Borda E. Maskin Harvard University.
1 Elections and Manipulations: Ehud Friedgut, Gil Kalai, and Noam Nisan Hebrew University of Jerusalem and EF: U. of Toronto, GK: Yale University, NN:
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.
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.
How Should Presidents Be Elected? E. Maskin Institute for Advanced Study.
Chapter 9: Social Choice: The Impossible Dream Lesson Plan Voting and Social Choice Majority Rule and Condorcet’s Method Other Voting Systems for Three.
Social Choice Lectures 14 and 15 John Hey. Lectures 14 and 15: Arrow’s Impossibility Theorem and other matters Plan of lecture: Aggregation of individual.
Voting System Review Borda – Sequential Run-Off – Run-Off –
Arrow’s Impossibility Theorem
1.
Voting Theory: Problems and Solutions
1 The Mathematics of Voting
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
Frontiers of Microeconomics
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
Applied Mechanism Design For Social Good
Algorithmic Analysis of Elections: Voting Rules and Manipulability (minicourse) Piotr Faliszewski AGH University Kraków, Poland.
Impossibility and Other Alternative Voting Methods
Introduction If we assume
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Alex Tabarrok Strategic Voting.
5-2 Election Theory Flaws of Voting.
Voting systems Chi-Kwong Li.
Voting and social choice
Frontiers of Microeconomics
CPS 173 Voting and social choice
democracy Experts and Justification Matt Bennett
CPS Voting and social choice
Arrow’s Conditions and Approval Voting
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Presentation transcript:

Alex Tabarrok Arrow’s Theorem

Review Election Outcome Voting System Individual Rankings B D A B C C C A B D D A B Voting System Election Outcome B D A C Review: The relationship between inputs and outputs can be quite unexpected. Changes in A and B over here can change the ranking of C over here. Move up in inputs, move down in outputs. Everyone can be rational and decisive yet the outcome can be intransitive cycles. Everyone can prefer A>B yet the outcome can be B<A.

Arrow’s Theorem Election Outcome Voting System Individual Rankings Independence of Irrelevant Alternatives and Unanimity condition Transitive and unrestricted Transitive and complete Individual Rankings B D A C C C A B D D A B Voting System Election Outcome B D A C Ken Arrow, 1972 Nobel prize in economics. Transitive – no cycle, we want an outcome. Unanimity – if everyone prefers A to B then society out to choose A to B. IIA – the ranking of A and B should only depend on the ranking of A and B and not on C. If individual rankings are transitive and unrestricted and the election outcome is transitive and complete then the only voting system which satisfies independence of irrelevant alternatives and the unanimity condition is a dictatorship. If individual rankings are transitive and unrestricted If individual rankings are transitive and unrestricted and the election outcome is transitive and complete If individual rankings are transitive and unrestricted and the election outcome is transitive and complete then the only voting system which satisfies independence of irrelevant alternatives and the unanimity condition

Arrow’s Theorem Election Outcome Voting System Individual Rankings Independence of Irrelevant Alternatives and Unanimity condition Transitive and unrestricted Transitive and complete Individual Rankings B D A C C C A B D D A B Voting System Election Outcome B D A C Alternative reading: All democratic voting system will fail to satisfy at least one of independence of irrelevant alternatives, the unanimity condition or transitivity of the outcome – thus all voting systems will sometimes result in “paradoxical” outcomes.

The Axioms and the Theorem Universal domain – all individually rational preference orderings are allowed as inputs into the voting system. Completeness and Transitivity – the derived social preference ordering should be complete and transitive. Unanimity condition– if every voter prefers X>Y then the voting system should rank X>Y. Independent of Irrelevant Alternatives – the social ranking of X and Y should depend only on how individuals rank X and Y (and not on how they rank some “irrelevant” alternative W relative to X and Y). Non-imposition – an outcome is not to be imposed which is independent of voter preferences. Non-dictatorship – the voting rule cannot be based solely on one person’s preferences. Arrow’s Impossibility Theorem- No Voting System satisfies all the axioms.

Review of Voting Paradoxes None of the voting systems we look at earlier was dictatorial or imposed so they each must violate at least one and perhaps several of Arrow's other axioms. Positional vote systems like plurality rule violate the Independence of Irrelevant Alternatives axiom. (Nader was relevant). Pairwise voting with majority rule violates the Transitivity axiom (i.e. majority rule can create cycles). Positive Association was violated by runoff procedures.

A Voting System is an Aggregation Mechanism Individual Rankings (Inputs) B D A C C C A B D D A B Voting System (Aggregation Mechanism) Election Outcome (Global Ranking) B D A C E.g. take as input the output of Google, Yahoo, Bing and produce a super-search. Arrow’s theorem applies. It says for example that assuming the other requirements hold it will always be the case that irrelevant alternatives such as C will change the outcome between A and B. -> gamiing Grades-> quite possible to producing a grade system where a majority rank A>B but the global rank is B<A

Escaping Arrow? Arrow’s theorem says the 6 axioms cannot all be true at the same time. What if we modify or drop one of the axioms. For a democratic system we don’t want to drop non-imposition or non-dictatorship. So that leaves us with: Universal domain – all individually rational preference orderings are allowed as inputs into the voting system. Completeness and Transitivity – the derived social preference ordering should be complete and transitive. Unanimity– if every voter prefers X>Y the voting system should rank X>Y. Independent of Irrelevant Alternatives – the social ranking of X and Y should depend only on how individuals rank X and Y (and not on how they rank some “irrelevant” alternative W relative to X and Y).

Giving up Universal Domain Giving up UD is the same as looking for a voting system which will work well for some but not all distributions of individual preference rankings. If everyone has identical preferences, for example, then majority rule is a perfectly acceptable voting system (i.e. it will satisfy the remaining axioms). But a voting system which works well only when everyone has identical preferences is not very useful. We are thus interested in knowing how much homogeneity we need to impose on preference orderings if we want a voting system which satisfies the remaining 5 axioms. The answer is that quite a lot of homogeneity is required but perhaps not so much to be uninteresting.

Single Peaked Preferences on a Single Dimension If everyone's preferences are single peaked on the same single dimension then majority rule satisfies the remaining 5 axioms. Single dimension, e.g. left-right. Single-peaked – each voter has an ideal point and the further away from the ideal point the lower their utility. Non single peaked voter Single peaked “moderate” voter Single peaked “left” voter Single peaked “right” voter Left Right

The Median Voter Theorem (Anthony Downs, 1957, An Economic Theory of Democracy) If every voter’s preferences are single peaked on a single dimension then majority rule with pairwise voting satisfies Arrow’s Theorem. Irrelevant alternatives are irrelevant and there are no cycles because the median voter’s preferences are unbeatable in pairwise voting (i.e. the median voter’s preferences are a Condorcet winner) R D R R D Less Spending More Spending Median Voter

Median Voter Theorem If people are homogeneous enough that everyone fits on a left-right or other single-dimension spectrum then majority rule with pairwise voting works well. The MVT is also very useful because it implies that the group will behave as if it were an individual wtih rational preferences. Thus, one can make predictions and models of voter behavior assuming the MVT such as the Meltzer-Richards model.

Dropping Completeness The completeness axiom requires given any question of the form `Is X socially preferred to Y or is Y socially preferred to X or are X and Y socially indifferent?' the voting system must return a definite answer. But suppose that X is the outcome, "tax Peter to pay Paul," and Y the outcome "tax Paul to pay Peter." A libertarian would argue that the question `Is X socially preferable to Y' has no answer (Rothbard 1956). In an ideal libertarian society the only legitimate exchanges are between individuals who agree to those exchanges. A `voting system' for such a society is nothing more than the market. The libertarian believes that the only meaning that `X is socially preferred to Y 'can have is `X was arrived at by voluntary exchange from Y'. In the libertarian view, the fact that non-voluntary exchanges cannot be ranked is not a fault of the market as a social choice mechanism it is rather an expression of the fact that there is no social preference ordering between non-voluntary exchanges. We can satisfy Arrow’s Theorem if we allow that many options cannot be ranked. But is true that the two outcomes Paul kills Peter and Paul taxes Peter one penny cannot be ranked?

Weakening Transitivity Transitivity requires if X>Y and Y>Z then X>Z and also if X~Y and Y~Z then X~Z Quasi-transitivity allows X~Y and Y~Z but X>Z. e.g. X is 4 grams of sugar in coffee, Y is 4.5 grams and Z is 5 grams. Surprisingly, if weaken transitivity of the outcome to quasi-transitivity then all of Arrow’s other axioms can be satisfied but instead of a dictatorship we get an oligarchy. Interesting but probably not a useful path.

Dropping IIA

Dropping IIA

Dropping IIA If we drop IIA there are lots of voting systems that satisfy Arrow’s other axioms. The positional voting systems, for example, ask voters to rank their candidates from best to worst and then assign points from to best to worst. Winner of the election is the candidate who receives the most points. Plurality Rule Borda Count MVP Baseball 1 2 1 14 9 8

Dropping IIA If we use a positional voting system then “irrelevant” candidates and preferences will matter. The Nader Problem. Defenders of these systems say that is ok because these systems are measuring relative intensity and that is desirable. But which is the right system for measuring intensity? Should first place votes get 3 points and second place 2 or should first place votes get 10 points and second place votes 4? Also are these systems really measuring intensity?

Dropping IIA

Bottom Line: No (easy?) escape! Arrow’s Theorem Bottom Line: No (easy?) escape! Group choice is not like individual choice and never will be. All democratic voting systems are subject to certain paradoxes and inconsistencies!