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

稳定非交叉匹配

Stable Noncrossing Matchings

Suthee Ruangwises, Toshiya Itoh

摘要:

给定一组$n$男性和$n$女性,男性由位于一条直线上的$n$点表示,女性由位于另一条平行线上的$n$点表示,每个人都有一个列表,该列表将一些异性按严格的偏好顺序排列为他/她可接受的伴侣。在这个问题中,我们希望匹配不同性别的人,以满足人们的偏好,以及使边缘不交叉的几何。一个非交叉阻塞对w.r.t.匹配的$M$是一对$(m,w)$,其中一个男人和一个女人彼此不匹配,但是在$M$中彼此喜欢对方胜过他们自己的伙伴,并且段$(m,w)$不穿过$M$中的任何边。弱稳定非交叉匹配(WSNM)是一种不允许任何非交叉阻塞对的非交叉匹配。在本文中,我们证明了存在的WSNM在任何情况下,通过开发一个$O(n^2)$算法找到一个在给定的实例。

英文摘要:

Given a set of $n$ men represented by $n$ points lying on a line, and $n$ women represented by $n$ points lying on another parallel line, with each person having a list that ranks some people of opposite gender as his/her acceptable partners in strict order of preference. In this problem, we want to match people of opposite genders to satisfy people's preferences as well as making the edges not crossing one another geometrically. A noncrossing blocking pair w.r.t. a matching $M$ is a pair $(m,w)$ of a man and a woman such that they are not matched with each other but prefer each other to their own partners in $M$, and the segment $(m,w)$ does not cross any edge in $M$. A weakly stable noncrossing matching (WSNM) is a noncrossing matching that does not admit any noncrossing blocking pair. In this paper, we prove the existence of a WSNM in any instance by developing an $O(n^2)$ algorithm to find one in a given instance.

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

↑