跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.13571 · v1

Improved Bounds for Online Matching with Random Edge Arrivals

首次提交 2026-11-10 12:39
版本更新 2026-11-10 12:39
雷达观测 2026-11-11 11:04
arXiv ↗PDF ↗

摘要

We study the unweighted online matching problem with random edge arrivals, where each edge arrives at an independent time drawn uniformly from [0,1][0,1], and the algorithm must immediately and irrevocably accept or reject it while maintaining a matching. Guruganesh and Singla (IPCO, 2017) first broke the 1/21/2 barrier of the naive Greedy algorithm by giving a (1/2+ε)(1/2+\varepsilon)-competitive algorithm for a small constant ε>0\varepsilon>0, a guarantee that has remained the best known for nearly a decade. We give a simple three-phase algorithm that achieves a competitive ratio of 0.54450.5445 by deliberately rejecting selected early edges to reserve their endpoints for later matching opportunities. With a different choice of parameters, the same algorithm is 0.55350.5535-competitive on triangle-free graphs, including bipartite graphs. We also establish competitive ratio upper bounds below 0.69640.6964 for general graphs and 0.70430.7043 for bipartite graphs via exact rational evaluation of an optimal-policy recurrence on fixed graphs, even when the input graph is known up to isomorphism.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-10 12:39 · 最新观测版本

Improved Bounds for Online Matching with Random Edge Arrivals

We study the unweighted online matching problem with random edge arrivals, where each edge arrives at an independent time drawn uniformly from [0,1][0,1], and the algorithm must immediately and irrevocably accept or reject it while maintaining a matching. Guruganesh and Singla (IPCO, 2017) first broke the 1/21/2 barrier of the naive Greedy algorithm by giving a (1/2+ε)(1/2+\varepsilon)-competitive algorithm for a small constant ε>0\varepsilon>0, a guarantee that has remained the best known for nearly a decade. We give a simple three-phase algorithm that achieves a competitive ratio of 0.54450.5445 by deliberately rejecting selected early edges to reserve their endpoints for later matching opportunities. With a different choice of parameters, the same algorithm is 0.55350.5535-competitive on triangle-free graphs, including bipartite graphs. We also establish competitive ratio upper bounds below 0.69640.6964 for general graphs and 0.70430.7043 for bipartite graphs via exact rational evaluation of an optimal-policy recurrence on fixed graphs, even when the input graph is known up to isomorphism.

查看此版本解读 →查看此版本原文 ↗