具有不完全列表和领带的超稳定匹配问题的一个实例是无向二部图$G = (A \cup B, E)$,邻接列表是线性排序的领带列表。对于给定的顶点来说,连是顶点的子集。如果通过彼此匹配,顶点$x$和$y$都不会变差,则边$(x,y) \in E \backslash M$是匹配$M$的阻塞边。因此,如果两个顶点想要匹配,则没有缺点。如果不存在关于$M$的阻塞边缘,则匹配的$M$是超稳定的。以前已经表明,超稳定匹配形成一个分配格,超稳定匹配的数量可以是指数的顶点数。我们给出了两个紧凑的表示大小$O(m)$,可以用来构建所有的超稳定匹配,其中$m$表示在图中的边的数量。第二种表示的构造需要$O(mn)$时间,其中$n$表示图中的顶点数,并给出了一个类似于经典稳定婚姻问题中旋转偏序集的显式旋转偏序集。我们还给出了所有超稳定匹配集的多面体刻画,证明了超稳定匹配多面体是整数,从而解决了Gusfield和Irving在书中提出的一个公开问题.
英文摘要:
An instance of the super-stable matching problem with incomplete lists and ties is an undirected bipartite graph $G = (A \cup B, E)$, with an adjacency list being a linearly ordered list of ties. Ties are subsets of vertices equally good for a given vertex. An edge $(x,y) \in E \backslash M$ is a blocking edge for a matching $M$ if by getting matched to each other neither of the vertices $x$ and $y$ would become worse off. Thus, there is no disadvantage if the two vertices would like to match up. A matching $M$ is super-stable if there is no blocking edge with respect to $M$. It has previously been shown that super-stable matchings form a distributive lattice and the number of super-stable matchings can be exponential in the number of vertices. We give two compact representations of size $O(m)$ that can be used to construct all super-stable matchings, where $m$ denotes the number of edges in the graph. The construction of the second representation takes $O(mn)$ time, where $n$ denotes the number of vertices in the graph, and gives an explicit rotation poset similar to the rotation poset in the classical stable marriage problem. We also give a polyhedral characterisation of the set of all super-stable matchings and prove that the super-stable matching polytope is integral, thus solving an open problem stated in the book by Gusfield and Irving .
Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights
二部图中的双边流行匹配是婚姻环境中稳定匹配的一个众所周知的推广,当偏好列表不完整时,它们尤其相关。在这种情况下,稳定匹配的基数可以小到最大匹配大小的一半。流行的匹配允许更大规模的分配,同时仍然保证一定的公平性条件。事实上,稳定匹配是最小大小的流行匹配,并且在给定实例中,最大大小的流行匹配可以是(ny)稳定匹配的大小的两倍。流行匹配的结构似乎比稳定匹配的结构更复杂,目前也更难理解。在本文中,我们专注于流行的匹配相关的三个优化问题。首先,我们对带有禁止和强制元素的流行匹配问题的复杂性进行了粒度分析,从而补充了[Cseh和Kavitha,2016]的结果。特别是,我们表明,决定是否存在一个流行的匹配(或没有)两个给定的边缘是NP-难。这意味着找到一个流行的匹配的最大值(或)。最小)权重是NP-难的,即使所有权重都是非负的,也不能近似到1/2(分别是任何因素)。[Cseh and Kavitha,2016]中的分解定理可以用于对具有非负权重的最大加权流行匹配问题进行1/2近似,从而完全解决这些问题的复杂性。