arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.02503cs.GT
收藏

复杂稳定匹配问题的近可行解

Near-Feasible Solutions to Complex Stable Matching Problems

Gergely Csáji

AI总结:

本文针对稳定匹配问题的多个NP完全变体,提出基于Scarf算法和迭代舍入的方法,证明通过轻微调整容量总能获得近可行的稳定解,并在Stable Fixtures问题上实现多项式时间运行。

摘要:

在本文中,我们证明,在稳定匹配问题的许多NP完全变体中,例如稳定超图匹配问题、稳定多商品流问题以及具有共同配额(common quotas)的大学录取问题,一个近可行的稳定解——即一个稳定但可能轻微违反某些容量的解——总是存在的。我们的结果提供了强有力的理论保证:即使在复杂约束下,也可以通过最小的容量修改来恢复稳定性。为此,我们提出了一种迭代舍入算法,该算法从稳定的分数解出发,系统地调整容量以确保存在整数稳定解。该方法利用Scarf算法计算初始的分数稳定解,作为舍入过程的基础。值得注意的是,在Stable Fixtures问题中,由于可以高效地计算稳定的分数匹配,我们的方法可在多项式时间内运行。这些发现对市场设计、大学录取以及其他现实世界的分配问题具有重要的实际意义,在这些问题中,对制度约束的微小调整可以保证稳定且可实施的结果。

英文摘要:

In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a near-feasible stable solution - that is, a solution which is stable, but may slightly violate some capacities - always exists. Our results provide strong theoretical guarantees that even under complex constraints, stability can be restored with minimal capacity modifications. To achieve this, we present an iterative rounding algorithm that starts from a stable fractional solution and systematically adjusts capacities to ensure the existence of an integral stable solution. This approach leverages Scarf's algorithm to compute an initial fractional stable solution, which serves as the foundation for our rounding process. Notably, in the case of the Stable Fixtures problem, where a stable fractional matching can be computed efficiently, our method runs in polynomial time. These findings have significant practical implications for market design, college admissions, and other real-world allocation problems, where small adjustments to institutional constraints can guarantee stable and implementable outcomes.

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

↑