Metraipolis › archive › dc_47df4a7544ac

A General Framework for Matching with Delays — arXiv:2610.21285

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.21285
License (as archived)
CC0-1.0
Archived
2026-10-16T10:40:20.203Z
SHA-256 of the archived text
fcc18cecde42437afbaca80585aecc4203112ec06ddf21cc3ad56877cb005dec
Stable URL of this page
https://metraipolis.com/documento/dc_47df4a7544ac

How to cite

A General Framework for Matching with Delays — arXiv:2610.21285 — arXiv (en), https://arxiv.org/abs/2610.21285 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_47df4a7544ac (Metraipolis archive dc_47df4a7544ac, sha256 fcc18cecde42437afbaca80585aecc4203112ec06ddf21cc3ad56877cb005dec)
BibTeX
@misc{dc47df4a7544ac,
  title = {A General Framework for Matching with Delays — arXiv:2610.21285},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.21285},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_47df4a7544ac; sha256 fcc18cecde42437afbaca80585aecc4203112ec06ddf21cc3ad56877cb005dec},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21285. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We present a simple deterministic $O(\log n)$-competitive algorithm for the online minimum-cost perfect matching with delays (MPMD) problem on arbitrary, unknown metric spaces, where $n$ is the (unknown) number of requests. This improves upon the recent $O(\log^5 n)$-competitive algorithm of Dufay and Wattenhofer (SODA 2026) and nearly matches the $\Omega(\log n / \log \log n)$ randomized lower bound of Ashlagi et al. (APPROX 2017). Our algorithmic framework rests on two ingredients: an online moat-growing process that grows active dual variables at a deliberately slowed constant rate $\alpha < 1$ to control temporal asymmetry, and a delayed eligibility rule that matches requests in the same dual component only after their waiting time is proportional to their time-expanded distance. The framework extends naturally to arbitrary concave delay functions, maintaining an $O(\log n)$ competitive ratio, and to $k$-way matching with delays, yielding an $O(k \log n)$-competitive deterministic algorithm.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.21285 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:53:17.669Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).