Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm

07/02/2021
by   Nathan Noiry, et al.
0

Motivated by sequential budgeted allocation problems, we investigate online matching problems where connections between vertices are not i.i.d., but they have fixed degree distributions – the so-called configuration model. We estimate the competitive ratio of the simplest algorithm, GREEDY, by approximating some relevant stochastic discrete processes by their continuous counterparts, that are solutions of an explicit system of partial differential equations. This technique gives precise bounds on the estimation errors, with arbitrarily high probability as the problem size increases. In particular, it allows the formal comparison between different configuration models. We also prove that, quite surprisingly, GREEDY can have better performance guarantees than RANKING, another celebrated algorithm for online matching that usually outperforms the former.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2021

Online Weighted Bipartite Matching with a Sample

We study the classical online bipartite matching problem: One side of th...
research
08/19/2023

Laminar Matroid Secretary: Greedy Strikes Back

We show that a simple greedy algorithm is 4.75 probability-competitive f...
research
09/09/2020

Adwords in a Panorama

Three decades ago, Karp, Vazirani, and Vazirani (STOC 1990) defined the ...
research
11/12/2019

Online Stochastic Matching with Edge Arrivals

Online bipartite matching with edge arrivals is an important extension o...
research
12/08/2021

Greedy Algorithm for Multiway Matching with Bounded Regret

In this paper we prove the efficacy of a simple greedy algorithm for a f...
research
09/30/2020

Sequential Algorithms and Independent Sets Discovering on Large Sparse Random Graphs

Computing the size of maximum independent sets is a NP-hard problem for ...
research
02/19/2019

Continuous Ordinary Differential Equations and Ordinal Time Turing Machines

We consider Continuous Ordinary Differential Equations (CODE) y'=f(y), w...

Please sign up or login with your details

Forgot password? Click here to reset