Existence of a multicameral core

When a single group uses majority rule to select a set of policies from an n-dimensional compact and convex set, a core generally exists if and only if n = 1. Finding analogous conditions for core existence when an n-dimensional action requires agreement from m groups has been an open problem. This paper provides a solution to this problem by establishing sufficient conditions for core existence and characterizing the location and dimensionality of the core for settings in which voters have Euclidean preferences. The conditions establish that a core may exist in any number of dimensions whenever n ≤ m as long as there is sufficient preference homogeneity within groups and heterogeneity between groups. With m > 1 the core is however generically empty for . These results provide a generalization of the median voter theorem and of non-existence results for contexts of concern to students of multiparty negotiation, comparative politics and international relations.     

The C1 topology on the space of smooth preference profiles

This paper defines a fine C ¹-topology for smooth preferences on a “policy space”, W, and shows that the set of convex preference profiles contains open sets in this topology.  It follows that if the dimension(W)≤v(?)−2 (where v(?) is the Nakamura number of the voting rule, ?), then the core of ? cannot be generically empty. For higher dimensions, an “extension” of the voting core, called the heart of ?, is proposed. The heart is a generalization of the “uncovered set”. It is shown to be non-empty and closed in general. On the C ¹-space of convex preference profiles, the heart is Paretian. Moreover, the heart correspondence is lower hemi-continuous and admits a continuous selection. Thus the heart converges to the core when the latter exists. Using this, an aggregator, compatible with ?, can be defined and shown to be continuous on the C ¹-space of smooth convex preference profiles. Received: 3 April 1995/Accepted: 8 April 1998     

A characterization of strategy-proof social choice functions for economies with pure public goods

We characterize strategy-proof social choice functions when individuals have strictly quasi-concave, continuous and satiated utility functions on convex subsets of IR ^m , representing preferences for the provision of m pure public goods. When specialized to the case m=1, these assumptions amount to requiring that preferences are single peaked, and for such a domain there exists a wide class of strategy-proof social choice functions. These were studied by Moulin (1980) under strong additional assumptions. Our first results characterize the complete class, after an appropriate extension of the single-peakedness condition. The new characterization retains the flavour of Moulin's elegant representation theorem. For the general m-dimensional case, previous results have shown that there is no efficient, strategy-proof, nondictatorial social choice function, even within the domain restrictions under consideration (Border and Jordan 1983; Zhou 1991). In fact, Zhou's powerful result indicates that nondictatorial strategy-proof s.c.f.'s will have a range of dimension one. This allows us to conclude with a complete characterization of all strategy-proof s.c.f.'s on IR ^m , because restrictions of preferences from our admissible class to one dimensional subsets satisfy the slightly generalized notion of single-peakedness that is used in our characterization for the case m=1. We feel that a complete knowledge of the class of strategy-proof mechanisms, in this as well as in other contexts, is an important step in the analysis of the trade-offs between strategy-proofness and other performance criteria, like efficiency.This paper was written while both authors were visiting GREMAQ, Université des Sciences Sociales de Toulouse. We are thankful for its hospitality and good research atmosphere. Barberà's work is supported by the Instituto de Estudios Fiscales and by research grant PB89-0294 from the Secretaría de Estado de Universidades e Investigación, Spain. Jackson acknowledges the support of NSF grant SES8921409. We thank Jacques Crémer, Beth Allen, John Weymark and two anonymous referees for helpful comments on earlier drafts.     

A characterization of the uniform rule with several commodities and agents

We consider a problem of allocating infinitely divisible commodities among a group of agents. More specifically, there are several commodities to be allocated and agents have continuous, strictly convex, and separable preferences. We establish that a rule satisfies strategy-proofness, unanimity, weak symmetry, and nonbossiness if and only if it is the uniform rule. This result extends to the class of continuous, strictly convex, and multidimensional single-peaked preferences.     

On the robustness of the impossibility result in the topological approach to social choice

In the first part we make an assessment of the impossibility result, due to Chichilnisky, in the topological approach to social choice theory. We observe that this result depends essentially on the choice of the topology for the set of preferences. In the second part, we present two positive results, obtained using the global approach. The first one deals with the space of continuous and strictly convex preferences, a space which, in the local approach, would produce an impossibility result. The second result deals with a class of preferences which is dense in the space of all continuous preferences. Thus, an approximate solution of the Chichilnisky problem has been obtained on this space.     

Approval Voting on Dichotomous Preferences

The aim of this paper is to find normative foundations of Approval Voting when individuals have dichotomous preferences. We show that a social choice function is anonymous, neutral, strategy-proof and strictly monotone if and only if it is Approval Voting and interpret this result as an extension of May’s theorem (Econometrica 20:680–684, 1952). Then, we show that Approval Voting is the only strictly symmetric, neutral and efficient social choice function. This result is related to a characterization of Baigent and Xu (Math Soc Sci 21:21–29, 1991).     

Social choice and the closed convergence topology

This paper revisits the aggregation theorem of Chichilnisky (1980), replacing the original smooth topology by the closed convergence topology and responding to several comments (N. Baigent (1984, 1985, 1987, 1989), N. Baigent and P. Huang (1990) and M. LeBreton and J. Uriarte (1990a, b). Theorems 1 and 2 establish the contractibility of three spaces of preferences: the space of strictly quasiconcave preferences P _SCO, its subspace of smooth preferences P _infSCO ^supS , and a space P ₁ of smooth (not necessarily convex) preferences with a unique interior critical point (a maximum). The results are proven using both the closed convergence topology and the smooth topology. Because of their contractibility, these spaces satisfy the necessary and sufficient conditions of Chichilnisky and Heal (1983) for aggregation rules satisfying my axioms, which are valid in all topologies. Theorem 4 constructs a family of aggregation rules satisfying my axioms for these three spaces. What these spaces have in common is a unique maximum (or peak). This rather special property makes them contractible, and thus amenable to aggregation. However, these aggregation rules cannot be extended to the whole space of preferences P which is not contractible and therefore does not admit continuous aggregation rules satisfying anonymity and unanimity, Chichilnisky (1980, 1982). The results presented here clarify an erroneous example in LeBreton and Uriarte (1990a, b) and respond to Baigent (1984, 1985, 1987) and Baigent and Huang (1990) on the relative advantages of continuous and discrete approaches to Social Choice.Comments from Geoffrey M. Heal, Andreu Mas Colell, Jean Francois Mertens and Maurice Salles are gratefully acknowledged. Research support was provided by NSF SES 8409857.     

Equal factor equivalence in economies with multiple public goods

We reconsider the problem of provision and cost-sharing of multiple public goods. The efficient equal factor equivalent allocation rule makes every agent indifferent between what he receives and the opportunity of choosing the bundle of public goods subject to the constraint of paying r times its cost, where r is set as low as possible. We show that this rule is characterized in economies with a continuum of agents by efficiency, a natural upper bound on everyone's welfare, and a property of solidarity with respect to changes in population and preferences. Received: 3 August 1995 / Accepted : 29 April 1997     

Aggregation of smooth preferences

Suppose p is a smooth preference profile (for a society, N) belonging to a domain P ^N . Let σ be a voting rule, and σ(p)(x) be the set of alternatives in the space, W, which is preferred to x. The equilibrium E(σ(p)) is the set {x∈W:σ(p)(x) is empty}. A sufficient condition for existence of E(σ(p)) when p is convex is that a “dual”, or generalized gradient, dσ(p)(x), is non-empty at all x. Under certain conditions the dual “field”, dσ(p), admits a “social gradient field”Γ(p). Γ is called an “aggregator” on the domain P ^N if Γ is continuous for all p in P ^N . It is shown here that the “minmax” voting rule, σ, admits an aggregator when P ^N is the set of smooth, convex preference profiles (on a compact, convex topological vector space, W) and P ^N is endowed with a C ¹-topology. An aggregator can also be constructed on a domain of smooth, non-convex preferences when W is the compact interval. The construction of an aggregator for a general political economy is also discussed. Some remarks are addressed to the relationship between these results and the Chichilnisky-Heal theorem on the non-existence of a preference aggregator when P ^N is not contractible. Received: 4 July 1995 / Accepted: 26 August 1996     

A robust theory of resource allocation

The theory of social choice introduced in [5, 6] is robust: it is completely independent of the choice of topology on spaces of preferences. This theory has been fruitful in linking diverse forms of resource allocation: it has been shown [17] that contractibility is necessary and sufficient for solving the social choice paradox; this condition is equivalent [11] to another — limited arbitrage — which is necessary and sufficient for the existence of a competitive equilibrium and the core of an economy [13, 14, 15, 16, 17]. The space of monotone preferences is contractible; as shown already in [6, 17] such spaces admit social choice rules. However, monotone preferences are of little interest in social choice theory because the essence of the social choice problem, such as Condorcet triples, rules out monotonicity.The author is Director, Program on Information and Resources, and Professor of Economics, Columbia University. 1994-5 Salinbemi Professor, University of Siena, Italy. Research support from NSF grants Nos. 92 16928 and from the Leif Johansen Award at the University of Oslo, Norway, are gratefully acknowledged.     

Strategy-proofness versus efficiency on restricted domains of exchange economies

 Strategy-proofness has been shown to be a strong property, particularly on large domains of preferences. We therefore examine the existence of strategy-proof and efficient solutions on restricted, 2-person domains of exchange economies. On the class of 2-person exchange economies in which agents have homothetic, strictly convex preferences we show, as Zhou (1991) did for a larger domain, that such a solution is necessarily dictatorial. As this proof requires preferences exhibiting high degrees of complementarity, our search continues to a class of linear preferences. Even on this “small” domain, the same negative result holds. These two results are extended to many superdomains, including Zhou’s. Received: 9 June 1995/Accepted: 8 January 1996     

Non-collegial simple games and the nowhere denseness of the set of preference profiles having a core

In recent papers, somewhat conflicting results on the generic emptiness of the core have been proven. Rubinstein (1979) has shown that the core is generically empty in the Kannai topology even without a restriction on the dimensionality of the alternative space. Schofield (1980) finds the core generically empty in the Whitney-C topology, but requires a dimensionality condition. This note explores the apparent conflict by proving a generalization of Rubinstein's result for the Whitney-C ⁰ topology, and showing that the result does not extend to the Whitney-C ¹ topology without a dimensionality condition.I would like to thank Kim Border and Richard McKelvey for their helpful discussion and comments. This research was supported in part by the National Science Foundation under Grant no. SES 78-2478781     

Ranking opportunity sets on the basis of their freedom of choice and their ability to satisfy preferences: A difficulty

This paper examines a possibility of enlarging the domain of definition of individual preferences suggested by the recent literature on freedom of choice. More specifically, the possibility for an individual to have preferences that depend upon both the opportunity set that she faces and the particular alternative that she chooses from that set is considered. Even more specifically, the possibility for these preferences to value freedom of choice, as defined by the set theoretic relation of inclusion, while being consistent, in a certain sense, with the existence of a preference ordering over the options contained in opportunity sets is investigated. It is shown in the paper that a necessary condition for the existence of any transitive extended preferences of this type is for freedom of choice to be given no intrinsic importance. Received: 22 November 1995 / Accepted: 11 January 1997     

Strategy-proof allocation of multiple public goods

This paper characterizes strategy-proof social choice functions (SCFs), the outcome of which are multiple public goods. Feasible alternatives belong to subsets of a product set . The SCFs are not necessarily “onto”, but the weaker requirement, that every element in each category of public goods A _k is attained at some preference profile, is imposed instead. Admissible preferences are arbitrary rankings of the goods in the various categories, while a separability restriction concerning preferences among the various categories is assumed. It is found that the range of the SCF is uniquely decomposed into a product set in general coarser than the original product set, and that the SCF must be dictatorial on each component B _l . If the range cannot be decomposed, a form of the Gibbard–Satterthwaite theorem with a restricted preference domain is obtained.     

A maximal domain of preferences for strategy-proof,efficient, and simple rules in the division problem

The division problem consists of allocating an amount M of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform rule is the unique strategy-proof, efficient, and anonymous rule. Ching and Serizawa (1998) extended this result by showing that the set of single-plateaued preferences is the largest domain, for all possible values of M, admitting a rule (the extended uniform rule) satisfying strategy-proofness, efficiency and symmetry. We identify, for each M and n, a maximal domain of preferences under which the extended uniform rule also satisfies the properties of strategy-proofness, efficiency, tops-onlyness, and continuity. These domains (called partially single-plateaued) are strictly larger than the set of single-plateaued preferences. However, their intersection, when M varies from zero to infinity, coincides with the set of single-plateaued preferences.An earlier version of this paper circulated under the title A maximal domain of preferences for tops-only rules in the division problem. We are grateful to an associate editor of this journal for comments that helped to improve the presentation of the paper and to Matt Jackson for suggesting us the interest of identifying a maximal domain of preferences for tops-only rules. We are also grateful to Dolors Berga, Flip Klijn, Howard Petith, and a referee for helpful comments. The work of Alejandro Neme is partially supported by Research Grant 319502 from the Universidad Nacional de San Luis. The work of Jordi Massó is partially supported by Research Grants BEC2002-02130 from the Spanish Ministerio de Ciencia y Tecnología and 2001SGR-00162 from the Generalitat de Catalunya, and by the Barcelona Economics Program of CREA from the Generalitat de Catalunya. The paper was partially written while Alejandro Neme was visiting the UAB unde r a sabbatical fellowship from the Generalitat de Catalunya.     

Acyclic sets of linear orders

 A set of linear orders on {1,2, ℕ, n} is acyclic if no three of its orders have an embedded permutation 3-cycle {abc, cab, bca}. Let f (n) be the maximum cardinality of an acyclic set of linear orders on {1,2, ℕ, n}. The problem of determining f (n) has interested social choice theorists for many years because it is the greatest number of linear orders on a set of n alternatives that guarantees transitivity of majority preferences when every voter in an arbitrary finite set has any one of those orders as his or her preference order. This paper gives improved lower and upper bounds for f (n). We note that f (5)=20 and that all maximum acyclic sets at n=4, 5 are generated by an “alternating scheme.” This procedure becomes suboptimal at least by n=16, where a “replacement scheme” overtakes it. The presently-best large-n lower bound is approximately f (n)≥(2.1708) ⁿ . Received: 5 April 1995/Accepted: 10 November 1995     

The geometry of implementation: a necessary and sufficient condition for straightforward games

 We characterize games which induce truthful revelation of the players’ preferences, either as dominant strategies (straightforward games) or in Nash equilibria. Strategies are statements of individual preferences on R ⁿ . Outcomes are social preferences. Preferences over outcomes are defined by a distance from a bliss point. We prove that g is straightforward if and only if g is locally constant or dictatorial (LCD), i.e., coordinate-wise either a constant or a projection map locally for almost all strategy profiles. We also establish that: (i) If a game is straightforward and respects unanimity, then the map g must be continuous, (ii) Straightforwardness is a nowhere dense property, (iii) There exist differentiable straightforward games which are non-dictatorial. (iv) If a social choice rule is Nash implementable, then it is straightforward and locally constant or dictatorial. Received: 30 December 1994/Accepted: 22 April 1996     

On probabilistic rationalizability

This paper examines the problem of rationalizability of a choice system without imposing restrictions on the universal set of alternatives and the family of feasible sets. A choice system is the probabilistic counterpart of a choice function which is basic to much of the theory of individual choice behaviour in economics. We provide a necessary and sufficient condition for a choice system to be induced by a probability measure on a set of utility functions. I would like to thank the editor and two anonymous referees for helpful comments.     

Ranking opportunity sets in the space of functionings

We develop a ranking of compact, convex and comprehensive opportunity sets defined in the evaluative space of individual functionings. We suppose the existence of a target, that is a multi-dimensional bliss point in terms of functionings. This leads us to define concepts such as essentiality and freedomin a novel way. As a main result, we give an axiomatic characterization of the ranking obtained by minimizing the Euclidean distance between each opportunity set and the target.     

Choice rules with fuzzy preferences: Some characterizations

Consider an agent with fuzzy preferences. This agent, however, has to make exact choices when faced with different feasible sets of alternatives. What rule does he follow in making such choices? This paper provides an axiomatic characterization of a class of binary choice rules called the α satisfying rule. When α=1, this rule is the Orlovsky choice rule. On the other hand, for α≤1/2, the rule coincides with the M _α rule that has been extensively analyzed in the literature on fuzzy preferences. Received: 3 August 1995/Accepted: 19 November 1997