In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy …-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that …

game. Conversely, the set of repeated matching (or social) equilibria also includes some plays that are not part of any … definitions, as well as the relationship to renegotiation-proof equilibrium. It is possible for repeated matching equilibria to be …

We consider a general class of two-sided matching markets, called many-to-one matching markets with money. For a …

it replaced. In this paper, we introduce a new framework for investigating school-choice matching problems and two ex …-to-many two-sided and one-sided matching models. We first show that the new NYC/Boston mechanism fails to satisfy these fairness …

game. Conversely, the set of repeated matching (or social) equilibria also includes some plays that are not part of any … definitions, as well as the relationship to renegotiation-proof equilibrium. It is possible for repeated matching equilibria to be …

In this paper we consider one-to-many matching problems where the preferences of the agents involved are represented by … matching to a matching of maximum total reward, one can always provide a compensation schedule that will be ex-post stable in … uses the fact that the core of an associated compensation matching game with constraints is nonempty. …

us to consider production complementarities previously outside the scope of matching theory. We show analogues of the …We introduce a matching model in which agents engage in joint ventures via multilateral contracts. This approach allows …

We formulate a notion of stable outcomes in matching problems with one-sided asymmetric information. The key conceptual …