Strategies as states

We define rationality and equilibrium when states specify agents’ actions and agents have arbitrary partitions over these states. Although some suggest that this natural modeling step leads to paradox, we show that Bayesian equilibrium is well defined and puzzles can be circumvented. The main problem arises when player j's partition informs j of i's move and i knows j's strategy. Then i's inference about j's move will vary with i's own move, and i may consequently play a dominated action. Plausible conditions on partitions rule out these scenarios. Equilibria exist under the same conditions, and more generally ε equilibria usually exist.     

The robustness of robust implementation

We show that a mechanism that robustly implements optimal outcomes in a one-dimensional supermodular environment continues to robustly implement ε-optimal outcomes in all close-by environments. Robust implementation of ε-optimal outcomes is thus robust to small perturbations of the environment. This is in contrast to ex-post implementation which is not robust in this sense as only trivial social choice functions are ex-post implementable in generic environments.     

Justifiable preferences

We characterize preferences over acts that can be represented by a utility function and a multiple-prior, such that an act f is preferred to act g if there is a prior under which the expected utility induced by f is higher than that induced by g. These preferences are referred to as justifiable preferences. We further introduce a generalized model of ambiguity that involves a collection of multiple-priors, namely, multiple multiple-priors and incorporate Bewley?s Knightian model in justifiability: f is preferred to g if, according to at least one set of priors, f is unanimously preferred to g.     

Subgame perfect implementation: A full characterization

Moore and Repullo [Subgame perfect implementation, Econometrica 56 (1988) 1191-1220], and Abreu and Sen [Subgame perfect implementation: a necessary and almost sufficient condition, J. Econ. Theory 50 (1990) 285-299] introduce distinct necessary and sufficient conditions for SPE implementation, when the number of players is at least three. This paper closes the gap between the conditions—a complete characterization of the SPE implementable choice rules is provided. The characterization consists of α^*, which strengthens α of Abreu-Sen by adding it a restricted veto-power condition, and the unanimity condition. Under strict preferences α^* is equal to α.     

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.     

An efficiency theorem for incompletely known preferences

There are n agents who have von Neumann-Morgenstern utility functions on a finite set of alternatives A. Each agent i's utility function is known to lie in the nonempty, convex, relatively open set Ui. Suppose L is a lottery on A that is undominated, meaning that there is no other lottery that is guaranteed to Pareto dominate L no matter what the true utility functions are. Then, there exist utility functions ui∈Ui for which L is Pareto efficient. This result includes the ordinal efficiency welfare theorem as a special case.     

Bargaining one-dimensional social choices

We analyze bargaining over the one-dimension characteristic of a public good among n impatient players when decisions require q favorable votes, q?2. Stationary subgame perfect equilibrium strategies are characterized for all games with deterministic protocol. We provide a monotonicity condition (satisfied by all single-peak, strictly quasi-concave and concave utilities) that assures uniqueness for every q whenever player's utilities are symmetric around the peak. Without symmetry, the monotonicity condition assures uniqueness for qualified majorities, q>n/2, provided that agents are sufficiently patient and utilities satisfy an additional regularity condition. Asymptotic uniqueness is assured for qualified majorities by imposing only the monotonicity condition.     

Recursive preferences and balanced growth

We study a class of utility functions that are defined recursively by an aggregator W(x,y) where u_t=W(c_t,u_t+1). In single-agent economies it is known that a sufficient condition for the existence of a balanced growth path is that utility should be homogenous of degree γ. In the context of a multi-agent economy we show that this restriction implies that either a balanced growth equilibrium fails to exist or all agents have the same constant discount factor. We suggest a generalization of recursive preferences wherein the intertemporal utility function is time dependent. Within this class we establish that there may exist a balanced growth equilibrium even if agents are different.     

Competitive manufacturing with fluctuating demand and diverse technology: Mathematical proofs and illuminations on industry output-flexibility

I present an original model of competitive manufacturing with fluctuating demand and diverse technology with mathematical proofs. I discuss Aranoff's output-flexibility indicator, E(AC)-LRMC. I use the model to compute Aranoff's output-flexibility indicator to measure industry output-flexibility. I argue that a measure of industry output-flexibility is β_L(Q₂ − Q₁)/E(Q) I tie the demand-side discussion with the cost-side and show the degree of industry output-flexibility that will emerge under welfare and profit-maximizing pricing rules. I perform comparative statics of changes in technology, of demand, and of frequency of the high-peak state.     

Rates of information aggregation in common value auctions

We study the rates at which transaction prices aggregate information in common value auctions under the different information structures in Wilson (Rev. Econ. Stud. 44 (1977) 511) and Pesendorfer and Swinkels (Econometrica 65 (1997) 1247). We consider uniform-price auctions in which k identical objects of unknown value are auctioned to n bidders, where both n and k are allowed to diverge to infinity, and k/n converges to a number in [0,1). The Wilson assumptions lead to information aggregation at a rate proportional to , but the price aggregates information at a rate proportional to in the PS setting. We also consider English auctions, and investigate whether the extra information revealed in equilibrium improves convergence rates in these auctions.     

Efficiency and consistency for locating multiple public facilities

In the problem of locating multiple public facilities studied by Barberà and Beviá [Self-selection consistent functions, J. Econ. Theory 105 (2002) 263-277; Locating public facilities by majority: stability, consistency and group formation, Games Econ. Behav. 56 (2006) 185-200], we offer simple necessary and sufficient conditions for efficiency, decentralizability of efficient decisions in a game of community division and local public goods provision, and a constructive algorithm for efficient and consistent decisions.     

Learnability and rationality of choice

In this paper we study the learnability of the class of rationalizable choice functions using the basic concept of PAC-learnability from statistical learning theory. We prove that the class of rationalizable choice functions on N alternatives is learnable from O(N) examples and is optimal in terms of PAC-learnability among classes which are invariant under permutations of the elements.     

Moral hazard with bounded payments

We study the moral hazard problem with general upper and lower constraints M on compensation. We characterize the optimal contract and show existence and uniqueness. When minimizing costs for given effort, a principal harmed by M will pay according to M on some range of outcomes; when M reflects limited liability or a minimum wage, the contract is option-like. When the principal also chooses effort, a principal harmed by M might nonetheless never pay according to M. This cannot occur if the cost of inducing effort in the standard principal-agent problem is convex, for which we provide sufficient conditions related to the informativeness of outcome about effort.     

Buyer search and price dispersion: a laboratory study

We study markets with costly buyer search in which sellers simultaneously post prices. Buyers costlessly observe one or (with probability 1−q) two of the posted prices, and can accept one or pay to search again. The experiment varies q, the search cost, and the number of buyers. Equilibrium theory predicts a unified very low (high) price for q=0 (q=1) and predicts specific distributions of dispersed prices for q=1/3 and 2/3. Actual prices conform closely to the predictions in some treatments. Buyers’ reservation prices are biased away from the extremes, however, and sellers’ prices have positive autocorrelation and cross-sectional correlation.     

Games of fixed rank: a hierarchy of bimatrix games

We propose and investigate a hierarchy of bimatrix games (A, B), whose (entry-wise) sum of the pay-off matrices of the two players is of rank k, where k is a constant. We will say the rank of such a game is k. For every fixed k, the class of rank k-games strictly generalizes the class of zero-sum games, but is a very special case of general bimatrix games. We study both the expressive power and the algorithmic behavior of these games. Specifically, we show that even for k = 1 the set of Nash equilibria of these games can consist of an arbitrarily large number of connected components. While the question of exact polynomial time algorithms to find a Nash equilibrium remains open for games of fixed rank, we present polynomial time algorithms for finding an ε-approximation.     

Too much of a good thing? Why altruism can harm the environment?

Success of eco-labeling schemes, broadly defined, varies among products and across countries. Based on a simple theoretical framework, we show that the nature of environmental attributes among products (i.e., private versus public) and the consumer type (i.e., egoist versus altruist) shape the overall performance of such schemes. In addition, we demonstrate that altruistic consumers exhibiting a too high willingness to pay for the eco-labeled product can inadvertently prevent egoistic consumers from purchasing it, leading to a sub-optimal outcome in terms of environmental performance. Several policy and managerial implications are drawn.     

Greater prudence and greater downside risk aversion

Variation in the degree of downside risk aversion across decision makers has implications for efficient risk sharing. However, except for small differences in risk preferences, there is no index, analogous to the Arrow-Pratt index of risk aversion, that depends only on local properties of the utility function and indicates the degree of aversion to downside risk. A measure that does depend only on local properties of the utility function u, the index of prudence p=−u^?/u^″, is related to downside risk aversion, which is indicated by a positive value for u^?. Although we show that the degree of prudence is not an accurate indicator of the degree of downside risk aversion, we nonetheless demonstrate that a uniform increase in prudence accompanied by a uniform increase (decrease) in risk aversion is sufficient to indicate greater downside risk aversion, provided prudence is greater (less) than three times the degree of risk aversion.     

Characterizations of bargaining solutions in production economies with unequal skills

In production economies with unequal skills, this paper characterizes bargaining solutions by using axioms on allocation rules rather than axioms on classical bargaining solutions. We introduce a new axiom, consistency w.r.t. technological innovations, so that the non-welfaristic characterizations of bargaining solutions in the production economies are provided. By the characterizations, we can classify the three bargaining solutions (the Nash, the Kalai-Smorodinsky, and the Egalitarian solutions) from the viewpoint of responsibility and compensation discussed by Dworkin.     

Ordinal efficiency and dominated sets of assignments

Using lotteries is a common tool for allocating indivisible goods. Since obtaining preferences over lotteries is often difficult, real-life mechanisms usually rely on ordinal preferences over deterministic outcomes. Bogomolnaia and Moulin (J. Econom. Theory 19 (2002) 623) show that the outcome of an ex post efficient mechanism may be stochastically dominated. They define a random assignment to be ordinally efficient if and only if it is not stochastically dominated. In this paper we investigate the relation between ex post efficiency and ordinal efficiency. We introduce a new notion of domination defined over sets of assignments and show that a lottery induces an ordinally efficient random assignment if and only if each subset of the full support of the lottery is undominated.