Divided enrollment systems cause school assignments to be unfair and wasteful. Iterative version of the student-optimal stable mechanism (I-SOSM), proposed by Manjunath and Turhan (2016), achieves individually rational and fair assignments in such partitioned school choice markets for any number...

We study priority-based assignment problems with distributional and diversity objectives. Our work provides an axiomatic characterization of a general class of choice rules which are based on type-specific reserves and quotas. The choice rules in the class differ by the order in which applicants...

We consider a many-to-many matching problem with a priority structure such as the one in undergraduate course allocation. In order to incorporate course priorities, we develop a deterministic pseudo-market mechanism with priority-specific prices that is based on the approximate competitive...

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

We evaluate the goal of maximizing the number of individually rational assignments. We show that it implies incentive, fairness, and implementation impossibilities. Despite that, we present two classes of mechanisms that maximize assignments. The first are Pareto efficient, and undominated –...

We introduce a generalization of the school choice problem motivated by the following observations: students are assigned to grades within schools, many students have siblings who are applying as well, and school districts commonly guarantee that siblings will attend the same school. This last...

We study self-selection in centralized school choice, a strategy that takes place when students submit preferences before knowing their priorities at schools. A student self-selects if she decides not to apply to some schools despite being desirable. We give a theoretical explanation for this...

We introduce a new notion of ex-post efficiency for random assignment problems, namely ex-post rank efficiency that gives a maximal number of agents their favored objects. An ex-post rank efficient random assignment is a lottery over rank efficient deterministic assignments, in the sense of...

We introduce a new criterion to compare the properties of mechanisms when the solution concept used induces multiple solutions. Our criterion generalizes previous approaches in the literature. We use our criterion to compare the stability of constrained versions of the Boston (BOS) and deferred...