Online Matching with High Probability
Abstract
We study the classical, randomized Ranking algorithm which is known to be (1 - 1e)-competitive in expectation for the Online Bipartite Matching Problem. We give a tail inequality bound, namely that Ranking is (1 - 1e - α)-competitive with probability at least 1 - e-2 α2 n where n is the size of the maximum matching in the instance. Building on this, we show similar concentration results for the Fully Online Matching Problem and for the Online Vertex-Weighted Bipartite Matching Problem.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.