 
Summary: Online Bipartite Matching Made Simple
Benjamin Birnbaum
Claire Mathieu
Abstract
We examine the classic online bipartite matching problem studied by Karp, Vazirani, and
Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for this
problem achieves a competitive ratio of 1  1/e.
Introduction
Introduced in 1990 by Karp, Vazirani, and Vazirani [8], online bipartite matching was one of the
first problems to receive the attention of competitive analysis. The input to the problem is a
bipartite graph G = (U, V, E), in which the vertices in U arrive in an online fashion and the edges
incident to each vertex u U are revealed when u arrives. When this happens, the algorithm may
match u to a previously unmatched adjacent vertex in V , if there is one. Such a decision, once
made, is irrevocable. The objective is to maximize the size of the resulting matching.
In their paper, Karp et al. first show that the competitiveness of the problem is trivial in
the deterministic case. Any algorithm that always matches a vertex in U if a match is possible
constructs a maximal matching, and therefore such an algorithm has a competitive ratio of 1/2.
On the other hand, given any deterministic algorithm, it is easy to construct an input (in which
each vertex u U has one or two neighbors in V ) that forces that algorithm to find a matching of
size no greater than half of the optimum.
