Online minimum matching with uniform metric and random arrivals

12/09/2021
by   Sharmila Duppala, et al.
0

We consider Online Minimum Bipartite Matching under the uniform metric. We show that Randomized Greedy achieves a competitive ratio equal to (1+1/n) (H_n+1-1), which matches the lower bound. Comparing with the fact that RG achieves an optimal ratio of Θ(ln n) for the same problem but under the adversarial order, we find that the weaker arrival assumption of random order doesn't offer any extra algorithmic advantage for RG, or make the model strictly more tractable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2018

Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line

In the online metric bipartite matching problem, we are given a set S of...
research
04/20/2018

Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals

We introduce a weighted version of the ranking algorithm by Karp et al. ...
research
06/23/2023

Improved Competitive Ratios for Online Bipartite Matching on Degree Bounded Graphs

We consider the online bipartite matching problem on (k,d)-bounded graph...
research
04/19/2019

Stochastic Online Metric Matching

We study the minimum-cost metric perfect matching problem under online i...
research
10/06/2022

The Power of Greedy for Online Minimum Cost Matching on the Line

We consider the online minimum cost matching problem on the line, in whi...
research
06/13/2023

Online Matching in Geometric Random Graphs

In online advertisement, ad campaigns are sequentially displayed to user...
research
09/15/2022

Exploring the Tradeoff between Competitive Ratio and Variance in Online-Matching Markets

In this paper, we propose an online-matching-based model to study the as...

Please sign up or login with your details

Forgot password? Click here to reset