Answers are grounded in this paper and cite their sources.
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 .
No takes yet. Share an insight, caveat, or question.
Birnbaum et al. (2008) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: