Many-to-many matching:: stable polyandrous polygamy (or polygamous polyandry)
Many-to-many matching:: stable polyandrous polygamy (or polygamous polyandry)
复制标题
DOI：
10.1016/s0166-218x(99)00203-6
复制
发表时间：
2000-04-15
影响因子：
1.1
通讯作者：
Balinski, M
中科院分区：
文献类型：
--
作者：
Ba誰ou, M;Balinski, M
婚姻和大学入学问题的主要结果--一对一和多对一稳定匹配问题--在一般的多对多环境中具有等价性。其中一些结果取决于一个特定的，自然的定义，个人偏好的配偶集：值得注意的是，“最佳”稳定分配的“效率”，“单调性”和“防策略性”的特征。(C)2000 Elsevier Science B. V.保留所有权利。
The major results known for the marriage and university admissions problems - the one-to-one and-many-to-one stable matching problems - are shown to: have equivalents in the general many-to-many setting. Some of these results depend upon a particular, natural definition of individual preferences over sets of mates: notably, characterizations of "optimal" stable assignments in terms of "efficiency", "monotonicity", and "strategy-proofness". (C) 2000 Elsevier Science B.V. All rights reserved.