Online Matching with General Arrivals

04/17/2019
by   Buddhima Gamlath, et al.
0

The online matching problem was introduced by Karp, Vazirani and Vazirani nearly three decades ago. In that seminal work, they studied this problem in bipartite graphs with vertices arriving only on one side, and presented optimal deterministic and randomized algorithms for this setting. In comparison, more general arrival models, such as edge arrivals and general vertex arrivals, have proven more challenging and positive results are known only for various relaxations of the problem. In particular, even the basic question of whether randomization allows one to beat the trivially-optimal deterministic competitive ratio of 1/2 for either of these models was open. In this paper, we resolve this question for both these natural arrival models, and show the following. 1. For edge arrivals, randomization does not help --- no randomized algorithm is better than 1/2 competitive. 2. For general vertex arrivals, randomization helps --- there exists a randomized (1/2+Ω(1))-competitive online matching algorithm.

READ FULL TEXT
research
11/03/2020

Secretary Matching with General Arrivals

We provide online algorithms for secretary matching in general weighted ...
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/25/2020

Online Mincut: Advice, Randomization and More

In this paper we study the mincut problem on connected graphs in the onl...
research
09/05/2022

A negative dependence framework to assess different forms of scrambling

We use the framework of dependence to assess the benefits of scrambling ...
research
09/05/2022

Online B-Matchings for Reconfigurable Datacenters: The Power of Randomization

This paper studies the problem of how to dynamically optimize the topolo...
research
06/30/2022

Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities

We study the b-matching problem in bipartite graphs G=(S,R,E). Each vert...
research
03/11/2020

Online Graph Matching Problems with a Worst-Case Reassignment Budget

In the online bipartite matching with reassignments problem, an algorith...

Please sign up or login with your details

Forgot password? Click here to reset