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…