match the same incompatible pairs while matching the least number of compatible pairs. We extend the celebrated Gallai …

mechanism was ruled illegal in 2007. Our approach provides support for these and other recent policy changes involving matching …

it is possible to construct Pareto-efficient matchings that match the same incompatible pairs while matching the least …

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 …

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 this …

stability. Nevertheless, an embedding into a one-to-one agent--slot matching market shows that stable outcomes exist and can be …

We show that an ambiguity in setting the primitives of the matching with contracts model by Hatfield and Milgrom (2005 …

ROTC's choice of a poorly behaved cadet-branch matching mechanism. Not only does the ROTC mechanism effectively block the …. Building on recent advances in matching markets, we propose a design that eliminates each of these deficiencies and also …