Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays

Yossi Azar, Ashish Chiplunkar, Haim Kaplan

We consider the problem of online Min-cost Perfect Matching with Delays (MPMD) recently introduced by Emek et al, (STOC 2016). This problem is defined on an underlying $n$-point me…