Menu-dependent preferences and revelation principle

We extend the set of preferences to include menu-dependent preferences and characterize the domain in which the revelation principle holds. A weakening of the well-known contraction consistency is shown to define a subset of this domain. However, we show that minimax-regret preference can be outside the domain.     

Collective choice under dichotomous preferences

Agents partition deterministic outcomes into good or bad. A mechanism selects a lottery over outcomes (time-shares). The probability of a good outcome is the canonical utility. The utilitarian mechanism averages over outcomes with largest “approval”. It is efficient, strategyproof, anonymous and neutral.We reach an impossibility if, in addition, each agent's utility is at least , where n is the number of agents; or is at least the fraction of good to feasible outcomes. We conjecture that no ex ante efficient and strategyproof mechanism guarantees a strictly positive utility to all agents, and prove a weaker statement.     

RISKY VERSUS RISKLESS BARGAINING PROCEDURES: THE AUMANN‐ROTH CONTROVERSY REVISITED*

In a series of papers, Aumann and Roth discussed a game in which players can cooperate in pairs and two of them prefer to form a coalition with each other. Roth argued that the only rational outcome is that the players who prefer each other form a coalition; Aumann argued that all three coalitions are possible because the players have a problem of expectation coordination. A non‐cooperative analysis provides additional support for Aumann's arguments and shows that the difference between Aumann's and Roth's views can be traced back to a difference (risky versus/riskless) in the bargaining procedure.     

Exchange in a general market with indivisible goods

We show how to restrict trades in exchange markets with heterogeneous indivisible goods so that the resulting restricted exchange markets, the fixed deal exchange markets, have a unique core allocation. Our results on fixed deal exchange markets generalize classical results on the Shapley-Scarf housing market, in which each agent owns one good only. Furthermore, we define the class of fixed deal exchange rules for general exchange markets, and prove that these are the only exchange rules that satisfy strategyproofness, individual rationality, and a weak form of efficiency.     

One-dimensional bargaining with Markov recognition probabilities

We study a process of bargaining over alternatives represented by points in the unit interval. The paper focuses on the asymptotic behavior of the subgame perfect equilibrium in stationary strategies as the continuation probability approaches one. We give a complete characterization of the limit of the equilibrium proposals as the generalized fixed point of the decumulative distribution of the players' ideal points as induced by the recognition probabilities. In contrast to the existing literature, we find no general relationship between the limit equilibrium proposals and either the Nash bargaining solution or the median voter outcome.     

Implementation of individually rational social choice functions with guaranteed utilities

A simple mechanism is presented that allocates an indivisible object between two agents for almost any possible compensation rule. Furthermore, the equilibrium strategy guarantees a level of utility not less than −ε, where ε can be arbitrarily small.     

Median stable matching for markets with wages

We define the median stable matching for two-sided matching markets with wages and prove constructively that it exists.     

The weak core of simple games with ordinal preferences: implementation in Nash equilibrium

In a simple game, coalitions belonging to a given class are “absolutely powerful” while others have no power. We attempt to make this distinction operational. Toward this end, we propose two axioms on social choice correspondences, Strong Non-Discrimination and Exclusion. Strong Non-Discrimination describes circumstances under which certain coalitions, the losing coalitions, have no influence over social choice. Exclusion requires that there are situations in which certain coalitions, the winning coalitions, can exercise their power. We show that the weak core correspondence is the minimal correspondence satisfying Maskin Monotonicity and Strong Non-Discrimination. We also show that the weak core is the unique correspondence satisfying Nash implementability, Strong Non-Discrimination, and Exclusion.     

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.     

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.     

Repeated games with present-biased preferences

We study infinitely repeated games with perfect monitoring, where players have β-δ preferences. We compute the continuation payoff set using recursive techniques and then characterize equilibrium payoffs. We then explore the cost of the present-time bias, producing comparative statics. Unless the minimax outcome is a Nash equilibrium of the stage game, the equilibrium payoff set is not monotonic in β or δ. Finally, we show how the equilibrium payoff set is contained in that of a repeated game with smaller discount factor.     

Market structure and matching with contracts

Ostrovsky (2008) [9] develops a theory of stability for a model of matching in exogenously given networks. For this model a generalization of pairwise stability, chain stability, can always be satisfied as long as agents' preferences satisfy same side substitutability and cross side complementarity. Given this preference domain I analyze the interplay between properties of the network structure and (cooperative) solution concepts. The main structural condition is an acyclicity notion that rules out the implementation of trading cycles. It is shown that this condition and the restriction that no pair of agents can sign more than one contract with each other are jointly necessary and sufficient for (i) the equivalence of group and chain stability, (ii) the core stability of chain stable networks, (iii) the efficiency of chain stable networks, (iv) the existence of a group stable network, and (v) the existence of an efficient and individually stable network. These equivalences also provide a rationale for chain stability in the unrestricted model. The (more restrictive) conditions under which chain stability coincides with the core are also characterized.     

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     

Non-cooperative support for the asymmetric Nash bargaining solution

We study a model of non-cooperative multilateral unanimity bargaining on a full-dimensional payoff set. The probability distribution with which the proposing player is selected in each bargaining round follows an irreducible Markov process. If a proposal is rejected, negotiations break down with an exogenous probability and the next round starts with the complementary probability. As the risk of exogenous breakdown vanishes, stationary subgame perfect equilibrium payoffs converge to the weighted Nash bargaining solution with the stationary distribution of the Markov process as the weight vector.