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 is produced by the mechanism. We find that even...

A new mechanism was introduced in New York City and Boston to assign students to public schools. This mechanism was advocated for its superior fairness property, besides others. We introduce a new framework for school-choice problems and two notions of fairness in lottery design based on ex-ante...

We introduce a two-sided, many-to-one matching with contracts model in which agents with unit demand match to branches that may have multiple slots available to accept contracts. Each slot has its own linear priority order over contracts; a branch chooses contracts by filling its slots...

A set of indivisible objects is allocated among agents with strict preferences. Each object has a weak priority ranking of the agents. A collection of priority rankings, a priority structure, is solvable if there is a strategy-proof mechanism that is constrained efficient, i.e. that always...

We study a two-sided matching market with a set of heterogeneous firms and workers in an environment where jobs are secured by regulation. Without job security Kelso and Crawford have shown that stable outcomes and efficiency prevail when all workers are gross substitutes to each firm. It turns...

We consider the problem of matching a set of medical students to a set of medical residency positions (hospitals) under the assumption that hospitals' preferences over groups of students are responsive. In this context, we study the preference revelation game induced by the student proposing...

In this paper, we investigate the possibility of having stable rules for two-sided markets with transferable utility, that satisfy some valuation monotonicity and fairness axioms. Valuation fairness requires that changing the valuation of a buyer for the object of a seller leads to equal changes...

We study the allocation of German lawyers to regional courts for legal trainee-ships. Because of excess demand in some regions lawyers often have to wait before being allocated. The currently used \"Berlin\" mechanism is not weakly Pareto efficient, does not eliminate justified envy and does not...

Echenique, Lee, Shum, and Yenmez (2013) established the testable revealed preference restrictions for stable aggregate matching with transferable (TU) and non-transferable utility (NTU) and for extremal stable matchings. In this paper, we rephrase their restrictions in terms of properties on a...

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...