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 …

notions of fairness in lottery design based on ex-ante stability. This framework unifies known many-to-one and one …-sided matching models. We show that the NYC/Boston mechanism fails to satisfy these fairness properties. We then propose two new … ex-ante stability, equal treatment, and constrained ordinal-Pareto-efficiency. …

We introduce a two-sided, many-to-one matching with contracts model in which agents with unit demand match to branches … matching markets with slot-specific priorities, branches' choice functions may not satisfy the substitutability conditions … typically crucial for matching with contracts. Despite this complication, we are able to show that stable outcomes exist in the …

-proof mechanism that is constrained efficient, i.e. that always produces a stable matching that is not Pareto-dominated by another … stable matching. We characterize all solvable priority structures satisfying the following two restrictions: (A) Either there …

military cadet matching. We develop a theory of matching markets under floor constraints. We introduce a stability notion …, which we call floor respecting stability, for markets in which (hard) floor constraints must be respected. A matching is …Floor constraints are a prominent feature of many matching markets, such as medical residency, teacher assignment, and …