THREE BRIEF PROOFS OF ARROW S IMPOSSIBILITY THEOREM JOHN GEANAKOPLOS COWLES FOUNDATION PAPER NO. 1116

Similar documents
Arrow s General (Im)Possibility Theorem

Social Choice Theory. Felix Munoz-Garcia School of Economic Sciences Washington State University. EconS Advanced Microeconomics II

Non-Manipulable Domains for the Borda Count

Arrow s Paradox. Prerna Nadathur. January 1, 2010

arxiv: v2 [math.co] 14 Apr 2011

Cowles Foundation for Research in Economics at Yale University

6.207/14.15: Networks Lecture 24: Decisions in Groups

Dependence and Independence in Social Choice Theory

Social Choice. Jan-Michael van Linthoudt

Follow links for Class Use and other Permissions. For more information send to:

Social choice theory, Arrow s impossibility theorem and majority judgment

Online Appendix to Strategy-proof tie-breaking in matching with priorities

On the Chacteristic Numbers of Voting Games

Strategy-Proofness on the Condorcet Domain

Coalitionally strategyproof functions depend only on the most-preferred alternatives.

The Axiomatic Method in Social Choice Theory:

13 Social choice B = 2 X X. is the collection of all binary relations on X. R = { X X : is complete and transitive}

Arrow s Theorem as a Corollary

Rationalization of Collective Choice Functions by Games with Perfect Information. Yongsheng Xu

GROUP DECISION MAKING

DICTATORIAL DOMAINS. Navin Aswal University of Minnesota, Minneapolis, USA Shurojit Chatterji Indian Statistical Institute, New Delhi, India and

Antonio Quesada Universidad de Murcia. Abstract

Volume 31, Issue 1. Manipulation of the Borda rule by introduction of a similar candidate. Jérôme Serais CREM UMR 6211 University of Caen

Positively responsive collective choice rules and majority rule: a generalization of May s theorem to many alternatives

Coalitional Structure of the Muller-Satterthwaite Theorem

The Gibbard random dictatorship theorem: a generalization and a new proof

Finite Dictatorships and Infinite Democracies

Ordered Value Restriction

A topological approach to Wilson s impossibility theorem

Multiple Equilibria in the Citizen-Candidate Model of Representative Democracy.

On the topological equivalence of the Arrow impossibility theorem and Amartya Sen s liberal paradox

An Equivalence result in School Choice

Lecture Notes, Lectures 22, 23, 24. Voter preferences: Majority votes A > B, B > C. Transitivity requires A > C but majority votes C > A.

APPLIED MECHANISM DESIGN FOR SOCIAL GOOD

MAXIMAL POSSIBILITY AND MINIMAL DICTATORIAL COVERS OF DOMAINS

Voting Systems. High School Circle II. June 4, 2017

A DISTANCE-BASED EXTENSION OF THE MAJORITY JUDGEMENT VOTING SYSTEM

A Characterization of Single-Peaked Preferences via Random Social Choice Functions

Comparing impossibility theorems

Condorcet Efficiency: A Preference for Indifference

3.1 Arrow s Theorem. We study now the general case in which the society has to choose among a number of alternatives

Talking Freedom of Choice Seriously

Binary Aggregation with Integrity Constraints

The Arrow Impossibility Theorem Of Social Choice Theory In An Infinite Society And Limited Principle Of Omniscience

Arrow s Impossibility Theorem: Preference Diversity in a Single-Profile World

Arrow s Impossibility Theorem and Experimental Tests of Preference Aggregation

Alternative Characterizations of Boston Mechanism

Partial lecture notes THE PROBABILITY OF VIOLATING ARROW S CONDITIONS

Unanimity, Pareto optimality and strategy-proofness on connected domains

Condorcet Consistency and the strong no show paradoxes

"Arrow s Theorem and the Gibbard-Satterthwaite Theorem: A Unified Approach", by Phillip Reny. Economic Letters (70) (2001),

Fair Divsion in Theory and Practice

THE UNIVERSITY OF KANSAS WORKING PAPERS SERIES IN THEORETICAL AND APPLIED ECONOMICS

A NEW SET THEORY FOR ANALYSIS

Binary Aggregation with Integrity Constraints

Chapter 12: Social Choice Theory

Preference, Choice and Utility

Survey of Voting Procedures and Paradoxes

The Review of Economic Studies, Ltd.

First-Order Logic Formalisation of Impossibility Theorems in Preference Aggregation

Implementation of the Ordinal Shapley Value for a three-agent economy 1

Recap Social Choice Fun Game Voting Paradoxes Properties. Social Choice. Lecture 11. Social Choice Lecture 11, Slide 1

Winning probabilities in a pairwise lottery system with three alternatives

Reference-based Preferences Aggregation Procedures in Multicriteria Decision Making

Static Decision Theory Under Certainty

Approximation Algorithms and Mechanism Design for Minimax Approval Voting

Logic and Social Choice Theory. A Survey. ILLC, University of Amsterdam. November 16, staff.science.uva.

Probabilistic Aspects of Voting

Social Welfare Functions that Satisfy Pareto, Anonymity, and Neutrality: Countable Many Alternatives. Donald E. Campbell College of William and Mary

A Note on the McKelvey Uncovered Set and Pareto Optimality

Economics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries

On Domains That Admit Well-behaved Strategy-proof Social Choice Functions

Intro to Economic analysis

arxiv: v1 [cs.gt] 29 Mar 2014

Dominance and Admissibility without Priors

Boolean Inner-Product Spaces and Boolean Matrices

UNIVERSITY OF NOTTINGHAM. Discussion Papers in Economics CONSISTENT FIRM CHOICE AND THE THEORY OF SUPPLY

Rationality and solutions to nonconvex bargaining problems: rationalizability and Nash solutions 1

A Quantitative Arrow Theorem

Fairness and Redistribution: Response

Metainduction in Operational Set Theory

INTEGER PROGRAMMING AND ARROVIAN SOCIAL WELFARE FUNCTIONS

On the Impossibility of Certain Ranking Functions

14.770: Introduction to Political Economy Lectures 1 and 2: Collective Choice and Voting

THE PROFILE STRUCTURE FOR LUCE S CHOICE AXIOM

Economic Core, Fair Allocations, and Social Choice Theory

Political Economy of Institutions and Development. Lectures 2 and 3: Static Voting Models

Approximation Algorithms and Mechanism Design for Minimax Approval Voting 1

(a i1,1 a in,n)µ(e i1,..., e in ) i 1,...,i n. (a i1,1 a in,n)w i1,...,i n

Implementing the Nash Extension Bargaining Solution for Non-convex Problems. John P. Conley* and Simon Wilkie**

Online Appendix for Incentives in Landing Slot Problems

Recognizing single-peaked preferences on aggregated choice data

Strategic Manipulability without Resoluteness or Shared Beliefs: Gibbard-Satterthwaite Generalized

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.

Existence Theorems of Continuous Social Aggregation for Infinite Discrete Alternatives

Quasi-transitive and Suzumura consistent relations

a (b + c) = a b + a c

Introductory notes on stochastic rationality. 1 Stochastic choice and stochastic rationality

The Simple Theory of Temptation and Self-Control

A MAXIMAL DOMAIN FOR STRATEGY-PROOF AND NO-VETOER RULES IN THE MULTI-OBJECT CHOICE MODEL

Transcription:

THREE BRIEF PROOFS OF ARROW S IMPOSSIBILITY THEOREM BY JOHN GEANAKOPLOS COWLES FOUNDATION PAPER NO. 1116 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY Box 208281 New Haven, Connecticut 06520-8281 2005 http://cowles.econ.yale.edu/

Economic Theory 26, 211 215 (2005) DOI: 10.1007/s00199-004-0556-7 Exposita Notes Three brief proofs of Arrow s Impossibility Theorem John Geanakoplos Cowles Foundation, Box 208281, New Haven, CT 06520-8281, USA (e-mail: john.geanakoplos@yale.edu) Received: July 9, 2001; revised version: September 2, 2004 Summary. Arrow s original proof of his impossibility theorem proceeded in two steps: showing the existence of a decisive voter, and then showing that a decisive voter is a dictator. Barbera replaced the decisive voter with the weaker notion of a pivotal voter, thereby shortening the first step, but complicating the second step. I give three brief proofs, all of which turn on replacing the decisive/pivotal voter with an extremely pivotal voter (a voter who by unilaterally changing his vote can move some alternative from the bottom of the social ranking to the top), thereby simplifying both steps in Arrow s proof. My first proof is the most straightforward, and the second uses Condorcet preferences (which are transformed into each other by moving the bottom alternative to the top). The third proof proceeds by reinterpreting Step 1 of the first proof as saying that all social decisions are made the same way (neutrality). Keywords and Phrases: Arrow Impossibility Theorem, Pivotal, Neutrality. JEL Classification Numbers: D7, D70, D71. Let A = {A, B,..., C} be a finite set of at least three alternatives. A transitive preference over A is a ranking of the alternatives in A from top to bottom, with ties allowed. We consider a society with N individuals, each of whom has a (potentially I wish to thank Ken Arrow, Chris Avery, Don Brown, Ben Polak, Herb Scarf, Chris Shannon, Lin Zhou, and especially Eric Maskin for very helpful comments and advice. I was motivated to think of reproving Arrow s theorem when I undertook to teach it to George Zettler, a mathematician friend. After I presented this paper at MIT, a graduate student there named Luis Ubeda Rives told me he had worked out the same neutrality argument as I give in my third proof while he was in Spain nine years ago. He said he was anxious to publish on his own and not jointly, so I encourage the reader to consult his forthcoming working paper. The proofs appearing here appeared in my 1996 CFDP working paper. Proofs 2 and 3 originally used May s notation, which I have dropped on the advice of Chris Avery.

212 J. Geanakoplos different) transitive preference. A constitution is a function which associates with every N-tuple (or profile) of transitive preferences a transitive preference called the social preference. A constitution respects unanimity if society puts alternative α strictly above β whenever every individual puts α strictly above β. The constitution respects independence of irrelevant alternatives if the social relative ranking (higher, lower, or indifferent) of two alternatives α and β depends only on their relative ranking by every individual. The constitution is a dictatorship by individual n if for every pair α and β, society strictly prefers α to β whenever n strictly prefers α to β. Arrow s Theorem. Any constitution that respects transitivity, independence of irrelevant alternatives, and unanimity is a dictatorship. The strategy in all three proofs is to find a limited dictator n, and then to prove that n must be a genuine dictator. We say that n is pivotal for alternatives α,β at a profile of preferences π if by putting α strictly above β, or the reverse, n induces the social preference to do the same, holding all other individual preferences fixed as in π. Barbera showed that there is a pivotal individual, who must then be a dictator. We say that an individual n is extremely pivotal for an alternative β at a profile π if n is pivotal for all pairs α, β involving β at π. Such an individual can move β from the very bottom of the social profile to the very top. In the first proof, we show that there is an extremely pivotal individual who must be a dictator. The critical step in the proof is an extremal lemma asserting that if every individual preference ranks β at the very top or the very bottom, then so must the social preference, even if half the individuals put β at the top and the other half put β at the bottom. We say that an individual n is a local dictator at a profile π if n is pivotal for all pairs α, β at π. In our second proof, we show that there is a local dictator, who must then be a genuine dictator. The critical idea here is to look at Condorcet profiles, where each preference is a cyclical permutation of the others. Such a permutation is generated by moving the very top alternative to the very bottom. Arrow motivated his impossibility theorem by Condorcet s paradox. In our last proof we begin with a lemma proving that Arrow s axioms imply neutrality, namely that every decision must be made the same way, independent of the names of the alternatives. We use it to show that any pivotal voter is a dictator. The neutrality lemma is equivalent to the extremal lemma, but for variety we give a different proof of it. First Proof Extremal Lemma. Let alternative b be chosen arbitrarily. At any profile in which every voter puts alternative b at the very top or very bottom of his ranking of alternatives, society must as well (even if half the voters put b at the top and half put b at the bottom). Proof. Suppose to the contrary that for such a profile and for distinct a, b, c, the social preference put a b and b c. By independence of irrelevant alternatives, this would continue to hold even if every individual moved c above a, because that could be arranged without disturbing any ab or cb votes (since b occupies an

Three brief proofs of Arrow s Impossibility Theorem 213 extreme position in each individual s ranking, as can be seen from the diagram). By transitivity the social ranking would then continue to put a c, but by unanimity it would also put c>a, a contradiction, proving the lemma. Next we argue that there is a voter n = n(b) who is extremely pivotal in the sense that by changing his vote at some profile he can move b from the very bottom of the social ranking to the very top. To see this, let each voter put b at the very bottom of his (otherwise arbitrary) ranking of alternatives. By unanimity, society must as well. Now let the individuals from voter 1 to N successively move b from the bottom of their rankings to the very top, leaving the other relative rankings in place. Let n be the first voter whose change causes the social ranking of b to change. (By unanimity, a change must occur at the latest when n = N.) Denote by profile I the list of all voter rankings just before n moves b, and denote by profile II the list of all voter rankings just after n moves b to the top. Since in profile II b has moved off the bottom of the social ranking, we deduce from our first argument that the social preference corresponding to profile II must put b at the very top. We argue third that n = n(b) is a dictator over any pair ac not involving b. To see this, choose one element, say a, from the pair ac. Construct profile III from profile II by letting n move a above b, so that a> n >b> n c, and by letting all the agents n n arbitrarily rearrange their relative rankings of a and c while leaving b in its extreme position. By independence of irrelevant alternatives, the social preferences corresponding to profile III would necessarily put a>b(since all individual ab votes are as in profile I where n put b at the bottom), and b>c (since all individual bc votes are as in profile II where n put b at the top). By transitivity, society must put a>c. By independence of irrelevant alternatives, the social preference over ac must agree with n whenever a> n c. We conclude by arguing that n is also a dictator over every pair ab. Takea third distinct alternative c to put at the bottom in the construction of paragraph 2. From the third argument, there must be a voter n(c) who is an αβ dictator for any pair αβ not involving c, such as ab. But agent n can affect society s ab ranking, namely at profiles I and II, hence this ab dictator n(c) must actually be n.

214 J. Geanakoplos Second Proof In a Condorcet profile each voter n N is assigned one of the Condorcet preferences (cyclial permutations of the alphabetical order) described below: C A C B C C A B C B C A. C. A If all n N are assigned to the first preference C A, then by unanimity, C A must be the social preference. Among Condorcet profiles π such that the social preference is C A, find π A that minimizes the number of voters with preferences C A. There must be at least one voter n in π A with preferences C A, for otherwise C would be unanimously preferred to A. We shall show that n is a local dictator at π A. Suppose alternative β immediately follows α alphabetically. Suppose at π A that n unilaterally switches to C β, giving the Condorcet profile π β. By IIA, we still have A> πβ > πβ α and β> πβ > πβ C. Hence, for the social order to change, we must get α πβ β. (Furthermore, if α = πβ β, then by transitivity and the fact #A 3, A> πβ C.) Suppose instead that n switches to C A, where A<B< <C, giving the non-condorcet profile π Ā. Take two alphabetically consecutive alternatives α, β. Then C β and C A agree on αβ (β >α) and on AC (C >A). Hence by IIA, α πā β since α πβ β. Since α, β are arbitrary, this gives A πā πā C. Furthermore, if α = πā β, then by IIA, α = πβ β, and from the last paragraph, this would imply that A> πβ C, and thus by IIA, A> πā C, contradicting A πā B πā πā C. We conclude that A< πā B< πā < πā C. Thus n is indeed a local dictator at π A. Let π be any nearly strict profile (where each individual preference has at most one pair of alternatives ranked equally) at which n is a local dictator. Change π to another nearly strict profile π by letting a single voter n n raise some alternative half a step higher in his ranking in such a way that either he breaks a single tie αβ or creates a single tie αβ (but not both). We shall show that n is also a local dictator at π. By IIA, this change by n cannot change the social ranking of any pair except possibly αβ. Modify π and π by letting n rank α> n γ> n β, for some third alternative γ. By hypothesis the social ranking at the modified π has α> π γ> π β. Hence by IIA, α> π γ and γ> π β, so by transitivity α> π β. Thus by IIA, the half-step move by n cannot change the power of n to enforce his strict preference over every pair at π. Since π A has no ties, for any pair αβ, a sequence of such half-moves can always be found to achieve arbitrary preferences for every voter n n over the given pair αβ. By IIA, n is a dictator. Third Proof Strict Neutrality Lemma. All binary social rankings are made the same way. Consider two pairs of alternatives ab and αβ. Suppose that in some profile π each voter strictly prefers a to b, orb to a, and suppose that in another profile π each B.

Three brief proofs of Arrow s Impossibility Theorem 215 voter has the same relative ranking of αβ as he does of ab in π. Then the social preference between ab in π is identical to the social preference between αβ in π and both social preferences are strict. Proof. Suppose WLOG that socially a b in π. Take c/ {a, b} and suppose first that αβ = ac or αβ = cb or αβ = cd with d / {a, b, c}. Create a new profile π with α just above a for each voter n (if α a), and β just below b for each voter n (if β b). Since all ab preferences are strict, this can be arranged while maintaining the same ab and αβ preferences, as the diagram makes clear. α α α b b a a a β β b b b α α β β β a a By unanimity, α> π a (if α a) and b> π β (if β b). By transitivity, α> π β. Reversing the roles of ab and αβ, we conclude by IIA that socially a> π b in the original profile. All that remains is to consider the situation where αβ = ba. This is handled by considering in turn profiles where the preferences are identical between the pairs (ab, ac), then (ac, bc), and then finally (bc, ba). This concludes the proof of the lemma. Next, take two distinct alternatives a and b and start with a profile in which b> n a for all n. Beginning with n =1, let each voter successively move a above b. By unanimity and the strict neutrality lemma, there will be a voter n who moves the social preference from b>ato a>bwhen he moves a up. Clearly n is pivotal. The situation is described below. 1 n N 1 n N aa ab b bb baa a aa bb b b bb aa a b a We now show that n is a dictator. Take an arbitrary pair of alternatives α, β and let n rank α> n β. Let the αβ rankings for n n be arbitrary. Take c/ {α, β} and put c above everything for 1 n<n, c below everything for n <n N, and α> n c> n β. By IIA, neutrality, and the pivotal profile discovered above, socially c>βand α>c, and so by transitivity, α>β. 1 n N c c α β α References β α αβ c β Arrow, K.J.: Social choice and individual values. New York: Wiley 1951 Barbera, S.: Pivotal voters. A new proof of Arrow s theorem. Economics Letters 6, 13 16 (1980) Geanakoplos, J.: Three brief proofs of Arrow s impossibility theorem. Cowles Foundation Discussion Paper 1123R (1996) May, K.: A set of independent, necessary, and sufficient conditions for simple majority decisions. Econometrica 20, 680 684 (1952) Ubeda, Luis: Neutrality in Arrow and other impossibility theorems. Economic Theory 23(1), 195 204 (2003) α c β c