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.

Slides:



Advertisements
Similar presentations
Reasons for (prior) belief in Bayesian epistemology
Advertisements

Chapter Thirty-One Welfare Social Choice u Different economic states will be preferred by different individuals. u How can individual preferences be.
Computational Game Theory Amos Fiat Spring 2012
A Simple Proof "There is no consistent method by which a democratic society can make a choice (when voting) that is always fair when that choice must be.
6.896: Topics in Algorithmic Game Theory Lecture 18 Constantinos Daskalakis.
Voting and social choice Vincent Conitzer
1 Public choice Alexander W. Cappelen Econ
1 EC9A4 Social Choice and Voting Lecture 3 EC9A4 Social Choice and Voting Lecture 3 Prof. Francesco Squintani
Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 9: Social Choice Lecturer: Moni Naor.
Voting and social choice Looking at a problem from the designers point of view.
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.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
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 Theory.
Social Choice Session 3 Carmen Pasca and John Hey.
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.
What is your favorite food?. Preference Schedule A Preference Schedule is a way to represent the order in which people like (prefer) certain items. The.
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
Social Choice Session 2 Carmen Pasca and John Hey.
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.
On the Aggregation of Preferences in Engineering Design Beth Allen University of Minnesota NSF DMI
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 Welfare, Arrow + Gibbard- Satterthwaite, VCG+CPP 1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A A A A.
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.
Arrow’s Impossibility Theorem
Arrow’s theorem and the problem of social choice.
CPS Voting and social choice Vincent Conitzer
1 EC9A4 Social Choice and Voting Lecture 1 EC9A4 Social Choice and Voting Lecture 1 Prof. Francesco Squintani
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:
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
1 EC9A4 Social Choice and Voting Lecture 2 EC9A4 Social Choice and Voting Lecture 2 Prof. Francesco Squintani
Great Theoretical Ideas in Computer Science.
Let’s take a class vote. How many of you are registered to vote?
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
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.
Negotiating Socially Optimal Allocations of Resources U. Endriss, N. Maudet, F. Sadri, and F. Toni Presented by: Marcus Shea.
Mathematical Foundations of Computer Science Chapter 3: Regular Languages and Regular Grammars.
Lecture 02: Theory of Automata:2014 Asif Nawaz Theory of Automata.
Arrow’s Conditions 1.Non-Dictatorship -- The social welfare function should account for the wishes of multiple voters. It cannot simply mimic the preferences.
Social Choice Lecture 16 John Hey. More Possibility/Impossibility Theorems Sen’s Impossibility of a Paretian Liberal Gibbard’s theory of alienable rights.
Arrow’s Impossibility Theorem
Arrow’s Impossibility Theorem: A Presentation By Susan Gates
Impossibility and Other Alternative Voting Methods
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
Applied Mechanism Design For Social Good
Impossibility and Other Alternative Voting Methods
Introduction If we assume
Alex Tabarrok Arrow’s Theorem.
Voting systems Chi-Kwong Li.
Voting and social choice
Introduction to Social Choice
CPS Voting and social choice
Presentation transcript:

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 preferences into social preferences. Just two alternatives. More than 2 alternatives. Arrow’s axioms and his Impossibility Theorem. Possibilities (relaxing some axiom): (1) Borda Count, (2) Single-peaked preferences/Median voter. Conclusions

What are we trying to do in this lecture? Starting with individual preferences over social alternatives, we will try and aggregate them into social preferences. Let x ≥ i y mean that individual i ( = 1,.., I) prefers alternative x to alternative y. A social welfare function must assign a rational preference relation F(≥ 1,... ≥ I ) to any set ≥ 1,... ≥ I.

Just two alternatives Alternatives x and y. (One could be the status quo.) I individuals. Preferences given by (α 1,... α I ) where each α takes the value 1, 0 or -1 depending whether the individual prefers x, is indifferent, or prefers y. A Social Welfare Functional is a rule that assigns a social preference, that is a number -1, 0 or 1, to each possible profile of individual preferences.

Just two alternatives: a simple example F(α 1,... α I ) = 1 if Σ i β i α i > 0, = 0 if Σ i β i α i = 0 and = -1 if Σ i β i α i < 0. A particularly important case is when β i =1 for all i. This is just majority voting. Dictatorship if α h = 1 (0, -1) implies F(α 1,... α I ) = 1 (0, -1). Anonymity is implied by β i =k all i. Neutral between alternatives if F(α 1,... α I ) = - F(-α 1,... -α I ) Positively responsive if.... May’s Theorem: A SWF is a majority voting SWF if and only if it is symmetric, neutral between alternatives and positively responsive.

Arrow’s Impossibility Theorem There are at least three alternatives. There are N individuals with transitive (perhaps different) preferences. unanimity (or weak pareto): society ranks a strictly above b if all individuals rank a strictly above b. independence of irrelevant alternatives: the social ranking of two alternatives a and b depends only on their relative ranking by every individual. The Theorem: Any constitution that respects completeness, transitivity, independence of irrelevant alternatives and unanimity is a dictatorship.

Arrow’s Impossibility Theorem: Proofs Of course, there is the original proof. There is a nice example (with just 2 voters and 3 alternatives) on the site at choice/documents/arrow impossibility theorem.pptwww.luiss.it/hey/social choice/documents/arrow impossibility theorem.ppt There is another nice example at choice/documents/john bone and arrow.pptwww.luiss.it/hey/social choice/documents/john bone and arrow.ppt There are three simple proofs in the paper by Geanakoplis which I have also put on the site: choice/documents/geanakoplis 3 proofs of arrow.pdf. choice/documents/geanakoplis 3 proofs of arrow.pdf There is also a proof in the book by Wulf Gaertner A Primer in Social Choice Theory, LSE Perspectives in Economic Analysis. I will follow this and perhaps look briefly at the nice example above.

An important preliminary Let b be some arbitrary alternative. We show: if every voter puts b either at the top or the bottom of his or her ranking, then so must society. Proof: suppose to the contrary that for such a profile, then for distinct a, b and c, the social preference has a≥b and b≥c. By independence this must continue even if all individuals move c above a. (No ab or bc votes would be disturbed.) By transitivity a≥c but by unanimity c>a. Contradiction.

Proof of Arrow. We start with Unanimity and then move b up place by place and person by person R1R1..R m-1 RmRm R m+1...RnRn R social order a...aaa aa b bbb bb

Looking for the Pivotal Voter (Keeping all the other alternatives fixed) R1R1...R m-1 RmRm R m+1...RnRn R social order b...aaa aa a b bbb b.

Looking for the Pivotal Voter R1R1..R m-1 RmRm R m+1...RnRn R social order b...baa aa a ab b b b.

The Pivotal Voter (m) R1R1..R m-1 RmRm R m+1...RnRn R social order b...bba ab a aa..a b b.

After the Pivotal Voter R1R1..R m-1 RmRm R m+1...RnRn R social order b...bbb ab a aaa.a b.

Unanimity again R1R1..R m-1 RmRm R m+1...RnRn R social order b...bbb bb a aaa aa

Table 1 (top) before and Table 2 (bottom) after the pivotal voter R1R1..R m-1 RmRm R m+1...RnRn R b..baa...aa a..ab b b...b. R1R1..R m-1 RmRm R m+1...RnRn R b bba ab a aa..a b b.

Now we move alternative a We move alternative a to the lowest position of individual i‘s ordering for i<m... We move alternative a to the second lowest position of individual i‘s ordering for i>m... We keep individual m as is Look at the bottom graph. Because of Independence social ranking does not change...

Table 1 (top) before and Table 2 (bottom) after the pivotal voter R1R1..R m-1 RmRm R m+1...RnRn R b..baa...aa a..ab b b...b. R1R1..R m-1 RmRm R m+1...RnRn R b bba ab a aa..a b b.

Table 1’ (top) before and Table 2’ (bottom) after the pivotal voter- see Gaertner pages 26/7. R1R1..R m-1 RmRm R m+1...RnRn R b..ba.....a....b.....b a...a. a..a.b...b. R1R1..R m-1 RmRm R m+1...RnRn R b bb..b..a..a a a. a a.b b.

What is crucial is the Independence of Irrelevant Alternatives Axiom The relative positions of a and b do not change for anyone going from table 1 to table 1’. Note that the relative rankings differ from individual to individual (“People are Different”) but we have the same relative rankings for each individual in the two tables. So a, being socially best in Table 1 remains so in Table 1’.

We can begin to see why the Pivotal Voter is a dictator – because a is socially chosen here. R1R1..R m-1 RmRm R m+1...RnRn R b..ba.....a....b.....b a...a. a..a.b...b.

Now move b downwards – a remains top. (Note that in Tables 1 and 1’ b is above a for 1 to m-1 and a is above b for m+1 to N) R1R1..R m-1 RmRm R m+1...RnRn R....a.....a b.... b..b.a...a. a..a.b...b.

Now identify a third alternative c – above b – a remains top, because all we have done is to identify c. (Step 3) (Note that in Tables 1 and 1’ b is above a for 1 to m-1 and a is above b for m+1 to N) R1R1..R m-1 RmRm R m+1...RnRn R....a.....a....c c..cbc...c. b..b.a...a. a..a.b...b.

Now Reverse a and b for i >m Can b become best? NO because c is preferred to b by all. And c cannot be preferred to a since we have not changed the rankings of a and c. R1R1..R m-1 RmRm R m+1...RnRn R....a.....a....c c..cbc...cc b..b.b...b. a..a.a...ab

Penultimately consider this (Step 5 first part) Pivotal Voter m is dictatorial. (Note that c cannot effect the social ranking between a and b) R1R1..R m-1 RmRm R m+1...RnRn R c..cac...ca....c b.....c b..b.b...b. a..a.a...ab

... and finally (Step 5 second part)... Pivotal Voter m is dictatorial wrt a versus any other option. R1R1..R m-1 RmRm R m+1...RnRn R b..bab...ba....b c.....b c..c.c...c. a..a.a...ac

More than one dictator?! Note that a was chosen arbitrarily at the start of this argument. Hence there is a dictator for every a. Can there be different dictators for different alternatives? Obviously not – otherwise we would get contradictions (in the construction of the social ordering whenever these ‘potential dictators’ have individual orderings that are not the same). Therefore there can only be one dictator. FASCINATING!

Possibilities Must relax some axiom to get a SWF: (1) Borda Count, (2) Single-peaked preferences/Median voter. We note that the Borda count does not satisfy the pairwise independence condition. The reason is simple: the rank of any alternative depends upon the placement of every other alternative. Single-peaked preferences put strong restrictions on the domain of preferences.

Borda Count Suppose number of alternatives is finite. Denote generic alternatives by x and y. For individual i, define the count c i (x) = n if x is the n’th ranked alternative in the order of i. (Indifference....) Now define a SWF by adding up these counts – so This preference relation is complete and transitive and Paretian. However it does not satisfy the pairwise independence condition.

Single-Peaked Preferences Let decision variable be x. Suppose the utility of decision-maker i is u(x). Suppose u(.) is single-peaked for all i, for example: Not like this: Then pairwise majority voting generates a well-defined social welfare functional. See next slide.

Single-Peaked Preferences Suppose all utility functions are single-peaked. Here Agent 5 is the Median Agent The value x 5 will beat any other value in majority voting.

Lectures 14 and 15 SWFs are generally impossible (in the sense that unamity, independence of irrelevant alternatives and non-dictatorship are mutually inconsistent) However in special cases: Borda rule; Single- peaked preferences; they are possible. These relax the restrictions implied above: the Borda count relaxes IIR and single-peaked preferences restrict the domain. Is all of this surprising? Why do we have politicians?