cannot include matchings that are not in the core. Moreover, we show that our main result is robust to many-to-one matching … stable when agents are farsighted in one-to-one matching problems. We provide the characterization of vNM farsightedly stable … sets: a set of matchings is a vNM farsightedly stable set if and only if it is a singleton subset of the core. Thus …

We propose a dynamic model of decentralized many-to-one matching in the context of a competitive labor market. Through … are currently employed/unemployed. We show that such a process is absorbed into the core with probability one in finite … time. Moreover, within the core, allocations are selected that are characterized by surplus splitting according to a …

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 …

-sided matching models. We show that the NYC/Boston mechanism fails to satisfy these fairness properties. We then propose two new …

This paper develops a framework for studying repeated matching markets. The model departs from the Gale …-Shapley matching model by having a fixed set of long-lived players (firms) match with a new generation of short-lived players (workers …) in every period. I define history-dependent and self-enforcing matching processes in this repeated matching environment …

problem, termed the multi-core, wherein an agent consents to participate in the grand coalition if she can envision a … cooperating with the grand coalition rather than operating alone. An allocation is in the multi-core if all agents consent to … participate in the grand coalition. We provide a theorem characterizing the non-emptiness of the multi-core and show that the …