The Large and Likely Inefficiency of Stable Matching Mechanisms

We prove that any stable matching mechanism suffers from systematic inefficiency of striking magnitude: in large random markets, any stable allocation is Pareto-inefficient with high probability, and almost all students can simultaneously improve their placements without harming anyone else.

We establish this result by showing that the envy digraph generated by the student-proposing Deferred Acceptance mechanism contains a unique giant strongly connected component, implying that nearly all students are improvable via trading cycles.

Finally, we show that every maximal cycle packing covers almost all students, revealing a surprising asymptotic equivalence among all efficient mechanisms that Pareto-dominate DA.