Stable Matchings and Scarf's Lemma

Speaker Rakesh Vohra, University of Pennsylvania
Date: 2/22/2019
Time: 10 a.m.

103 Transportation Building


ISE Grad Seminar

Event Type: Seminar/Symposium

Abstract: The elegance and simplicity of Gale & Shapley's deferred acceptance algorithm (DA) has made it the algorithm of choice for determining stable matchings in a variety of settings. Each setting has imposed new demands on the algorithm. Among them are to how to handle complementarities (eg couples) and distributional constraints (in school assignment). The simplicity of the DA algorithm makes it unable to accommodate these new considerations except in special cases. In this talk, I outline an alternative approach based on Scarf’s lemma for tackling such problems.


It is based on joint work with Thanh Nguyen.

To request disability-related accommodations for this event, please contact the person listed above, or the unit hosting the event.