A Primal-Dual Online Deterministic Algorithm for Matching with Delays
Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu, Pawe{\l}, Schmidt

TL;DR
This paper introduces a deterministic primal-dual online algorithm for the Min-cost Perfect Matching with Delays problem, achieving an improved competitive ratio and applicable to bipartite variants without prior knowledge of the metric space size.
Contribution
It presents a new O(m)-competitive deterministic algorithm that outperforms previous randomized solutions and works without prior metric space size knowledge.
Findings
Achieves an O(m)-competitive ratio, improving from O(m^2.46).
Handles bipartite matching variants with the same competitive ratio.
Does not depend on the size of the metric space or require prior knowledge.
Abstract
In the Min-cost Perfect Matching with Delays (MPMD) problem, 2 m requests arrive over time at points of a metric space. An online algorithm has to connect these requests in pairs, but a decision to match may be postponed till a more suitable matching pair is found. The goal is to minimize the joint cost of connection and the total waiting time of all requests. We present an O(m)-competitive deterministic algorithm for this problem, improving on an existing bound of O(m^(log(5.5))) = O(m^2.46). Our algorithm also solves (with the same competitive ratio) a bipartite variant of MPMD, where requests are either positive or negative and only requests with different polarities may be matched with each other. Unlike the existing randomized solutions, our approach does not depend on the size of the metric space and does not have to know it in advance.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
