Sönmez, Tayfun; Kara, Tarik - In: Economic Theory 9 (1997) 2, pp. 197-218
We consider both Nash and strong Nash implementation of various matching rules for college admissions problems. We show that all such rules are supersolutions of the stable rule. Among these rules the "lower bound" stable rule is implementable in both senses. The "upper bound" Pareto and...