A further note on the stable matching problem
Using a lemma of J. S. Hwang we obtain a generalization of a theorem of \textit{L. E. Dubins} and \textit{D. A. Freedman} [Am. Math. Mon. 88, 485-494 (1981; Zbl 0449.92024)]. It is shown that the core of the matching game is non-manipulable in a suitable sense by coalitions consisting of both men and women. A further strong stability property of the core is derived.
scientific article; zbMATH DE number 3972897