June 27, 2017, 11 a.m.

Tuesday 11:00-12:00, room 310.

Abstract. We consider the problem of online Min-cost Perfect Matching with Delays (MPMD) introduced by Emek et al. (STOC 2016). In this problem, an even number of requests appear in a metric space at different times and the goal of an online algorithm is to match them in pairs. In contrast to traditional online matching problems, in MPMD all requests appear online and an algorithm can match any pair of requests, but such decision may be delayed (e.g., to find a better match). The cost is the sum of matching distances and the introduced delays. We present the first deterministic online algorithm for this problem. Its competitive ratio is O(m^(log_2(5.5))) = O(m^2.46), where 2m is the number of requests. In particular, the bound does not depend on other parameters of the metric, such as its aspect ratio. Unlike previous (randomized) solutions for the MPMD problem, our algorithm does not need to know the metric space in advance and it does not require the space to be finite.

Joint work with Marcin Bieńkowski and Paweł Schmidt, to appear at WAOA 2017.