2 papers
cs.DS2022
Online matching with delays and stochastic arrival times
Mathieu Mari, Michał Pawłowski, Runtian Ren +1
This paper presents a new research direction for the Min-cost Perfect Matching with Delays (MPMD) - a problem introduced by Emek et al. (STOC'16). In the original version of this p…
cs.DS2020
The Min-Cost Matching with Concave Delays Problem
Yossi Azar, Runtian Ren, Danny Vainstein
We consider the problem of online min-cost perfect matching with concave delays. We begin with the single location variant. Specifically, requests arrive in an online fashion at a…