Online Weighted Matching: Breaking the $\frac{1}{2}$ Barrier (1704.05384v2)

Abstract: Online matching and its variants are some of the most fundamental problems in the online algorithms literature. In this paper, we study the online weighted bipartite matching problem. Karp et al. (STOC 1990) gave an elegant algorithm in the unweighted case that achieves a tight competitive ratio of $1-1/e$. In the weighted case, however, we can easily show that no competitive ratio is obtainable without the commonly accepted free disposal assumption. Under this assumption, it is not hard to prove that the greedy algorithm is $1/2$ competitive, and that this is tight for deterministic algorithms. We present the first randomized algorithm that breaks this long-standing $1/2$ barrier and achieves a competitive ratio of at least $0.501$. In light of the hardness result of Kapralov et al. (SODA 2013) that restricts beating a $1/2$ competitive ratio for the monotone submodular welfare maximization problem, our result can be seen as strong evidence that solving the weighted bipartite matching problem is strictly easier than submodular welfare maximization in the online setting. Our approach relies on a very controlled use of randomness, which allows our algorithm to safely make adaptive decisions based on its previous assignments.