Tighter bounds for online bipartite matching

12/31/2018
by   Uriel Feige, et al.
0

We study the online bipartite matching problem, introduced by Karp, Vazirani and Vazirani [1990]. For bipartite graphs with matchings of size n, it is known that the Ranking randomized algorithm matches at least (1 - 1/e)n edges in expectation. It is also known that no online algorithm matches more than (1 - 1/e)n + O(1) edges in expectation, when the input is chosen from a certain distribution that we refer to as D_n. This upper bound also applies to fractional matchings. We review the known proofs for this last statement. In passing we observe that the O(1) additive term (in the upper bound for fractional matching) is 1/2 - 1/2e + O(1/n), and that this term is tight: the online algorithm known as Balance indeed produces a fractional matching of this size. We provide a new proof that exactly characterizes the expected cardinality of the (integral) matching produced by Ranking when the input graph comes from the support of D_n. This expectation turns out to be (1 - 1/e)n + 1 - 2/e + O(1/n!), and serves as an upper bound on the performance ratio of any online (integral) matching algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2021

Online Matching with High Probability

We study the classical, randomized Ranking algorithm which is known to b...
research
10/18/2018

Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model

Huang et al. (STOC 2018) introduced the fully online matching problem, a...
research
05/13/2020

Fully Online Matching II: Beating Ranking and Water-filling

Karp, Vazirani, and Vazirani (STOC 1990) initiated the study of online b...
research
11/12/2020

Communication Efficient Coresets for Maximum Matching

In this paper we revisit the problem of constructing randomized composab...
research
10/19/2022

On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching

Ranking and Balance are arguably the two most important algorithms in th...
research
09/08/2018

Multitasking Capacity: Hardness Results and Improved Constructions

We consider the problem of determining the maximal α∈ (0,1] such that ev...
research
05/17/2020

Matching in Stochastically Evolving Graphs

This paper studies the maximum cardinality matching problem in stochasti...

Please sign up or login with your details

Forgot password? Click here to reset