arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1401.5269cs.DScs.CCmath.CO
收藏

具有随机偏好的稳定室友问题

Stable Roommates Problem with Random Preferences

Stephan Mertens

摘要:

具有$n$代理的稳定室友问题在时间和空间上具有最坏情况的复杂性$O(n^2)$。然而,随机实例可以更快地解决,并且使用更少的内存。我们介绍了一种算法,具有平均时间和空间复杂度$O(n^\frac{3}{2})$的随机实例。我们用这个算法来模拟大的情况下,稳定的室友问题,并测量概率$p_n$,大小为$n$的随机实例承认一个稳定的匹配。我们的数据支持推测,$p_n = Θ(n^{-1/4})$。

英文摘要:

The stable roommates problem with $n$ agents has worst case complexity $O(n^2)$ in time and space. Random instances can be solved faster and with less memory, however. We introduce an algorithm that has average time and space complexity $O(n^\frac{3}{2})$ for random instances. We use this algorithm to simulate large instances of the stable roommates problem and to measure the probabilty $p_n$ that a random instance of size $n$ admits a stable matching. Our data supports the conjecture that $p_n = Θ(n^{-1/4})$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑