稳定的丈夫
Stable husbands
摘要:
假设$n$男孩和$n$女孩随机相互排名。我们发现,任何特定的女孩至少有$({1\over 2}-ε) \ln n$和最$(1+ε)\ln n$不同的丈夫在所有盖尔/沙普利稳定匹配这些排名定义的集合中,概率接近1的$n \to \infty$,如果$ε$是任何正常数。证明强调的一般方法,似乎是有用的许多其他组合算法的分析。
英文摘要:
Suppose $n$ boys and $n$ girls rank each other at random. We show that any particular girl has at least $({1\over 2}-ε) \ln n$ and at most $(1+ε)\ln n$ different husbands in the set of all Gale/Shapley stable matchings defined by these rankings, with probability approaching 1 as $n \to \infty$, if $ε$ is any positive constant. The proof emphasizes general methods that appear to be useful for the analysis of many other combinatorial algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。