Time: 12:00pm – 1:30pm
Place: Maxwell Dworkin 119
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.