Interdistrict school choice programs-where a student can be assigned to a school outside of her district-are widespread in the US, yet the market-design literature has not considered such programs. We introduce a model of interdistrict school choice and present two mechanisms that produce stable...

We study path-independent choice rules applied to a matching context. We use a classic representation of these choice rules to introduce a powerful technique for matching theory. Using this technique, we provide a deferred acceptance algorithm for many-to-many matching markets with contracts and...

I propose a centralized clearinghouse for college admissions in which students can signal enthusiasm by commitment, as in early-decision programs. Furthermore, students can specify financial aid in their preferences and they can be matched with multiple colleges simultaneously. This...

School choice programs aim to give students the option to choose their school. At the same time, underrepresented minority students should be favored to close the opportunity gap. A common way to achieve this is to have a majority quota at each school, and to require that no school be assigned...

We characterize choice rules for schools that regard students as substitutes while expressing preferences for a diverse student body. The stable (or fair) assignment of students to schools requires the latter to regard the former as substitutes. Such a requirement is in conflict with the reality...

This paper studies housing markets in the presence of constraints on the number of agents involved in exchanges. We search for mechanisms satisfying effective endowments-swapping proofness, which requires that no pair of agents can gain by “individually rational” swapping their endowments...

We propose a simple model in which agents are matched in pairs in order to complete a task of unit size. The preferences of agents are single-peaked and continuous on the amount of time they devote to it. Our model combines features of two models: assignment games (Shapley and Shubik (1971)) and...

We study the problem of an organization that has a large number of potential tasks and has to choose which tasks to handle and which pair of experts assign to each of them. We propose a mechanism that generates a Pareto-efficient assignment in the weak core and is group strategy-proof. The...

Distributional constraints are common features in many real matching markets, such as medical residency matching, school admissions, and teacher assignment. We develop a general theory of matching mechanisms under distributional constraints. We identify the necessary and sufficient condition on...

We consider the multi-object allocation problem with monetary transfers where each agent obtains at most one object (unit-demand). We focus on allocation rules satisfying individual rationality, non-waste fulness, equal treatment of equals, and strategy-proofness. Extending the result of...