Arrow’s Impossibility Theorem

Slides:



Advertisements
Similar presentations
Computational Game Theory Amos Fiat Spring 2012
Advertisements

Chapter 10: The Manipulability of Voting Systems Lesson Plan
1 Public choice Alexander W. Cappelen Econ
Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 9: Social Choice Lecturer: Moni Naor.
Math 1010 ‘Mathematical Thought and Practice’ An active learning approach to a liberal arts mathematics course.
© 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.
Mark Wang John Sturm Sanjeev Kulkarni Paul Cuff.  Basic Background – What is the problem?  Condorcet = IIA  Survey Data  Pairwise Boundaries = No.
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.
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,
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.
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.
Reshef Meir Jeff Rosenschein Hebrew University of Jerusalem, Israel Maria Polukarov Nick Jennings University of Southampton, United Kingdom COMSOC 2010,
Frontiers of Microeconomics
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.
Voting Rules: What’s Fair? Q. What is the most fair voting rule? Suppose three proposals to spend $15: Z=Status Quo (currently, we spend $10 on guns and.
A Fourier-Theoretic Perspective on the Condorcet Paradox and Arrow ’ s Theorem. By Gil Kalai, Institute of Mathematics, Hebrew University Presented by:
Social choice (voting) Vincent Conitzer > > > >
MAT 105 Spring  We have studied the plurality and Condorcet methods so far  In this method, once again voters will be allowed to express their.
Arrow’s Impossibility Theorem
Arrow’s Theorem The search for the perfect election decision procedure.
CPS Voting and social choice Vincent Conitzer
Chapter 12 Decision Rights The Level of Empowerment.
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:
Chapter 10: The Manipulability of Voting Systems Lesson Plan An Introduction to Manipulability Majority Rule and Condorcet’s Method The Manipulability.
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?
Part 4: Voting Topics - Continued
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,
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 –
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
Impossibility and Other Alternative Voting Methods
Introduction If we assume
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
1.3 The Borda Count Method.
Alex Tabarrok Arrow’s Theorem.
Social Choice Theory [Election Theory]
Voting Rules: What’s Fair?
Voting systems Chi-Kwong Li.
Frontiers of Microeconomics
Frontiers of Microeconomics
Quiz – 1/24 - Friday How many people voted in the election?
Chapter 9: Social Choice: The Impossible Dream Lesson Plan
Frontiers of Microeconomics
Presentation transcript:

Arrow’s Impossibility Theorem

Plan Majority voting Borda rule Arrow’s impossibility theorem Condorcet theorem Cycles Borda rule Condorcet critique (dependence on irrelevant alternatives) Arrow’s impossibility theorem

Why Use Majority Voting? (Nicolas Caritat, Marques De Condorcet, 1785) Assume n people have to decide whether to choose alternative A or B. There is equal probability that either of the choices is correct a-priori. Each one has private information that supports his judgement about the correct decision and assume that each one is more likely to be right than wrong. Their judgements are independent. Then the probability that a group makes correct choice under majority rule approaches one as n approaches infinity

Majority Voting With More Than Two Alternatives A condorcet winner is an alternative that gets majority of votes against any other alternative.

Find a Condorcet Winner An example Three citizens have to choose a project. There are three possible options: A,B,C. Each citizen ranks the options in the following way.

The Condorcet Paradox (Voting Cycles) An example Three citizens have to choose a project. There are three possible options: A,B,C. Each citizen ranks the options in the following way.

Sincere Voting and Strategic Voting Assume that first A is voted against B and then the winner is voted against C. Assume that everybody votes sincerely. What is the outcome? Now, let the order of the issues on the agenda be the same and assume that voter one realizes the outcome would he be voting sincerely. Should he change his behavior? What will be the outcome if he does?

Agenda Setting Power In case you want to induce outcome A and you know that everybody votes sincerely, what agenda (order of issues to be put to voting) would you suggest? Would you change your agenda, if you knew the voters were strategic?

Borda Rule (Jean Charles de Borda 1770) Let every voter assign a score to each one of the options. Count the total score of an option by summing up the scores given by the voters. The winner is the option that scores the highest.

Borda Rule vs Majority Rule What will be the outcome if Borda rule was used for this scenario? Assume majority voting with sincere voters. Can an agenda setter find an order of issues to induce Z? Y? X?

Condorcet Critique of Borda Rule (a simple example) Compare the outcome of the previous scenario to the following: Note that the only difference here is that voters 2,3 prefer Z to X (switch in the ordering of “irrelevant” alternatives)

Next? We saw that both Borda Rula and Majority Voting have undesirable features The outcome under Borda rule may depend on the ordering of “irrelevant alternatives” The social ordering induced by majority voting may be inconsistent (include cycles), thus giving excessive powers to an agenda setter. Is there a “good” collective decision rule?

What is a “good” rule that aggregates individual preferences? (Uniformity) It has to rank the alternatives whatever the configuration of individuals’ preferences is (Completeness) It has to rank all possible alternatives (Pareto) If all individuals prefer A to B, it has to rank A over B (Transitivity) If it ranks A over B and B over C, it has to rank A over C (IIA) Ranking of A over B has to be independent of how the indivuduals rank other alternatives

Arrow’s Impossibility Theorem Social ranking that satisfies all the properties (U, C, P, T, IIA) has to be dictatorial.