Kennes, John; Monte, Daniel; Tumennasan, Norovsambuu - School of Economics and Management, University of Aarhus - 2011
Gale-Shapley deferred acceptance algorithm for dynamic problems and show that it yields a matching that satisfies strong … stability. It is not Pareto dominated by any other matching, and, if there is an efficient stable matching, it must be the Gale … stronger impossibility result: For the class of dynamic matching problems that we study, there are no algorithms that satisfy …