社会稳定条件下带约束和不完全有界长度偏好列表的稳定婚姻问题
Stable Marriage Problem with Ties and Incomplete bounded length preference list under social stability
摘要:
我们考虑社会稳定的婚姻问题的一个变种的偏好列表可能是不完整的,可能包含的关系,并可能有界的长度。在现实世界的应用,如NRMP和苏格兰医疗匹配计划,这样的限制出现非常频繁的代理(男人/女人)的集合是非常大的,提供一个完整的和严格的顺序偏好列表实际上是不可行的。在偏好列表中存在关系时,最常见的解决方案是弱社会稳定匹配。事实上,在一个实例中,弱稳定匹配可以具有不同的大小。这激发了寻找最大基数弱社会稳定匹配的问题。
英文摘要:
We consider a variant of socially stable marriage problem where preference lists may be incomplete, may contain ties and may have bounded length. In real world application like NRMP and Scottish medical matching scheme such restrictions arise very frequently where set of agents (man/woman) is very large and providing a complete and strict order preference list is practically in-feasible. In presence of ties in preference lists, the most common solution is weakly socially stable matching. It is a fact that in an instance, weakly stable matching can have different sizes. This motivates the problem of finding a maximum cardinality weakly socially stable matching.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。