← 研踪 PaperTrailarXiv: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
摘要
The randomized online bipartite matching algorithm RANKING of Karp, Vazirani and Vazirani (1990) matches, asymptotically, a fraction 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 arrivals can distinguish the offline vertices only through their ranks. As a consequence, whether is matched is decided by a uniform draw among the remaining ranks, and the number of matched vertices among 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 appears where the matching probability reaches one.
观测到的版本
相邻记录可能跳过中间版本;首次发现 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 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 arrivals can distinguish the offline vertices only through their ranks. As a consequence, whether is matched is decided by a uniform draw among the remaining ranks, and the number of matched vertices among 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 appears where the matching probability reaches one.
查看此版本解读 →查看此版本原文 ↗