We study the existence of group strategy-proof stable rules in many-to-many matching markets under responsiveness of agents' preferences. We show that when firms have acyclical preferences over workers the set of stable matchings is a singleton, and the worker-optimal stable mechanism is a...

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 study iterated formation of mutually best matches (IMB) in college admissions problems. When IMB produces a maximal individually rational matching, the matching has many good properties like Pareto optimality and stability. If preferences satisfy a single peakedness condition, or have a...

This paper proposes a way to allocate schools places conciliating Pareto efficiency and Equity. Taking as a starting point the recent reform proposed by the Boston School Committee, we suggest to allow the schools to prioritize only a reduced group of students and use a common priority order for...

The prevalent affirmative action policy in school choice limits the number of admitted majority students to give minority students higher chances to attend their desired schools. There have been numerous efforts to reconcile affirmative action policies with celebrated matching mechanisms such as...

We generalize the school choice problem by defining a notion of allowable priority violations. In this setting, a weak axiom of stability (partial stability) allows only certain priority violations. We introduce a class of algorithms called the Student Exchange under Partial Fairness (SEPF)....

Extensive evidence suggests that participants in the direct student-proposing deferred-acceptance mechanism (DSPDA) play dominated strategies. In particular, students with low priority tend to misrepresent their preferences for popular schools. To explain the observed data, we introduce...

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 characterize a parametric family of application-rejection school choice mechanisms, including the Boston and Deferred Acceptance mechanisms as special cases, and spanning the parallel mechanisms for Chinese college admissions, the largest centralized matching in the world. Moving from one...