Key points are not available for this paper at this time.
We examine the classic on-line 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 .
Birnbaum et al. (Sat,) studied this question.