Identifying and Quantifying (Un)Improvable Students

Abstract

The Deferred Acceptance (DA) mechanism can generate inefficient placements. Although Pareto-dominant mechanisms exist, it remains unclear which and how many students could improve. We characterize the set of unimprovable students and show that it includes those unassigned or matched with their least preferred schools. Nevertheless, by proving that DA's envy digraph contains a unique giant strongly connected component, we establish that almost all students are improvable, and furthermore, they can benefit simultaneously via disjoint trading cycles. Our findings reveal the pervasiveness of DA's inefficiency and the remarkable effectiveness of Pareto-dominant mechanisms in addressing it, regardless of the specific mechanism chosen.

Tasks

Reproductions