Raghavan, T. E. S.; Solymosi, Tamás - In: International Journal of Game Theory 30 (2001) 2, pp. 177-185
We prove that the core of an assignment game (a two-sided matching game with transferable utility as introduced by Shapley and Shubik, 1972) is stable (i.e., it is the unique von Neumann-Morgenstern solution) if and only if there is a matching between the two types of players such that the...