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

黑暗中的边权匹配

Edge-weighted Matching in the Dark

Zhiyi Huang, Enze Sun, Xiaowei Wu, Jiahao Zhao

AI总结:

本文提出无分布的 Quadratic Ranking 算法,将无知双边匹配的竞争比提升至 0.659,突破 1−1/e 障碍并超越此前依赖分布的 0.641 结果。

摘要:

我们针对 Oblivious Bipartite Matching(无知双边匹配)问题提出了一种具有 0.659 竞争比的 Quadratic Ranking 算法,该问题是 Query-Commit Matching(查询即提交匹配)的无分布版本。这一结果突破了 1−1/e 的障碍,解决了 Tang、Wu 和 Zhang(JACM 2023)提出的一个开放问题。此外,这种无分布算法的竞争比改进了 Query-Commit Matching 现有最佳的 0.641 比率,该比率由 Chen、Huang、Li 和 Tang(SODA 2025)的依赖分布算法取得。Quadratic Ranking 是经典 Ranking 算法的一种新颖变体。我们用两个函数对该算法进行参数化,并让算法定义与分析中的两个关键表达式成为这两个函数的二次形式。我们证明,这些二次形式是满足一组自然性质的唯一选择。此外,它们使我们能够利用强大的二次规划求解器来优化这两个函数的选择。

英文摘要:

We present a $0.659$-competitive Quadratic Ranking algorithm for the Oblivious Bipartite Matching problem, a distribution-free version of Query-Commit Matching. This result breaks the $1-\frac{1}{e}$ barrier, addressing an open question raised by Tang, Wu, and Zhang (JACM 2023). Moreover, the competitive ratio of this distribution-free algorithm improves the best existing $0.641$ ratio for Query-Commit Matching achieved by the distribution-dependent algorithm of Chen, Huang, Li, and Tang (SODA 2025). Quadratic Ranking is a novel variant of the classic Ranking algorithm. We parameterize the algorithm with two functions, and let two key expressions in the definition and analysis of the algorithm be quadratic forms of the two functions. We show that the quadratic forms are the unique choices that satisfy a set of natural properties. Further, they allow us to optimize the choice of the two functions using powerful quadratic programming solvers.

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

↑