Abstract: 

Since Gale and Shapley, economists have studied stable outcomes in two-sided matching markets and the deferred acceptance (Gale–Shapley) algorithm, which finds a stable outcome. The Lone Wolf Theorem illustrates a desirable property of the set of stable outcomes, namely that the set of unmatched agents does not depend on the choice of stable outcome. Classical matching theory has assumed that the set of agents is finite. In this talk, we generalize the Lone wolf Theorem to the infinite setting.