A characterization of consistent collective choice rules

We characterize a class of collective choice rules such that collective preference relations are consistent. Consistency is a weakening of transitivity and a strengthening of acyclicity requiring that there be no cycles with at least one strict preference, which excludes the possibility of a “money pump.” The properties of collective choice rules used in our characterization are unrestricted domain, strong Pareto, anonymity and neutrality. If there are at most as many individuals as there are alternatives, the axioms provide an alternative characterization of the Pareto rule. If there are more individuals than alternatives, however, further rules become available.     

Priorities in the location of multiple public facilities

A collective decision problem is described by a set of agents, a profile of single-peaked preferences over the real line and a number of public facilities to be located. We consider public facilities that do not suffer from congestion and are non-excludable. We characterize the class of rules satisfying Pareto-efficiency, object-population monotonicity and sovereignty. Each rule in the class is a priority rule that selects locations according to a predetermined priority ordering among “interest groups”. We characterize the subclasses of priority rules that respectively satisfy anonymity, avoid the no-show paradox, strategy-proofness and population-monotonicity. In particular, we prove that a priority rule is strategy-proof if and only if it partitions the set of agents into a fixed hierarchy. Any such rule can also be viewed as a collection of generalized peak-selection median rules, that are linked across populations, in a way that we describe.     

The structure of strategy-proof social choice — Part I: General characterization and possibility results on median spaces

We define a general notion of single-peaked preferences based on abstract betweenness relations. Special cases are the classical example of single-peaked preferences on a line, the separable preferences on the hypercube, the “multi-dimensionally single-peaked” preferences on the product of lines, but also the unrestricted preference domain. Generalizing and unifying the existing literature, we show that a social choice function is strategy-proof on a sufficiently rich domain of generalized single-peaked preferences if and only if it takes the form of voting by issues (“voting by committees”) satisfying a simple condition called the “Intersection Property.”Based on the Intersection Property, we show that the class of preference domains associated with “median spaces” gives rise to the strongest possibility results; in particular, we show that the existence of strategy-proof social choice rules that are non-dictatorial and neutral requires an underlying median space. A space is a median space if, for every triple of elements, there is a fourth element that is between each pair of the triple; numerous examples are given (some well-known, some novel), and the structure of median spaces and the associated preference domains is analysed.     

Fiscal rules of income transformation

Summary. The purpose of this paper is to characterize the class of fiscal rules of income transformation which are equity improving and, at the same time, preserve the ranking of existing distributions. Contrary to the related literature individual well-being depends not just on income but also on prices. We show that, when the environment is restricted such that a general transformation class still can be defined, the only “desirable” fiscal rule is the simple redistributive linear taxation schedule, of the same type that is the rule in practice in most economies. Received: May 8, 1997; revised version: September 15, 1997     

Implementation of college admission rules

Summary We consider both Nash and strong Nash implementation of various matching rules for college admissions problems. We show that all such rules are supersolutions of the stable rule. Among these rules the lower bound stable rule is implementable in both senses. The upper bound Pareto and individually rational rule is strong Nash implementable yet it is not Nash implementable. Two corollaries of interest are the stable rule is the minimal (Nash or strong Nash) implementable solution that is Pareto optimal and individually rational, and the stable rule is the minimal (Nash or strong Nash) implementable extension of any of its subsolutions.We wish to thank Professor William Thomson for his efforts in supervision as well as his useful suggestions. We are grateful to the participants in his reading class, workshops at Bilkent University, University of Rochester, and in particular Jeffrey Banks, Stephen Ching, Bhaskar Dutta, Rangarajan Sundaram and an anonymous referee for their helpful comments.     

A procedural condition necessary and sufficient for cyclic social preference

Several variations and generalizations of the Voting Paradox show that social-preference cycles are not peculiar to majority rule. I offer a new generalization that is demonstrably as general as possible: a relaxation of majority rule is necessary for a cycle of any sort and sufficient for a dominant one—given certain background assumptions, few and familiar. In its “Latin square” proof as well as its assumptions, the sufficiency theorem directly generalizes both the Voting Paradox and Sen's Liberal Paradox.     

Operators for the adjudication of conflicting claims

We consider the problem of allocating some amount of an infinitely divisible and homogeneous resource among agents having claims on this resource that cannot be jointly honored. A “rule” associates with each such problem a feasible division. Our goal is to uncover the structure of the space of rules. For that purpose, we study “operators” on the space, that is, mappings that associate to each rule another one. Duality, claims truncation, and attribution of minimal rights are the operators we consider. We first establish a number of results linking them. Then, we determine which properties of rules are preserved under each of these operators, and which are not.     

Inefficiency of Strategy-Proof Rules for Pure Exchange Economies

In his pioneering article, (in “Decision and Organization” (C. B. McGuire and R. Radner, Eds.), pp. 297-336, North-Holland, Amsterdam, 1972) Hurwicz establishes that there is no strategy-proof, Pareto-efficient, and individually rational rule for pure exchange economies with two agents and two goods, provided that the domain includes a sufficiently wide class of classical preferences. In this article, we extend his result to pure exchange economies with any finite number of agents and goods. We establish that (i) there is no strategy-proof, Pareto-efficient, and individually rational rule on the class of classical, homothetic, and smooth preferences; and (ii) there is no strategy-proof, Pareto-efficient, and symmetric rule on the same class of preferences. Journal of Economic Literature Classification Numbers: D78, D71, C72.     

Between liberalism and democracy

We study and characterize axiomatically a class of voting rules, called consent rules, that incorporate aspects of majoritarianism and liberalism. An outcome of the vote specifies who among the voters are eligible to a certain right or qualification. Each outcome serves also as a permissible ballot. Consent rules are parameterized by the weights given to individuals in determining their own qualification. In one of these rules, the liberal rule, each individual's qualification is determined by her. In other rules, an individual's qualification requires social consent in various degrees. We also show the relation between self-determination and the liberal rule.     

Cognitive constraints, contraction consistency, and the satisficing criterion

A theory of decision making is proposed that offers an axiomatic basis for the notion of “satisficing” postulated by Herbert Simon. The theory relaxes the standard assumption that the decision maker always fully perceives his preferences among the available alternatives, requiring instead that his ability to perceive any given preference be decreasing with respect to the complexity of the choice problem at hand. When complexity is aligned with set inclusion, this exercise is shown to be equivalent to abandoning the contraction consistency axiom of classical choice theory.     

On the uniqueness of fully informative rational expectations equilibria

Summary. This paper analyzes two equivalent equilibrium notions under asymmetric information: risk neutral rational expectations equilibria (rn-REE), and common knowledge equilibria. We show that the set of fully informative rn-REE is a singleton, and we provide necessary and sufficient conditions for the existence of partially informative rn-REE. In a companion paper (DeMarzo and Skiadas (1996)) we show that equilibrium prices for the larger class of quasi-complete economies can be characterized as rn-REE. Examples of quasi-complete economies include the type of economies for which demand aggregation in the sense of Gorman is possible (with or without asymmetric information), the setting of the Milgrom and Stokey no-trade theorem, an economy giving rise to the CAPM with asymmetric information but no normality assumptions, the simple exponential-normal model of Grossman (1976), and a case of no aggregate endowment risk. In the common-knowledge context, we provide necessary and sufficient conditions for a common knowledge posterior estimate, given common priors, to coincide with the full communication posterior estimate. Received: May 29, 1997; revised version: July 18, 1997     

Efficient strategy-proof exchange and minimum consumption guarantees

For exchange economies with classical economic preferences, it is shown that any strategy-proof social choice function that selects Pareto optimal outcomes cannot guarantee everyone a consumption bundle bounded away from the origin. This result demonstrates that there is a fundamental conflict between efficiency and distributional goals in exchange economies if the social choice rule is required to be strategy-proof.     

Market games with differential information and infinite dimensional commodity spaces: The core

Summary We provide an alternative proof of the existence of core allocations in exchange economies with differential information and infinite dimensional commodity spaces. We also identify a critical feature of information sharing rules that ensures nonemptiness of the core. In essence, the only condition we require on the sharing rules is that profitable insider trading be prohibited. In the absence of insider trading, balancedness is guaranteed and core nonemptiness follows.I thank Dan Arce, Erik Balder, Myrna Wooders, and Nicholas Yannelis for helpful comments. This paper is a greatly revised version of my paper entitled. A Variational Problem Arising in Market Games with Differential Information, written in August of 1991.     

PARETO EFFICIENCY AND WEIGHTED MAJORITY RULES

We consider the design of decision rules in an environment with two alternatives, independent private values and no monetary transfers. The utilitarian rule subject to incentive compatibility constraints is a weighted majority rule, where agents' weights correspond to expected gains given that their favorite alternative is chosen. It is shown that a rule is interim incentive efficient if and only if it is a weighted majority rule, and we characterize those weighted majority rules that are ex ante incentive efficient. We also discuss efficiency in the class of anonymous mechanisms and the stability of weighted majority rules.     

A behavioral characterization of plausible priors

Recent decision theories represent ambiguity via multiple priors, interpreted as alternative probabilistic models of the relevant uncertainty. This paper provides a robust behavioral foundation for this interpretation. A prior P is “plausible” if preferences over some subset of acts admit an expected utility representation with prior P, but not with any other prior Q≠P. Under suitable axioms, plausible priors can be elicited from preferences, and fully characterize them; also, probabilistic sophistication implies that there exists only one plausible prior; finally, “plausible posteriors” can be derived via Bayesian updating. Several familiar decision models are consistent with the proposed axioms.     

Strategic analysis of petty corruption: Entrepreneurs and bureaucrats

This paper develops a game-theoretic model of “petty corruption” by government officials. Such corruption is widespread, especially (but not only) in developing and transition economies. The model goes beyond the previously published studies in the way it describes the structure of bureaucratic “tracks,” and the information among the participants. Entrepreneurs apply, in sequence, to a “track” of two or more bureaucrats in a prescribed order for approval of their projects. Our first result establishes that in a one-shot situation no project ever gets approved. This result leads us to consider a repeated interaction setting. In that context we characterize in more detail the trigger-strategy equilibria that minimize the social loss due to the system of bribes, and those that maximize the expected total bribe income of the bureaucrats. The results are used to shed some light on two much advocated anti-corruption policies: the single window policy and rotation of bureaucrats.     

Judgment aggregation: (im)possibility theorems

The aggregation of individual judgments over interrelated propositions is a newly arising field of social choice theory. I introduce several independence conditions on judgment aggregation rules, each of which protects against a specific type of manipulation by agenda setters or voters. I derive impossibility theorems whereby these independence conditions are incompatible with certain minimal requirements. Unlike earlier impossibility results, the main result here holds for any (non-trivial) agenda. However, independence conditions arguably undermine the logical structure of judgment aggregation. I therefore suggest restricting independence to “premises”, which leads to a generalised premise-based procedure. This procedure is proven to be possible if the premises are logically independent.     

Bubble-free policy feedback rules

We consider a broad class of linear dynamic stochastic rational-expectations models made of a finite number N of structural equations for N+1 endogenous variables and to be closed by one policy feedback rule. We design, for any model of this class and any stationary VARMA solution of that model, a “bubble-free” policy feedback rule ensuring that this solution is not only the unique stationary solution of the closed model, but also its unique solution. We apply these results to locally linearisable models of the monetary transmission mechanism and obtain interest-rate rules that not only ensure the local determinacy of the targeted equilibrium in the neighbourhood of the steady state considered, but also prevent the economy from gradually leaving this neighbourhood.     

An experimental comparison of collective choice procedures for excludable public goods

This paper compares three collective choice procedures for the provision of excludable public goods under incomplete information. One, serial cost sharing (SCS), is budget balanced, individually rational, anonymous and strategy proof. The other two are “hybrid” procedures: voluntary cost sharing with proportional rebates (PCS) and with no rebates (NR). PCS satisfies all these properties except strategy proofness, and NR satisfies all the properties except for strategy proofness and budget balance. However, PCS and NR do not exclude any potential users, and they do not require equal cost shares, thereby overcoming the two main sources of inefficiency with SCS. We characterize the Bayesian Nash equilibria (BNE) of the hybrid mechanisms and conduct laboratory experiments to compare the performance of the three mechanisms. We find that PCS produces significantly more efficient allocations than either SCS or NR.