In recent years, matching theory has been widely applied in the design of centralized labor markets and school choice programs. At the same time, new theoretical discoveries have shown how to generalize matching algorithms to incorporate contract negotiation and complex market structures. I will survey the history of matching, from the marriage problem, through "marriage with dowries," to generalized matching with contracts. Then, I will discuss applications of generalized matching algorithms to the design of affirmative action and cadet--branch matching systems. I will conclude by showing how these results have recently contributed to the elimination of "walk-zones" in the Boston public schools match.
Scott Duke Kominers is a Junior Fellow at the Harvard Society of Fellows, a Research Scientist at the Harvard Program for Evolutionary Dynamics, and an Associate of the Harvard Center for Research on Computation and Society. From 2011-2013, he was the inaugural Research Scholar at the Becker Friedman Institute for Research in Economics at the University of Chicago.
Kominers received his A.B. in Mathematics and Ph.D. in Business Economics from Harvard University, in 2009 and 2011, respectively. His research focuses on market design and its interactions with law and computer science. His specific research interests include matching theory, mechanism design, law and economics, privacy, and quadratic form representation theory.