The Econometric Society is collaborating with JSTOR to digitize, preserve and extend access to Econometrica.

Similar documents
The Review of Economic Studies, Ltd.

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at

The Econometric Society is collaborating with JSTOR to digitize, preserve and extend access to Econometrica.

The Periodogram and its Optical Analogy.

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

INFORMS is collaborating with JSTOR to digitize, preserve and extend access to Management Science.

Biometrika Trust. Biometrika Trust is collaborating with JSTOR to digitize, preserve and extend access to Biometrika.

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at

Mind Association. Oxford University Press and Mind Association are collaborating with JSTOR to digitize, preserve and extend access to Mind.

11] Index Number Which Shall Meet Certain of Fisher's Tests 397

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

The American Mathematical Monthly, Vol. 100, No. 8. (Oct., 1993), pp

Fair Divsion in Theory and Practice

The Axiomatic Method in Social Choice Theory:

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

E. DROR, W. G. DWYER AND D. M. KAN

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

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

arxiv: v2 [math.co] 14 Apr 2011

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at

Annals of Mathematics

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

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

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

1.1 GRAPHS AND LINEAR FUNCTIONS

Antonio Quesada Universidad de Murcia. Abstract

z-transforms 21.1 The z-transform Basics of z-transform Theory z-transforms and Difference Equations 36

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

Ecological Society of America is collaborating with JSTOR to digitize, preserve and extend access to Ecology.

Computational Tasks and Models

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at

Biometrika Trust. Biometrika Trust is collaborating with JSTOR to digitize, preserve and extend access to Biometrika.

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

MAXIMAL POSSIBILITY AND MINIMAL DICTATORIAL COVERS OF DOMAINS

A DISTANCE-BASED EXTENSION OF THE MAJORITY JUDGEMENT VOTING SYSTEM

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

GROUP DECISION MAKING

Strategy-Proofness on the Condorcet Domain

Social Choice. Jan-Michael van Linthoudt

Philosophy of Science Association

The College Mathematics Journal, Vol. 16, No. 2. (Mar., 1985), pp

Introduction to Vector Spaces

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at

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

Biometrika Trust. Biometrika Trust is collaborating with JSTOR to digitize, preserve and extend access to Biometrika.

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at

Vectors. January 13, 2013

Voting. José M Vidal. September 29, Abstract. The problems with voting.

International Biometric Society is collaborating with JSTOR to digitize, preserve and extend access to Biometrics.

Introducing Proof 1. hsn.uk.net. Contents

Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009

A technical appendix for multihoming and compatibility

The Integers. Math 3040: Spring Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers Multiplying integers 12

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

Every Choice Correspondence is Backwards-Induction Rationalizable

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at

Standard forms for writing numbers

CS632 Notes on Relational Query Languages I

Nontransitive Dice and Arrow s Theorem

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Lecture 17: Trees and Merge Sort 10:00 AM, Oct 15, 2018

CONNECTING PAIRWISE AND POSITIONAL ELECTION OUTCOMES

On Plott's pairwise symmetry condition for majority rule equilibrium*

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

Quasi-transitive and Suzumura consistent relations

Mathematical Association of America is collaborating with JSTOR to digitize, preserve and extend access to The American Mathematical Monthly.

Mathematical Association of America

This content downloaded from on Thu, 3 Oct :28:06 AM All use subject to JSTOR Terms and Conditions

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

The Integers. Peter J. Kahn

Repeated Downsian Electoral Competition

INFORMS is collaborating with JSTOR to digitize, preserve and extend access to Mathematics of Operations Research.

Arrow s Impossibility Theorem and Experimental Tests of Preference Aggregation

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

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

Social Choice and Mechanism Design - Part I.2. Part I.2: Social Choice Theory Summer Term 2011

Realization Plans for Extensive Form Games without Perfect Recall

Alternative Characterizations of Boston Mechanism

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

California Common Core State Standards for Mathematics Standards Map Mathematics I

Existence Theorems of Continuous Social Aggregation for Infinite Discrete Alternatives

Published: Social Choice and Welfare, 33(1), June 2009, pp doi: /s SEQUENTIAL ENTRY IN MANY-TO-ONE MATCHING MARKETS

Infinite constructions in set theory

Mathematical Association of America is collaborating with JSTOR to digitize, preserve and extend access to The American Mathematical Monthly.

CMU Social choice 2: Manipulation. Teacher: Ariel Procaccia

Hardy s Paradox. Chapter Introduction

The Beach Party Problem: An informal introduction to continuity problems in group choice *

TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS VII

Nash implementable domains for the Borda count

Transcription:

A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision Author(s): Kenneth O. May Source: Econometrica, Vol. 20, No. 4 (Oct., 1952), pp. 680-684 Published by: The Econometric Society Stable URL: http://www.jstor.org/stable/1907651. Accessed: 28/08/2011 15:34 Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at. http://www.jstor.org/page/info/about/policies/terms.jsp JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org. The Econometric Society is collaborating with JSTOR to digitize, preserve and extend access to Econometrica. http://www.jstor.org

A SET OF INDEPENDENT NECESSARY AND SUFFICIENT CONDITIONS FOR SIMPLE MAJORITY DECISION' BY KENNETH 0. MAY THE PROBLEM of the relation between group choice and individual preferences has been stated by Kenneth J. Arrow in terms of a "social welfare function" that gives group choice as a function of the preferences of the individuals making up the group.2 One of the conditions that he puts on this function is that group choice concerning a set of alternatives must depend only upon individual preferences concerning the alternatives in that set.' In particular, group choice in the presence of just two alternatives depends only upon individual preferences with respect to this pair of alternatives. Since it follows that the pattern of group choice may be built up if we know the group preference for each pair of alternatives, the problem reduces to the case of two alternatives. We shall be concerned with the method of choice by simple majority vote, in order both to elucidate the nature of this familiar institution and to throw further light on Arrow's interesting results. We assume n individuals and two alternatives x and y. Symbolizing "the ith individual prefers x to y" by xp y and "the ith individual is indifferent to x and y" by xliy, we assume that for each i one and only one of the following holds: ypix, yi x, or xpi y. With each individual we associate a variable Di that takes the values -1, 0, 1 respectively for each of these situations. Similarly, for the group, we write D = -1,O 1 according as ypx, ylx, or xpy, i.e., according as the group decision is in favor of y, indifference, or in favor of x. The function in which we are interested is of the form (1) D = f(d1, D2...X DO). It seems appropriate to call it a group decision function.4 It maps the n-fold cartesian product U X U X... X U onto U, where U = I-1, O, 1 }. We are going to make four very weak assumptions concem- 1 The author is indebted to K. J. Arrow, L. G. Field, D. Siplfe, and several referees for reading the draft of this paper and making helpful comments. 2 Kenneth J. Arrow, Social Choice and Individual Values, Cowles Commission Monograph No. 12, New York: John Wiley and Sons, 1951, p. 23. 3 See Arrow, p. 27. The realism of this condition may be questioned, but we introduce it here to provide the link between Arrow's work and the results of this paper. 4 This terminology seems appropriate since group decision functions, as here defined, and the familiar statistical decision functions are both members of the family of functions whose values are decisions. 5 The cartesian product U X U X... X U is the set of all different ordered n-tuples (Di, D2,.-, Dn) whose elements are members of U. Each member of the cartesian product represents a possible set of individual preferences. 680

SIMPLE MAJORITY DECISION 681 ing this function and show that they form a set of independent necessary and sufficient conditions that it be just the familiar method of making group decisions by simple majority. In order to define this method precisely, we let N(- 1), N(O), and N(1) stand respectively for the number of -l's, O's, and l's in the decision function. Then "simple majority decision" means a decision function that yields D = -1, 0, 1 according as N(1) - N(-1) is negative, zero, or positive. An equivalent definition is that D = -1, 0, 1 according as EA is negative, zero, or positive.! The first condition that we put on the group decision function is that each set of individual preferences leads to a defined and unique group choice. CONDITION I: The group decision function is defined and single valued for every element of U X U X... X U. We might describe this condition by saying that the method must be decisive and universally applicable, or more briefly always decisive, since it must specify a unique decision (even if this decision is to be indifferent) for any individual preferences. The second condition is that each individual be treated the same as far as his influence on the outcome is concerned. This means that in f(d1, D2, - --, Dn) we could interchange any two of the variables without changing the result. CONDITION II: The group decision function is a symmetric function of its arguments. This condition might well be termed anonymity, since it means that D is determined only by the values of the Di that appear, regardless of how they are assigned to individuals as indicated by subscripts (names). A more usual label is equality. The third condition is that the method of group decision does not favor either alternative.7 A precise way of stating this is that if the names of x and y are reversed, the result is not changed. If the names x and y are interchanged, preferences are indicated by different values of the D's. It is a matter of interchanging -1 and 1 wherever they occur as values of Di or D, since ypix, ylix, xpiy become with the new names, xpi y, xli y, and ypix. There is no change as far as 0 is concerned since the relation of indifference is assumed to be symmetric, i.e., yizx if and only if xiy. Thus if we have a statement about alternatives labeled in 6 Our "simple majority decision" is the same as Arrow's "method of majority decision." See Arrow, p. 46. The function is the same as the so-called "signum function of 2 Di. 7 There are many situations where this neutrality is not desirable. It goes without saying that our purpose here is to illuminate the formal characteristics of simple majority decision and not to assert any special value or universality for the stated conditions.

682 KENNETH 0. MAY one way, we get an equivalent statement by interchanging x with y and 1 with -1. But x and y do not appear in the decision function (1). Accordingly, if we have a true statement about this function, we must get another true statement from it by replacing each D by its negative. Another way of justifying this is by considering that we might have decided in the first place to assign the values -1 and 1 in the opposite way, and we do not want this to make any difference. Accordingly: CONDITION III: f(-d1, -D2, *. *,Dn) = - f(d1, D2,... * Dn) For obvious reasons the mathematical term "odd" does not seem convenient in this context, and we describe this property as neutrality. The final condition that we place on the decision function is that it respond to changes in individual preferences in a "positive" way. By this we mean that if the group decision is indifference or favorable to x, and if the individual preferences remain the same except that a single individual changes in a way favorable to x, then the group decision becomes favorable to x. More precisely: CONDITION IV: If D = f(d1, D2,,DO) = 0 or 1, and D' = Di for alli 0 io, and DO > Dio,thenD' =f(d',,d') = 1. We call this positive responsiveness. It is slightly stronger than Arrow's Condition 2.8 We now state our theorem. THEOREM: A group decision function is the method of simple majority decision if and only if it is always decisive, egalitarian, neutral, and positively responsive. It is easy to see that Conditions I-IV are necessary. Simple majority decision as defined always gives a unique result. Also II holds since the value of the decision function depends only upon N(-1) and N(1) and is therefore independent of the position of the - l's, O's, and l's in f. Thirdly, the definition of simple majority decision remains unchanged under an interchange of 1 and -1, so that III is valid. Finally, a change of one vote breaks a tie, so that IV holds. To show that Conditions I-IV are sufficient, we notice first that II implies that the value of f depends only upon the set of values of the variables and not upon their position in the function. Hence it depends only upon N(-1), N(O), and N(1). It is easy to see that (2) N(-1) = N(1) implies D = 0. For suppose that in this case D = f({di}) = 1. Then from Condition IIIf(D'}) = -1 whered' = -Di. Butf({D'}) = f({di}) because 8 See Arrow, p. 25. His condition might well be called positive monotonicity, since it requires merely nonnegative responsiveness.

SIMPLE MAJORITY DECISION 683 of the equality of N(-1) and N(1) and the fact that-o = 0. This violates the uniqueness required by Condition I. Similarly, D - 1, and the only other possibility is D = 0. Suppose now that N(1) = N(-1) + 1. Then by IV and (2), D = 1. By induction, using this result and IV, D = 1 for N(1) = N(-1) + m where 0 < m < n-n(-1). Hence (3) N(1) > N(-1) impliesd = 1. From this and Condition III (4) N(1) < N(-1) implies D = -1. Since (2)-(4) are just the definition of simple majority decision, the sufficiency is proved. Since we have exhibited a function satisfying Conditions I-IV, they must be consistent. To show independence, it is sufficient to exhibit functions that violate each one while satisfying all the others. We indicate such a function for each condition, leaving it to the reader to verify that each does satisfy all but the specified condition. (I). D = 1 for N(1) - N(-1) > O, D =-1 for N(1) - N(-1) < 0. (II). D = -1, 0, 1 according as Di + N(1) - N(-1) is less than, equal to, or greater than zero. (A kind of plural voting.) (III). D = -1, 0, 1 according as N(1) -2N(-1) is less than, equal to, or greater than zero. (The familiar two-thirds majority rule.) (IV). D = -1, 0, 1 according as N(1) - N(- 1) is greater than, equal to, or less than zero. (A more familiar example is the rule for jury decision in which D = -1, 1, or 0 according as N(-1) = n, N(1) = n, or otherwise.) Arrow's "Possibility Theorem for Two Alternatives" asserts that simple majority decision satisfies his Conditions 2-5 applied to two alternatives [Arrow, pp. 46-48]. It follows that our Conditions I-IV imply his Conditions 2-5. That his are actually weaker conditions may be seen by noting that the example above for which Condition III fails satisfies his Conditions 2-5.9 In Arrow's terms our theorem may be expressed by saying that any social welfare function (group decision function) that is not based on simple majority decision, i.e., does not decide between any pair of alternatives by majority vote, will either fail to give a definite result in some situation, favor one individual over another, favor one alternative over the other, or fail to respond positively to individual preferences. The fact that Arrow's conditions are still weaker emphasizes the importance of his result that his conditions are incompatible with transitivity [Arrow, p. 59]. 9 See Arrow, pp. 26-30. It is also evident that Arrow's Conditions 2-5 do not imply either Conditions II or IV.

684 KENNETH 0. MAY So far we have been concerned only with a single pair of alternatives. Suppose now we have a set of alternatives and that each individual when confronted with any pair either prefers one or the other or is indifferent. For each pair we can construct a decision function. According to the remark made at the beginning of this article, if we accept Arrow's Condition 3, we can build up a function that gives a set of group preferences corresponding to each set of individual preferences. It follows that any social welfare function that satisfies our Conditions I-IV and Arrow's Condition 3 must be constructed in this way. As is well-known, a social welfare function built in this way may lead to group preferences that are nontransitive even if the individual preferences are transitive [Arrow, pp. 2-3, 59]. Nontransitivity of group preferences follows a fortiori if the individual preferences are nontransitive. Accordingly any social welfare function satisfying Conditions I-IV for each pair of alternatives will lead to intransitivity unless the possible individual preferences are severely restricted. Carleton College