Relaxing the substitutes condition in matching markets with contracts

In the many-to-one matching model with contracts, I provide new necessary and new sufficient conditions for the existence of a stable allocation. These new conditions exploit the fact that one side of the market has strict preferences over individual contracts.     

Stable schedule matching under revealed preference

Baiou and Balinski (Math. Oper. Res., 27 (2002) 485) studied schedule matching where one determines the partnerships that form and how much time they spend together, under the assumption that each agent has a ranking on all potential partners. Here we study schedule matching under more general preferences that extend the substitutable preferences in Roth (Econometrica 52 (1984) 47) by an extension of the revealed preference approach in Alkan (Econom. Theory 19 (2002) 737). We give a generalization of the Gale-Shapley algorithm and show that some familiar properties of ordinary stable matchings continue to hold. Our main result is that, when preferences satisfy an additional property called size monotonicity, stable matchings are a lattice under the joint preferences of all agents on each side and have other interesting structural properties.     

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.     

Approximate cores of games and economies with clubs

We introduce the framework of parameterized collections of games with and without sidepayments and provide three nonemptiness of approximate core theorems. The parameters bound (a) the number of approximate types of players and the size of the approximation and (b) the size of nearly effective groups of players and their distance from exact effectiveness. Our theorems are based on a new notion of partition-balanced profiles and approximately partition-balanced profiles. The results are applied to a new model of an economy with clubs. In contrast to the extant literature, our approach allows both widespread externalities and uniform results. A fundamental new mathematical result, the partition-balancing effect of large numbers, which promises to have further applications, is contained in Appendix A.     

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.     

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.     

An impossibility result for virtual implementation with status quo

In this paper, virtual implementation is restricted to deliver, on the equilibrium path, either a socially optimal outcome or a status quo: an outcome fixed for all preference profiles. Under such a restriction, for any unanimous and implementable social choice function there is a dictator, who obtains her most preferable outcome as long as all agents prefer this outcome to the status quo. Further restrictions on the lottery space and the range of social choice functions allow the dictator to impose her most preferred outcome even when other agents prefer the status quo to this outcome.     

Stable lexicographic rules for shortest path games

For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These rules allocate shares according to some lexicographic preference relation. A computational procedure is provided. Our results relate to those of Tijs et al. (2011).     

Contracting with externalities and outside options

This paper proposes a model of multilateral contracting where players are engaged in two parallel interactions: they dynamically form coalitions and play a repeated normal form game with temporary and permanent decisions. We show that when outside options are independent of the actions of other players all Markov perfect equilibrium without coordination failures are efficient, regardless of externalities created by interim actions. Otherwise, in the presence of externalities on outside options, all Markov perfect equilibrium may be inefficient. This formulation encompasses many economic models, and we analyze the distribution of coalitional gains and the dynamics of coalition formation in four illustrative applications.     

Symmetry-based compromise and the Nash solution to convex bargaining problems

A new axiom, symmetry-based compromise, is introduced to study solutions to convex bargaining problems. It is shown that any efficient solution that is also scale invariant and satisfies symmetry-based compromise must be Nash.     

Matching through position auctions

Using a mechanism design framework, we characterize how a profit-maximizing intermediary can design matching markets when each agent is privately informed about his quality as a partner. Sufficient conditions are provided that ensure a version of positive assortative matching (what we call truncated positive assortative matching) maximizes profits. Under these conditions, all-pay position auctions always implement the profit-maximizing allocation. Winners-pay position auctions, however, only do so in sufficiently large markets.     

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.     

Structural holes in social networks: A remark

In a recent article, [S. Goyal, F. Vega-Redondo, Structural holes in social networks, J. Econ. Theory 137 (1) (2007) 460-492] the authors (GVR) showed the importance of stars and cycles in a given network formation game. Implicitly, in their article, a network is called an equilibrium if it is generated by an equilibrium strategy. We extend the results of GVR to the case of a stronger requirement: namely, that a network can be called an equilibrium only if all the strategies generating it are equilibria. We also show, in a dynamic framework, that both definitions differ in crucial ways.     

Role of linking mechanisms in multitask agency with hidden information

We investigate the adverse selection problem where a principal delegates multiple tasks to an agent. We characterize the virtually implementable social choice functions by using the linking mechanism proposed by Jackson and Sonnenschein (2007) [20] that restricts the message spaces. The principal does not require any incentive wage schemes and can therefore avoid any information rent and welfare loss. We show the resemblance between the functioning of this message space restriction and that of incentive wage schemes. We also extend the results of the single-agent model to the multi-agent model.     

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.     

Bargaining foundations of the median voter theorem

We give a game-theoretic foundation for the median voter theorem in a one-dimensional bargaining model based on Baron and Ferejohn's [D. Baron, J. Ferejohn, Bargaining in legislatures, Amer. Polit. Sci. Rev. 83 (1989) 1181-1206] model of distributive politics. We prove that as the agents become arbitrarily patient, the set of proposals that can be passed in any pure strategy, subgame perfect equilibrium collapses to the median voter's ideal point. While we leave the possibility of some delay, we prove that the agents' equilibrium continuation payoffs converge to the utility from the median, so that delay, if it occurs, is inconsequential. We do not impose stationarity or any other refinements. Our result counters intuition based on the folk theorem for repeated games, and it contrasts with the known result for the distributive bargaining model that as agents become patient, any division of the dollar can be supported as a subgame perfect equilibrium outcome.