Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions

Working Paper: NBER ID: w13225

Authors: Alvin E. Roth

Abstract: The deferred acceptance algorithm proposed by Gale and Shapley (1962) has had a profound influence on market design, both directly, by being adapted into practical matching mechanisms, and, indirectly, by raising new theoretical questions. Deferred acceptance algorithms are at the basis of a number of labor market clearinghouses around the world, and have recently been implemented in school choice systems in Boston and New York City. In addition, the study of markets that have failed in ways that can be fixed with centralized mechanisms has led to a deeper understanding of some of the tasks a marketplace needs to accomplish to perform well. In particular, marketplaces work well when they provide thickness to the market, help it deal with the congestion that thickness can bring, and make it safe for participants to act effectively on their preferences. Centralized clearinghouses organized around the deferred acceptance algorithm can have these properties, and this has sometimes allowed failed markets to be reorganized.

Keywords: Deferred Acceptance; Market Design; Matching Algorithms

JEL Codes: C7; C71; C72; C78; N01


Causal Claims Network Graph

Edges that are evidenced by causal inference methods are in orange, and the rest are in light blue.


Causal Claims

CauseEffect
deferred acceptance algorithms (C78)efficient allocation of positions (D61)
deferred acceptance algorithms (C78)reduce chaos and inefficiencies (D61)
deferred acceptance algorithms (C78)stabilize offers (C62)
deferred acceptance algorithms (C78)resolve issues of congestion (L91)
deferred acceptance algorithms (C78)improve matching process in school choice systems (C78)
deferred acceptance algorithms (C78)align outcomes with true preferences (D01)

Back to index