log in  |  register  |  feedback?  |  help  |  web accessibility
Online Matching with General Arrivals
Friday, November 8, 2019, 1:00-2:00 pm Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
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+Omega(1))-competitive online matching algorithm.
Based on joint work with Buddhima Gamlath, Michael Kapralov, Andreas Maggiori and Ola Svensson at EPFL, to appear in FOCS 2019. A preprint can be found here: http://www.cs.cmu.edu/~dwajc/pdfs/gamlath19.pdf
This talk is organized by Ahmed Abdelkader