Málaga Economic Theory Research Center Working Papers

Similar documents
Ordered Value Restriction

Many-to-Many Matching Problem with Quotas

Cosine similarity and the Borda rule

A Fair Solution to the Compensation Problem

Arrovian Social Choice with Non -Welfare Attributes

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

Math Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65

Strategy-proof allocation of indivisible goods

Arrovian Social Choice with Non -Welfare Attributes

3.8 Three Types of Convergence

PREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.

List Scheduling and LPT Oliver Braun (09/05/2017)

Solutions of some selected problems of Homework 4

The Hilbert Schmidt version of the commutator theorem for zero trace matrices

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.

Málaga Economic Theory Research Center Working Papers

Sophisticated Preference Aggregation

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

Chapter 12: Social Choice Theory

On Certain C-Test Words for Free Groups

Pivots Versus Signals in Elections

On the Existence of Pure Nash Equilibria in Weighted Congestion Games

A Bernstein-Markov Theorem for Normed Spaces

Mean-Variance Utility

Polygonal Designs: Existence and Construction

Revealed Preference with Stochastic Demand Correspondence

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science

Unanimity, Pareto optimality and strategy-proofness on connected domains

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

Algebraic Montgomery-Yang problem: the log del Pezzo surface case

Immunity to credible deviations from the truth

On the Inapproximability of Vertex Cover on k-partite k-uniform Hypergraphs

Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization

Learnability and Stability in the General Learning Setting

Eliciting Socially Optimal Rankings from Unfair Jurors

Introduction to Optimization Techniques. Nonlinear Programming

Uncoupled automata and pure Nash equilibria

MULTIPLAYER ROCK-PAPER-SCISSORS

A proposal for a First-Citation-Speed-Index Link Peer-reviewed author version

Advanced Microeconomics

Positive Political Theory II David Austen-Smith & Je rey S. Banks

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes

Linguistic majorities with difference in support

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

Construction of an index by maximization of the sum of its absolute correlation coefficients with the constituent variables

Implementing the Wisdom of Waze

Voting by conformity

Metric Entropy of Convex Hulls

Handout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1.

arxiv: v1 [cs.ds] 3 Feb 2014

Časopis pro pěstování matematiky

A note on the multiplication of sparse matrices

A fair rule in minimum cost spanning tree problems 1

Non-Manipulable Domains for the Borda Count

Learning and Risk Aversion

Social Choice. Jan-Michael van Linthoudt

Closed-form evaluations of Fibonacci Lucas reciprocal sums with three factors

Equilibria on the Day-Ahead Electricity Market

NON-COMMUTATIVE GRÖBNER BASES FOR COMMUTATIVE ALGEBRAS

Intro to Economic analysis

Economic Core, Fair Allocations, and Social Choice Theory

ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS

ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE

THREE ESSAYS ON GAME THEORY. Demet Yilmazkuday. Dissertation. Submitted to the Faculty of the. Graduate School of Vanderbilt University

ECONOMICS SERIES SWP 2009/16. Weakest Collective Rationality and the Nash Bargaining Solution. Nejat Anbarci and Ching-jen Sun

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

1 Games in Normal Form (Strategic Form)

Curious Bounds for Floor Function Sums

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

Chapter 6 1-D Continuous Groups

Maximal Domains for Strategy-Proof or Maskin Monotonic Choice Rules Olivier Bochet y and Ton Storcken z

Econometrica Supplementary Material

Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms

time time δ jobs jobs

1 Introduction FUZZY VERSIONS OF SOME ARROW 0 S TYPE RESULTS 1. Louis Aimé Fono a,2, Véronique Kommogne b and Nicolas Gabriel Andjiga c

Volume 30, Issue 3. Monotone comparative statics with separable objective functions. Christian Ewerhart University of Zurich

Monochromatic images

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

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

4 = (0.02) 3 13, = 0.25 because = 25. Simi-

Maximality in the Farsighted Stable Set 1

Hybrid System Identification: An SDP Approach

Franz Dietrich, Christian List. The impossibility of unbiased judgment aggregation. RM/07/022 (RM/05/049 -revised-)

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 11 10/15/2008 ABSTRACT INTEGRATION I

ASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical

AP Physics C: Mechanics 2007 Scoring Guidelines

The isomorphism problem of Hausdorff measures and Hölder restrictions of functions

Approximation in Stochastic Scheduling: The Power of LP-Based Priority Policies

OBJECTIVES INTRODUCTION

Ranking completely uncertain decisions by the uniform expected utility criterion

A nonstandard cubic equation

NET Institute*

Worst-case performance of critical path type algorithms

Von Neumann-Morgenstern Farsightedly Stable Sets in Two-Sided Matching

Distributed Subgradient Methods for Multi-agent Optimization

arxiv: v1 [math.nt] 14 Sep 2014

Transcription:

Málaga Econoic Theory Research Center Working Papers Unequivocal Majority and Maskin-Monotonicity Pablo Aorós WP 2008-3 March 2008 Departaento de Teoría e Historia Econóica Facultad de Ciencias Econóicas y Epresariales Universidad de Málaga

Unequivocal Majority and Maskin-Monotonicity Pablo Aorós Departaento de Teoría e Historia Econóica Universidad de Málaga Capus El Ejido, E-29013, Málaga, Spain Tel. +34 95 213 1245, Fax: +34 95 213 1299 E-ail: pag@ua.es March 10, 2008 Abstract The unequivocal ajority of a social choice rule F is the iniu nuber of agents that ust agree on their best alternative in order to guarantee that this alternative is the only one prescribed by F. If the unequivocal ajority of F is larger than the iniu possible value, then soe of the alternatives prescribed by F are undesirable (there exists a di erent alternative which is the ost preferred by ore than 50% of the agents). Moreover, the larger the unequivocal ajority of F, the worse these alternatives are (since the proportion of agents that prefer the sae di erent alternative increases). We show that the sallest unequivocal ajority copatible with Maskin-onotonicity is n, where n 3 is the nuber of agents and 3 is the nuber of alternatives. This value represents no less than 66:^6% of the population. Key Words: Maskin-onotonicity; Majority; Condorcet winner. J.E.L. Classi cation Nubers: C70, D78. I thank Bernardo Moreno and Willia Thoson for their coents. Financial assistance fro MEC under project SEJ2005-04805 and Junta de Andalucía under project SEJ552 is gratefully acknowledged. The nal version of this paper was ade while the author was visiting CORE, to which he is grateful for its hospitality. 1

1 Introduction One of the central questions of the social choice theory concerns the design and ipleentation of collective decisions. Consider a society with n 3 agents and 3 alternatives. Suppose that the goals of the group of agents can be suarized in a social choice rule, i.e., a correspondence that prescribes the socially desirable alternatives as a function of the individual preference relations. The proble is then to design social choice rules that ful ll a variety of desirable properties. In this paper, we focus on the key necessary condition for Nash ipleentability of a social choice rule: Maskin-onotonicity. 1 This condition not only is one of the crucial concepts in ipleentation theory, but it is a desirable property in itself that can be justi ed fro a norative point of view: it argues that no alternative can be dropped fro being chosen unless for soe agent its desirability deteriorates. We are also interested in a property that is related with the ajority required to ensure that a given alternative is chosen. More precisely, we de ne the unequivocal ajority of a social choice rule F as the iniu nuber of agents that ust agree on their best alternative in order to guarantee that this alternative is the only one prescribed by F. The iniu possible unequivocal ajority is equal to n + 1. If the unequivocal ajority of a 2 social choice rule F is larger than this iniu value, then soe of the alternatives prescribed by F are such that there exists a di erent alternative which is the ost preferred by ore than 50% of the agents. Moreover, the larger the unequivocal ajority of F, the greater is this proportion of agents. 2 For this reason, we would like that a social choice rule has an unequivocal ajority as sall as possible. Our ain result shows that the sallest unequivocal ajority copatible with Maskin-onotonicity is n. This value is equal to the inial nuber required for a ajority that ensures the non-existence of cycles in pair-wise coparisons (see Greenberg, 1979). Since n > n + 1, an obvious iplication of our result is that 2 1 See, e.g., Maskin (1999) and Repullo (1987). 2 If the unequivocal ajority of a social choice rule F is n F, then there are soe situations in which an alternative a is the ost preferred one by n F 1 agents, but there is soe other alternative b which is aong the ones prescribed by F. If n F is larger than n 2 + 1, then n F 1 represents ore than 50% of the agents. 2

there is no Condorcet consistent social choice rule satisfying Maskin-onotonicity. 3 Sen (1995) proposed to evaluate the extent to which a social choice rule ay fail Maskin-onotonicity by identifying the inial way in which it has to be enlarged so as to satisfy this property. 4 Our result iplies that the inial onotonic extension of any Condorcet consistent social choice rule has an unequivocal ajority equal to n. 5 In other words, in soe situations in which a Condorcet winner exists, the set of alternatives that are considered eligible by any Maskin-onotonic social choice rule F ust be enlarged to include soe other alternatives. How bad these other alternatives need to be? Our result shows that soe of these alternatives ust be such that agents (i.e., no less than 66:^6% of the population) prefer the sae di erent alternative. This is the iniu price to pay for achieving Maskin-onotonicity. 6 The paper is organized as follows: Section 2 provides de nitions, Section 3 states the result, and Section 4 provides the conclusions. 2 De nitions Let N be a set of n 3 agents and let A be a set of 3 alternatives. Each agent i 2 N has a (strict) preference relation, P i, de ned over the set of alternatives. Let P be the class of all possible (strict) preference relations on A. An adissible pro le of preference relations is denoted by P = (P i ) i2n 2 P n. Let 2 A denote the set of all subsets of A. A social choice rule (SCR) is a correspondence F : P n! 2 A nf;g, which associates each possible pro le of preference relations P a non-epty subset of alternatives F (P ) A. A SCR F is e cient if it always selects Pareto-e cient alternatives, i.e., for all P 2 P n and a 2 F (P ), there is no b 2 A such that bp i a for all i 2 N. The SCR F is unanious if it only chooses the unaniously best alternative whenever it exists, i.e., for all P 2 P n and a 2 A such that ap i b 3 A Condorcet winner is an alternative that is not defeated by any other alternative in pairwise coparisons. A social choice rule is Condorcet consitent if it only selects the Condorcet-winner whenever it exists. 4 See also Thoson (1999) and Erde and Sanver (2005). 5 In general, the inial onotonic extension of any social choice rule has an unequivocal ajority equal or grater than n. 6 That is, any Maskin-onotonic social choice rule ust soeties select alternatives that would not be Pareto-e cient in a reduced setting with n 1 agents. 3

for all b 2 Anfag and i 2 N, F (P ) = fag. Note that unaniity is a weaker requireent than e ciency. An agent i 2 N is a dictator for the SCR F if, for all pro le of preference relations P 2 P n, there is soe a 2 F (P ) which is the ost preferred alternative for i at P. A SCR that adits a dictator is called dictatorial. 7 A SCR F is supposed to represent the objectives of a social planner. In any situations the planner cannot achieve directly the outcoes recoended by F. To obtain the alternatives prescribed by F in a decentralized way, the planner ust design a echanis which ipleents it. Fro Maskin (1999) we know that Maskin-onotonicity is a necessary condition for the Nash ipleentability of a SCR. De nitio A SCR F satis es Maskin-onotonicity when, for all P; ^P 2 P n and a 2 F (P ), if a =2 F ( ^P ) then there exist soe i 2 N and b 2 A such that ap i b and b ^P i a. Roughly speaking, this condition says that if an alternative a is selected by F for soe pro le of preference relations P, then a ust be also selected for any other pro le of preference relations ^P where no alternative has risen in any agent s preference ranking with respect to a. Maskin-onotonicity not only is one of the key concepts in ipleentation theory, but it is a desirable property in itself. A social choice function (SCF), f : P n! A, is a SCR that assigns a single alternative f(p ) 2 A to every pro le of preference relations P 2 P n. A result parallel to Arrow s ipossibility theore states that any e cient SCF that satis es Maskin-onotonicity is dictatorial. 8 Fortunately, this negative result can be avoided if we consider correspondences instead of functions. Consider, for exaple, the SCR F ~ that for each pro le of preference functions selects all the alternatives a 2 A such that: (1) a is the best alternative for one agent at least and, (2) a is not the worst alternative for () agents. It is easy to show that this SCR is e cient, Maskin-onotonic and non-dictatorial. 7 This notion is usually de ned for single-valued SCRs. Nevertheless, it ay also ake sense for a ultivalued SCR F, since any of the alternatives prescribed by F is considered socially optial (in particular, if F is dictatorial, it allows for the possibility of always choosing the ost preferred alternative for the dictator). 8 If all possible preference relations (not necessarily strict) are adissible, then the negative result is even stronger: in this case any e cient SCR does not satisfy Maskinonotonicity (see Appendix). This incopatibility vanishes if we consider weak-e ciency instead of e ciency. 4

Given a pro le of preference relations P 2 P n and an alternative a 2 A, let n P a n be the nuber of agents for who a is the ost preferred alternative: n P a = # fi 2 N : ap i b, 8b 2 Anfagg (1) De nition 2 The unequivocal ajority of a SCR F, n F, is the iniu nuber of agents that ust agree on their ost preferred alternative in order to guarantee that F will select that (and only that) alternative, i.e.: n F = in n s:t: n 2 @ F where @ F = f^n n : 8P 2 P n ; 8a 2 A;if n P a ^n then F (P ) = fagg. Note that a SCR F has an unequivocal ajority if and only if it is unanious (i.e., @ F 6= ; if and only if F is unanious). 3 Results For all x 2 R, let bxc denote the largest integer saller or equal than x. Clearly, the unequivocal ajority of a SCR (whenever it exists) is always greater or equal than n + 1 and saller or equal than n. The question 2 that we want to answer in this section is: which is the sallest unequivocal ajority copatible with Maskin-onotonicity? Our rst result establishes a necessary condition for a Maskin-onotonic SCR F having a given unequivocal ajority. Roughly speaking, this condition says that, if F is Maskin-onotonic and has an unequivocal ajority saller or equal than k, then any alternative selected by F should be Paretoe cient in any reduced setting with k agents. Lea 1 Let F be a SCR satisfying Maskin-onotonicity and with an unequivocal ajority saller or equal than k. Then, for all P 2 P n and a 2 F (P ), there is no alternative b 2 A which is preferred to a by k agents. Proof. Let F be a SCR satisfying Maskin-onotonicity and such that n F k n. Suppose by contradiction that there exist P 2 P n, a 2 F (P ) and b 2 A such that b is preferred to a by k agents. In particular, suppose without loss of generality that bp i a for all i 2 f1; :::; kg. Let ^P 2 P n be such that: 5

(1) for all i 2 f1; :::; kg and c 2 Anfbg, b ^P i c, (2) for all i 2 f1; :::; kg and c 2 A such that ap i c, a ^P i c, and (3) for all i 2 fk + 1; :::; ng, ^P i = P i. Since n F k, fro (1) we have F ( ^P ) = fbg. On the other hand, fro (2) and (3), there is no j 2 N and c 2 A such that ap j c and c ^P j a. Then, by Maskin-onotonicity, we have a 2 F ( ^P ), which is a contradiction. The next result de nes a lower bound for the unequivocal ajority of any Maskin-onotonic SCR. This lower bound depends on the nuber of agents and the nuber of alternatives. Lea 2 Let F be a SCR with an unequivocal ajority equal to n F. If F satis es Maskin-onotonicity then n F n. Proof. Suppose by contradiction that there exists a SCR F that satis es Maskin-onotonicity and such that n F n 1. Suppose rst that n (note that in this case = 0). For all P 2 P n, i 2 N, and a 2 A, let 1 p P i a denote the position of alternative a in the ranking of alternatives generated by P i (i.e., p P i a = 1 if a is the ost preferred alternative for agent i, p P i a = 2 if a is the second ost preferred alternative for agent i, and so on). Let P 2 P n be a pro le of preference relations such that: (1) p P 1 a = 1, p P 2 a = 2,..., p Pn a = n, (2) p P 1 b = n and, for all i 2 Nnf1g, p P i b = p P i a + 1, (3) p P 2 c = n and, for all i 2 Nnf2g, p P i c = p P i b + 1, and so on. Table I shows as an exaple the case in which n = 4. Agent 1 Agent 2 Agent 3 Agent 4 a b c d d a b c c d a b b c d a.. Table I The pro le of preference relations P de ned above is such that, for all a 2 A, there is soe b 2 A which is strictly preferred to a by agents. Then, fro Lea 1, we have F (P ) = ;, which is a contradiction. 6..

Suppose now that < n. Let P 2 P n be a pro le of preference relations de ned as follows. The preference relations of agents 1,..., are such that: (1) p P 1 a = 1, p P 2 a = 2,..., p P a =, (2) p P 1 b = and p P i b = p P i a + 1 for all i 2 f1; :::; gnf1g, (3) p P 2 c = and p P i c = p P i b + 1 for all i 2 f1; :::; gnf2g, and so on. The preference relation of any agent i 2 f+1; :::; ng is the sae that the preference relation of agent i (i.e., P i = P i for all i 2 f + 1; :::; ng). Table II shows as an exaple the case in which = 4 and n = 7. Agent 1 Agent 2 Agent 3 Agent 4 Agent 5 Agent 6 Agent 7 a b c d a b c d a b c d a b c d a b c d a b c d a b c d Table II Note that the pro le of preference relations P de ned above is such that, for all a 2 A, there is soe b 2 A which is strictly preferred to a by ( 1) n + axf0; n n 1g = n 1 agents. Then, fro Lea 1, we have F (P ) = ;, which is a contradiction. Now, we can state the ain result of the paper: Theore 1 The sallest unequivocal ajority which is copatible with Maskinonotonicity is n = n. 9 Proof. Fro Lea 2 we know that any Maskin-onotonic SCR F is such that n F n. Next we show that there is soe SCR F satisfying Maskin-onotonicity and such that n F = n. Let F be a SCR such that, for all P 2 P n : F (P ) = fa 2 A : @b 2 A that is preferred to a by n agents at P g 9 Of course, the fact that a SCR has an unequivocal ajority equal to n does not iply that it satis es Maskin-onotonicity. For exaple, Baharad and Nitzan (2003) showed that the unequivocal ajority of the Borda rule is n (and it is well-known that this SCR does not satisfy Maskin-onotonicity). 7

Next we show that it is well-de ned, satis es Maskin-onotonicity and n F = n. Step 1. F (P ) 6= ; for all P 2 P n. To see this note that for all P 2 P n there is soe a 2 A which is the ost preferred alternative for at least + 1 agents (and therefore a 2 F (P )). Step 2. F satis es Maskin-onotonicity. Let P, ^P 2 P n and a 2 A be such that a 2 F (P ) and a =2 F ( ^P ). Since a =2 F ( ^P ), there exists b 2 A which is preferred to a for at least n agents at ^P. However, since a 2 F (P ), b is not preferred to a for n agents at P. Therefore, since n < 2(n ), there exist soe i 2 N for who api b and b ^P i a. Step 3. n F = n. Let P 2 P n be such that there is soe a 2 A which is the ost preferred alternative for at least n agents. Since n < n 2, we have F (P ) = fag, and therefore n F n. Moreover, fro Lea 2 we have n F >. It is easy to see that the SCR F de ned in the proof of Theore 1 not only is Maskin-onotonic and has the sallest unequivocal ajority copatible with this condition, but it also is e cient and, when < n, non-dictatorial. 10 Reark 1 Note that n 3 n n b n. Hence, since Li 3 c = 2, n!1 n 3 if F is a Maskin-onotonic SCR, the iniu percentage of agents that ust agree on their best alternative in order to guarantee that F will choose only that alternative is always greater than 66:^6%. This iplies that soe of the alternatives selected by F are such that there exists a di erent alternative which is preferred by a wide ajority of agents (no less than 66:^6%). This undesirable property is the price to pay for achieving Maskin-onotonicity. Corollary 1 Any Maskin-onotonic SCR F is such that, for soe P 2 P n and a 2 F (P ), there is another alternative that is preferred to a by at least agents (i.e., no less than 66:^6% of the population). 10 If n, F selects all Pareto-e cient allocations, and therefore all agents are dictators. Nevertheless, in this case there exist soe other Maskin-onotonic, e cient and non-dictatorial SCRs that have an unequivocal ajority equal to n, like the SCR ~ F de- ned in the previous section. Note also that any Maskin-onotonic SCR F that has an unequivocal ajority equal to n is such that F F. 8

Reark 2 Let k 2 f n + 1 ; :::; ng. We say that an alternative a 2 A is a 2 k-condorcet winner at P 2 P n if there is no other alternative in A that is preferred to a by at least k agents. A SCR is k-condorcet consistent if it only chooses k-condorcet winners whenever they exist. Greenberg (1979) showed that a necessary and su cient condition that for every pro le of preference relations there exists a k-condorcet winner is that k n (see also Weber, 1993). 11 Hence, the inial nuber required for a ajority that ensures the non-existence of cycles in pair-wise coparisons is equal to the inial unequivocal ajority which is copatible with Maskin-onotonicity. The following result is an iediate corollary of Theore 1. Corollary 2 A SCR satisfying Maskin-onotonicity and k-condorcet consistency exists if and only if k n. 12 4 Conclusion The unequivocal ajority of a social choice rule F is the iniu nuber of agents that ust agree on their ost preferred alternative in order to guarantee that this alternative is chosen. The larger unequivocal ajority of F, the ore undesirable are soe of the alternatives prescribed by F. We have shown that the sallest unequivocal ajority copatible with Maskinonotonicity is n. This value represents no less than 66:^6% of the population. We have proposed a social choice rule that not only is Maskinonotonic and has the sallest unequivocal ajority, but it is also e cient and non-dictatorial. 11 Note that this result (together with Lea 1) could be used to provide an alternative proof of Lea 2 12 When k = n 2 + 1, a k-condorcet consistent SCR is siply called Condorcet consistent. Hence, this result iplies that there is no Condorcet consistent SCR satisfying Maskin-onotonicity. 9

Appendix We show that if all possible preference relations (not necessarily strict) are adissible, then there is an incopatibility between e ciency and Maskinonotonicity. Propositio Let < be the doain of all possible preference relations (not necessarily strict) on A. There is no e cient SCR F : < n! 2 A nf;g satisfying Maskin-onotonicity. Proof. Suppose by contradiction that there exists soe SCR F : < n! 2 A nf;g which is e cient and satis es Maskin-onotonicity. Let R 2 < n be such that there are a; b; c 2 A satisfying: (1) for all i 2 N and all d 2 Anfa; b; cg, ap i d, bp i d and cp i d (i.e., a, b and c are the three ost preferred alternatives for all agents), (2) ap 1 bp 1 c, bp 2 ap 2 c and cp 3 ai 3 b (where I i denotes the indi erence relation) and (3) for all i 2 Nnf1; 2; 3g, ai i bi i c. Step 1. a =2 F (R). Suppose on the contrary that a 2 F (R). Let ^R 2 < n be such that a^i 1 b ^P 1 c ^P 1 d for all d 2 Anfa; b; cg, while ^R i = R i for all i 2 Nnf1g). By Maskin-onotonicity we have a 2 F ( ^R). However, a is not Pareto-e cient at ^R, which is a contradiction. Step 2. b =2 F (R). Suppose on the contrary that b 2 F (R). Let ~ R 2 < n be such that a^i 2 b ~ P 2 c ~ P 2 d for all d 2 Anfa; b; cg, while ~ R i = R i for all i 2 Nnf2g). By Maskin-onotonicity we have b 2 F ( ~ R). However, b is not Pareto-e cient at ~ R, which is a contradiction. Step 3. c =2 F (R). Suppose on the contrary that c 2 F (R). Let R 2 < n be such that a I 3 bi 3 c P 3 d for all d 2 Anfa; b; cg, while R i = R i for all i 2 Nnf2g). By Maskin-onotonicity we have c 2 F ( R). However, c is not Pareto-e cient at R, which is a contradiction. Fro Steps 1-3 and the fact that any d 2 Anfa; b; cg is not Pareto-e cient at R we have F (R) = ;, which is a contradiction. 10

References [1] Baharad, E., Nitzan, S.: The Borda rule, Condorcet consistency and Condorcet stability, Econoic Theory 22, 685-688 (2003) [2] Erde, O. and Sanver M. R.: Minial onotonic extensions of scoring rules, Social Choice and Welfare 25, 31-42 (2005) [3] Greenberg, J.: Consistent ajority rules over copact sets of alternatives. Econoetrica 47, 627-636 (1979) [4] Maskin, E.: Nash equilibriu and welfare optiality, Review of Econoic Studies 66, 23-38 (1999) [5] Repullo, R.: A siple proof of Maskin theore on Nash ipleentation, Social Choice and Welfare 4, 39-41 (1987) [6] Sen, A.: The ipleentation of social choice functions via social choice correspondences: A general forulation and a liit result. Social Choice and Welfare 12, 277-292 (1995). [7] Thoson, W.: Monotonic extensions on econoic doains, Review of Econoic Design 4, 13-33 (1999) [8] Weber, J. S.: An eleentary proof of the conditions for a generalized Condorcet paradox, Public Choice 77, 415-419 (1993) 11