Arrow's Impossibility Theorem Kevin Feasel December 10, 2006

Slides:



Advertisements
Similar presentations
Figure and Table Captions
Advertisements

Introduction to Formatting VistaPHw Charts Brought to you by: The Vista Partnership February 2007.
Voting and social choice Vincent Conitzer
Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 9: Social Choice Lecturer: Moni Naor.
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.
Computational Democracy: Algorithms, Game Theory, and Elections Steven Wolfman 2011/10/27.
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.
15 THEORY OF GAMES CHAPTER.
Voting Theory.
San Mateo Behavioral Health and Recovery Services AVATAR 2010 Upgrade.
Playing Fair at Sudoku Joshua Cooper USC Department of Mathematics.
Please wait for further instructions. Your payment for participating will depend partly on your decisions, partly on the decisions of other participants.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 22 By Herbert I. Gross and Richard A. Medeiros next.
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.
6.3 Basic Counting Principles In this section, we will see how set operations play an important role in counting techniques.
1.2 Row Reduction and Echelon Forms
Linear Equations in Linear Algebra
Section 2.3 Gauss-Jordan Method for General Systems of Equations
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.
1 Manipulation of Voting Schemes: A General Result By Allan Gibbard Presented by Rishi Kant.
Example 9.1 Goal Programming | 9.3 | Background Information n The Leon Burnit Ad Agency is trying to determine a TV advertising schedule.
Frontiers of Microeconomics
Social choice theory = preference aggregation = truthful voting Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
MOHAMMAD IMRAN DEPARTMENT OF APPLIED SCIENCES JAHANGIRABAD EDUCATIONAL GROUP OF INSTITUTES.
Table of Contents Matrices - Calculator Operations The graphing calculator can be used to do a variety of matrix calculations, as shown in the following.
1 Modified_ CIRCUIT PROTECTION SOLUTIONS Confidential and Proprietary to Littelfuse, Inc. ® Littelfuse, Inc All rights reserved. February,
Overview Aggregating preferences The Social Welfare function The Pareto Criterion The Compensation Principle.
Decision Theory CHOICE (Social Choice) Professor : Dr. Liang Student : Kenwa Chu.
Key Stone Problem… Key Stone Problem… next Set 22 © 2007 Herbert I. Gross.
Arrow’s Impossibility Theorem
CPS Voting and social choice Vincent Conitzer
ECE 2300 Circuit Analysis Lecture Set #6 The Node Voltage Method with Voltage Sources.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
HKOI2006 Analysis and Solution Junior Q3 – Sudoku HKOI Training Team
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.
Visio Starter Tutorial Developed from Material by Daniel L. Silver
Learning PowerPoint Presenting your ideas as a slide show… …on the computer!
Matching Lecture 19: Nov 23.
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.
2-33. THE COLOR SQUARE GAME OBJECTIVE: FIGURE OUT THE ARRANGEMENT OF COLORED SQUARES ON A 3 × 3 GRID OR A 4 × 4 GRID USING AS FEW CLUES AS POSSIBLE. Rules:
Desktop Publishing Lesson 5 — Enhancing Publications.
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
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.
Example 3.1a Sensitivity Analysis and Solver Table Add-in.
Here is a small example of the puzzle you will be completing today. You will start in the top left corner, and end at the bottom right using 3 different.
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
Module 3 – Part 2 Node-Voltage Method with Voltage Sources
Impossibility and Other Alternative Voting Methods
How Many Ways Can 945 Be Written as the Difference of Squares?
Define the problem Pouya amani lori
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
Alex Tabarrok Arrow’s Theorem.
Voting systems Chi-Kwong Li.
Frontiers of Microeconomics
Viewing Provider Schedules
Viewing Provider Schedules
Welcome to this experiment. Thank you for participating.
Game Theory: The Nash Equilibrium
Frontiers of Microeconomics
Presentation transcript:

Arrow's Impossibility Theorem Kevin Feasel December 10,

The Rules 2 individuals with 3 choices (x, y, z) --> 6 profiles for each.  x > y > z, x > z > y, y > x > z, y > z > x, z > x > y, z > y > x  36 profiles in all for our two-person example (6 * 6)

The 36 Profiles

Explanation Of Symbols Colored Text  Blue – First choice for both  Green – Second choice for both  Red – Third choice for both  Black – Inconsistent choices (e.g., in profile 10, Z > Y for person A but Y > Z for person B) Numbers along the left-hand side depict the #1, #2, and #3 choices for person A. Numbers along the bottom depict the #1, #2, and #3 choices for person B. Each profile has a number (e.g., 1 and 10 here). How to read this: for profile 10, person A (left-hand side) likes Z > X > Y. Person B (bottom) prefers X > Y > Z.

The Assumptions Completeness – All profiles must be solvable. In this case, we have 3 choices among 2 people, so 36 total sets of preferences could arise. We must have a solution for each one of the 36.

The Assumptions Unanimity – If all individuals agree on a single position, that position will be guaranteed.  In our case, if an option is red, both individuals rank this option as the #3 choice, so it will end up as #3 in the preference ranking setup.

The Assumptions Independence of Irrelevant Alternatives – The relationship between X and Y should be independent of Z. In general terms, the relationship between two elements will not change with the addition of another element.  Example: in profile 25, X > Y for person A (X > Y > Z) and for person B (X > Z > Y). Adding in option Z, we assume, does not alter this relationship.  Example: in profile 26, Y > X for person A (Y > Z > X) and for person B (Z > Y > X). If we removed option Z, we would still expect Y > X for both.

Proving The Final Rule Non-dictatorship. We want to understand whether we can come up with a social rule which follows the rules of completeness, unanimity, and independence of irrelevant alternatives, and which is simultaneously non-dictatorial. “Dictatorial” here means that all 36 profiles will match one person's profiles exactly. In other words, all social choices will precisely match the individual's preferences.

Solving The Problem 6 preference sets are already solved, thanks to unanimity. In profile 1, for example, all parties agree that X > Y > Z, so X > Y > Z is the social rule. These six completed profiles have the “>” highlighted in yellow.

Solving The Problem

In addition to this, we know that any profile with colored text is also solved—both people agree on where to place this option. So these can all be filled in as well.

Solving The Problem

There are two remaining sets of relationships, as shown in profile 23.  a > b: in this example, Y > Z for both individuals. Y is the #2 choice for person A and Z #3, whereas Y is the #1 choice for person B and Z #2. In a case such as this, we know that Y > Z in the social preferences because both people prefer Y to Z.  a ? b: in this example, Z > X for person B, but X > Z for person A. A's preferences are X > Y > Z and B's are Y > Z > X. In this type of situation, we do not yet know if Z or X will be socially preferred because there is no agreement between individuals.

Solving The Problem In this case, because we know that Y > Z socially, we can put that down. But we do not know if Y > Z > X, Y > X > Z, or X > Y > Z, so we will not write these down just yet, but once things start clearing up, these rules will be used. The key here is that Z is above and to the right of Y, which means that there is agreement that Y > Z. However, Z is above and to the left of X, meaning there is conflict. Y is also above and to the left of X, so there is another conflict, due to the fact that X > Y > Z for person A, but Y > Z > X for person B.

The Single Choice If we look at profile 7, there is a single choice to be made.  Person A (left-hand column): X > Z > Y  Person B (bottom row): X > Y > Z We know that X will be the #1 preference, but we have to decide whether Y > Z or Z > Y here. We can choose either, but let us pick that Y > Z. In other words, we support person B's preference here.  This means that the social preference will be X > Y > Z. In addition, because of the Independence of Irrelevant Alternatives axiom, any time we see a conflict between Y and Z similar to the one in profile 7, we know to choose Y > Z. Let us fill in the chart with this new information...

Results

Explanation The profiles which have been newly solved (old solutions are colored green; new are yellow) are profiles 7, 8, 9, 10, 17, and 33. 7, 8, 17, and 33 were solved due to knowing one position already because of unanimity. 9 was solved because both individuals support Z > X, so we know that Y > Z > X there. 10 was solved because both individuals support X > Y, so we know that the result must be X > Y > Z. In doing this, we also have a new rule: in 33, X is above and to the left of Y, and X > Y. Because of Independence of Irrelevant Alternatives, we can state that X > Y whenever X is above and to the left of Y, like in 33. This will allow us to fill in more profiles, which we will do now.

Step 2 Results

Step 2 Results Explanation We have 7 new completed profiles: 28, 30, 31, 32, 34, 35, 36. In addition, we have two new rules, as determined by profile 28. When X is above and to the left of Z, X > Z. Also, when Z is above and to the left of Y, Z > Y Let us see how many new solutions we can find knowing that:  Y above and to the left of Z --> Y > Z  X above and to the left of Y --> X > Y  X above and to the left of Z --> X > Z  Z above and to the left of Y --> Z > Y

Step 3 Results

Step 3 Results Explanation Now we have profiles 13, 14, 15, 16, 24, 25, 26, 27, and 29 filled in. And, once more, we have another rule, determined from 27: when Y is above and to the left of X, Y > X. This will lead to yet more results.

Step 4 Results

Step 4 Results Explanation Now profiles 11, 12, 18, 19, 22, and 23 are filled in. And, from profile 22, we can determine that when Z is above and to the left of X, Z > X. This results in:

Step 5 Results

Step 5 Results Explanation What happened?  In all 36 cases, person B (bottom row) matches up exactly with the social preferences. In other words, person B is our dictator. How did this happen?  We made one decision and used unanimity (in cases where X, Y, or Z was above and to the right) and independence of irrelevant alternatives (where X, Y, or Z was abo ve and to the left) to solve the rest.

What Does This Mean? Any complete social preference order which obeys both unanimity and independence of irrelevant alternatives will be dictatorial (as described on slide 8). A non-dictatorial social preference ranking would require dropping one of the three other desirable conditions. Normally, completeness and the independence of irrelevant alternatives are dropped.

Practical Results Cannot develop a rational social preference function like what we have for individual preferences No voting mechanism will simultaneously satisfy completeness, unanimity, independence of irrelevant alternatives, and non-dictatorship.