Optimally bringing together two sides of a market is a key problem of economics. In the 1960s, David Gale and Lloyd Shapley developed the “Deferred Acceptance” algorithm (DA) to find stable matching among two groups, often called the “stable marriage problem.” In the 1980s, Alvin Roth built on their work and developed systems for matching doctors with hospitals, school children with schools, and organ donors with patients. In the 2010s, Josh Angrist and Parag Pathak built on their work to develop algorithms optimized for assigning students to schools, while accounting priorities and diversity factors, such as sibling preference, gender balance, and diversity. All modern systems use some version of Angrist and Pathak’s work, but only Avela’s is easily configurable, auditable, and equitable.