SOME REMARKS ON THE STABLE MATCHING PROBLEM

被引：249

作者：

GALE, D ^{[1
]}

SOTOMAYOR, M ^{[1
]}

机构：

[1] PONTIFICIA UNIV CATOLICA RIO DE JANEIRO,BR-20000 RIO DE JANEIRO,RJ,BRAZIL

来源：

DISCRETE APPLIED MATHEMATICS | 1985年 / 11卷 / 03期

关键词：

D O I：

10.1016/0166-218X(85)90074-5

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The stable matching problem is that of matching two sets of agents in such a manner that no two unmatched agents prefer each other to their mates. The authors establish three results on properties of these matchings and present two short proofs of a recent theorem of L. E. Dubins and D. Freedman.

引用

页码：223 / 232

页数：10