跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.22923 · v1

A short proof of the 1-1/e performance of RANKING on the complete upper triangular instance

首次提交 2026-11-17 23:22
版本更新 2026-11-17 23:22
雷达观测 2026-11-18 16:38
arXiv ↗PDF ↗

摘要

The randomized online bipartite matching algorithm RANKING of Karp, Vazirani and Vazirani (1990) matches, asymptotically, a fraction 1−1/e1-1/e of the vertices of the complete upper triangular (CUT) instance. We give a short proof of this fact that looks at the final matching from the offline side. A single observation drives the argument: the first kk arrivals can distinguish the offline vertices vk,…,vnv_k,\ldots,v_n only through their ranks. As a consequence, whether vkv_k is matched is decided by a uniform draw among the remaining ranks, and the number of matched vertices among v1,…,vkv_1,\ldots,v_k is a Markov chain with explicit transition probabilities. A linear differential equation, solved by hand, gives the limiting profile of this chain, and the constant 1/e1/e appears where the matching probability reaches one.

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

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

观测到的版本

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

v1 · 2026-11-17 23:22 · 最新观测版本

A short proof of the 1-1/e performance of RANKING on the complete upper triangular instance

The randomized online bipartite matching algorithm RANKING of Karp, Vazirani and Vazirani (1990) matches, asymptotically, a fraction 1−1/e1-1/e of the vertices of the complete upper triangular (CUT) instance. We give a short proof of this fact that looks at the final matching from the offline side. A single observation drives the argument: the first kk arrivals can distinguish the offline vertices vk,…,vnv_k,\ldots,v_n only through their ranks. As a consequence, whether vkv_k is matched is decided by a uniform draw among the remaining ranks, and the number of matched vertices among v1,…,vkv_1,\ldots,v_k is a Markov chain with explicit transition probabilities. A linear differential equation, solved by hand, gives the limiting profile of this chain, and the constant 1/e1/e appears where the matching probability reaches one.

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