Mittagsseminar (by J. Lengler, K. Bringmann, B. Gärtner, M. Hoffmann, R. Kyng, D.Steurer, V. Traub)

Date and Time: Tuesday, December 09, 2025, 12:15 pm

Duration: 30 minutes

Location: OAT S15

Speaker: Marc Dufay

An Improved Deterministic Algorithm For Online Matching With Delays

In the online Min-cost Perfect Matching with Delays (MPMD) problem, m requests in a metric space are submitted at different times by an adversary. The goal is to match all requests while (i) minimizing the sum of the distances between matched pairs as well as (ii) how long each request remained unmatched after it appeared.

While there exist almost optimal algorithms when the metric space is finite and known a priori, this is not the case when the metric space is infinite or unknown. In this latter case, the best known algorithm, due to Azar and Jacob-Fanani, has competitiveness O(m^0.59) which is exponentially worse than the best known lower bound of Ω(log m / log log m) by Ashlagi et al.

We present a O(log⁵ m)-competitive algorithm for the MPMD problem. This algorithm is deterministic and does not need to know the metric space or m in advance. This is an exponential improvement over previous results and only a polylogarithmic factor away from the lower bound.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2026  2025  2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login