‘Regular’ choice and the weak axiom of stochastic revealed preference

We explore the relation between two ‘rationality conditions’ for stochastic choice behavior: regularity and the weak axiom of stochastic revealed preference (WASRP). We show that WASRP implies regularity, but the converse is not true. We identify a restriction on the domain of the stochastic choice function, which suffices for regularity to imply WASRP. When the universal set of alternatives is finite, this restriction is also necessary for regularity to imply WASRP. Furthermore, we identify necessary and sufficient domain restrictions for regularity to imply WASRP, when the universal set of alternatives is finite and stochastic choice functions are all degenerate. Results in the traditional, deterministic, framework regarding the relation between Chernoff’s condition and the weak axiom of revealed preference follow as special cases. Thus, general conditions are established, under which regularity can substitute for WASRP as the axiomatic foundation for a theory of choice behavior.     

A subjective model of experimentation

Typically an experiment is defined by a set of possible signals and a likelihood function, and both are specified exogenously—they are taken to be observable by the analyst. This paper renders them subjective by showing that they may be derived from suitable choice behavior. This is done in the context of an axiomatic representation theorem for preference on a suitable domain.     

Strategy-proof allocation mechanisms for pure public goods economies when preferences are monotonic

Summary. A fundamental problem in public finance is that of allocating a␣given budget to financing the provision of public goods (education, transportation, police, etc.). In this paper it is established that when␣admissible preferences are those representable by continuous and increasing utility functions, then strategy-proof allocation mechanisms whose (undominated) range contains three or more outcomes are dictatorial on the set of profiles of strictly increasing utility functions, a dense subset of the domain in the topologies commonly used in this context. If admissible utility functions are further restricted to be strictly increasing, or if mechanisms are required to be non-wasteful, then strategy-profness leads to (full) dictatorship. Received: August 14, 1995; revised version: September 25, 1997     

Preference revelation with a limited number of indifference classes

Suppose that g is a strategy-proof social choice rule on the domain of all profiles of complete and transitive binary relations that have exactly m indifference classes. If and the range of g has three or more members, then g is dictatorial. If m = 2, then for any set X of feasible alternatives, there exist non-dictatorial and strategy-proof rules that are sensitive to the preferences of every individual and which have X as range.     

Subjective probabilities on “small” domains

The Savagian choice-theoretic construction of subjective probability does not apply to preferences, like those in the Ellsberg Paradox, that reflect a distinction between risk and ambiguity. We formulate two representation results—one for expected utility, the other for probabilistic sophistication—that derive subjective probabilities but only on a “small” domain of risky events. Risky events can be either specified exogenously or in terms of choice behavior; in the latter case, both the values and the domain of probability are subjective. The analysis identifies a mathematical structure—called a mosaic—that is intuitive for both exogenous and behavioral specifications of risky events. This structure is weaker than an algebra or even a λ-system.     

Condorcet cycles in bipartite populations

Summary. Simple majority voting between pairs of alternatives is used to aggregate individual preferences. The occurence of Condorcet cycles is limited thanks to a principle of homogeneity on individual preferences. The restrictions induced on the domain of the latters are weak: among the n! possible orderings of n alternatives, more than one half are admissible within a domain. The resulting aggregated preference has then a neglectable probability of showing up cycles. We show moreover that the set of individual preferences can be `naturally' partitioned into two such domains. Received: June 17, 1996; revised version: April 15, 1997     

Decomposable Strategy-Proof Social Choice Functions

This article shows that a social choice function defined on a domain of separable preferences which satisfies a relatively weak domain-richness condition on a product set of alternatives is (i) strategy-proof and only depends on the tops of the individual preferences if and only if (ii) the range of the social choice function is a product set and the social choice function can be decomposed into the product of one-dimensional, strategy-proof, nontop-insensitive social choice functions.
JEL Classification Number: D71.     

Bayesian learning and convergence to Nash equilibria without common priors

Summary. Consider an infinitely repeated game where each player is characterized by a “type” which may be unknown to the other players in the game. Suppose further that each player's belief about others is independent of that player's type. Impose an absolute continuity condition on the ex ante beliefs of players (weaker than mutual absolute continuity). Then any limit point of beliefs of players about the future of the game conditional on the past lies in the set of Nash or Subjective equilibria. Our assumption does not require common priors so is weaker than Jordan (1991); however our conclusion is weaker, we obtain convergence to subjective and not necessarily Nash equilibria. Our model is a generalization of the Kalai and Lehrer (1993) model. Our assumption is weaker than theirs. However, our conclusion is also weaker, and shows that limit points of beliefs, and not actual play, are subjective equilibria. Received: March 3, 1995; revised version: February 17, 1997     

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.     

Corrigendum to “School choice: An experimental study” [J. Econ. Theory 127 (1) (2006) 202-231]

We correct an inconsistency in the efficiency comparison reported in [Y. Chen, T. Sönmez, School choice: An experimental study, J. Econ. Theory 127 (1) (2006) 202-231]. The efficiency comparison of the three school choice mechanisms in our paper is based on recombinant estimation with an identical set of 10 tie-breakers, while the statistics reported in Table 7 is computed using 14,400 tie-breakers.     

Are Optimal CO2 Emissions Really Optimal?

Although the greenhouse effect is by many considered as one of the most serious environmental problems, several economic studies of the greenhouse effect, most notably Nordhaus's DICE model, suggest that it is optimal to allow the emissions of greenhouse gases (GHG) to increase by a factor of three over the next century. Other studies have found that substantial reductions can be justified on economic grounds. This paper explores into the reasons for these differences and identifies four (partly overlapping) crucial issues that have to be dealt with when analysing the economics of the greenhouse effect: low-probability but catastrophic events; cost evaluation methods; the choice of discount rate; the choice of decision criterion. The paper shows that (i) these aspects are crucial for the policy conclusions drawn from models of the economics of climate change, and that (ii) ethical choices have to be made for each of these issues. This fact needs wider recognition since economics is very often perceived as a value neutral tool that can be used to provide policy makers with “optimal” policies.     

On the choice of functional form in stochastic frontier modeling

This paper examines the effect of functional form specification on the estimation of technical efficiency using a panel data set of 125 olive-growing farms in Greece for the period 1987–93. The generalized quadratic Box-Cox transformation is used to test the relative performance of alternative, widely used, functional forms and to examine the effect of prior choice on final efficiency estimates. Other than the functional specifications nested within the Box-Cox transformation, the comparative analysis includes the minflex Laurent translog and generalized Leontief that possess desirable approximation properties. The results indicate that technical efficiency measures are very sensitive to the choice of functional specification. Perhaps most importantly, the choice of functional form affects the identification of the factors affecting individual performance – the sources of technical inefficiency. The analysis also shows that while specification searches do narrow down the set of feasible alternatives, the identification of the most appropriate functional specification might not always be (statistically) feasible. First version received: November 1999/Final version received: July 2001 RID="*" ID="*"  The authors wish to thank Almas Heshmati, Robert Romain, and an anonymous referee for insightful comments and suggestions. Special thanks go to the associate editor who handled the paper, and whose careful reading and suggestions have improved the paper substantially. The second author wishes to acknowledge the financial support from “President SSHRC” from the University of Saskatchewan. The usual caveats with respect to opinions expressed in the paper apply. Senior authorship is shared. This is University of Nebraska-Lincoln Agricultural Research Division Article No. 13270.     

Voting by committees under constraints

We consider social choice problems where a society must choose a subset from a set of objects. Specifically, we characterize the families of strategy-proof voting procedures when not all possible subsets of objects are feasible, and voters’ preferences are separable or additively representable.     

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.     

Revealed group preferences on non-convex choice problems

Summary. This paper studies the conditions under which the basic results of the revealed preference theory can be established on the domain of choice problems which include non-convex feasible sets; the exercise is closely related to the works of Peters and Wakker (1991) and Bossert (1994). We show that while no continuous choice function can satisfy strong Pareto optimality over the class of all compact and comprehensive choice problems, strong Pareto optimality, Arrow's choice axiom, upper hemicontinuity and a weak compromisation postulate turn out to be necessary and sufficient to represent choice correspondences by continuous, strictly increasing and quasiconcave real-valued functions. Some applications of our main findings to axiomatic bargaining theory are also studied. Received: December 2, 1996; revised version: February 27, 1998     

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.     

Pareto improving financial innovation in incomplete markets

Summary. In this paper we develop a differential technique for investigating the welfare effects of financial innovation in incomplete markets. Utilizing this technique, and after parametrizing the standard competitive, pure-exchange economy by both endowments and utility functions, we establish the following (weakly) generic property: Let S be the number of states, I be the number of assets and H be the number of households, and consider a particular financial equilibrium. Then, provided that the degree of market incompleteness is sufficiently larger than the extent of household heterogeneity, S−I≥2H−1 [resp. S−I≥H+1], there is an open set of single assets [resp. pairs of assets] whose introduction can make every household better off (and, symmetrically, an open set of single assets [resp. pairs of assets] whose introduction can make them all worse off ). We also devise a very simple nonparametric procedure for reducing extensive household heterogeneity to manageable size, a procedure which not only makes our restrictions on market incompleteness more palatable, but could also prove to be quite useful in other applications involving smooth analysis. Received: August 14, 1995; revised version: April 14, 1997     

Pigouvian pricing and stochastic evolutionary implementation

We study the implementation of efficient behavior in settings with externalities. A planner would like to ensure that a group of agents make socially optimal choices, but he only has limited information about the agents’ preferences, and can only distinguish individual agents through the actions they choose. We describe the agents’ behavior using a stochastic evolutionary model, assuming that their choice probabilities are given by the logit choice rule. We prove that there is a simple price scheme with the following property: regardless of the realization of preferences, a group of agents subjected to the price scheme will spend the vast majority of time in the long run behaving efficiently. The price scheme defines a game that may possess multiple equilibria, but we are able to obtain a unique and efficient selection from this set because of the stochastic nature of the agents’ choice rule. We conclude by comparing the performance of our price scheme with that of VCG mechanisms.     

Nash implementation with partially honest individuals

We investigate the problem of Nash implementation in the presence of “partially honest” individuals. A partially honest player is one who has a strict preference for revealing the true state over lying when truthtelling does not lead to a worse outcome than that which obtains when lying. We show that when there are at least three individuals, all social choice correspondences satisfying No Veto Power can be implemented. If all individuals are partially honest and if the domain is separable, then all social choice functions can be implemented in strictly dominant strategies by a mechanism which does not use “integer/modulo games”. We also provide necessary and sufficient conditions for implementation in the two-person case, and describe some implications of these characterization conditions.     

An additively separable representation in the Savage framework

This paper proposes necessary and sufficient conditions for an additively separable representation of preferences in the Savage framework (where the objects of choice are acts: measurable functions from an infinite set of states to a potentially finite set of consequences). A preference relation over acts is represented by the integral over the subset of the product of the state space and the consequence space which corresponds to the act, where this integral is calculated with respect to an evaluation measure on this space. The result requires neither Savage's P3 (monotonicity) nor his P4 (weak comparative probability). Nevertheless, the representation it provides is as useful as Savage's for many economic applications.