Metraipolis › archive › dc_6c4ff749f4fc
Deterministic online matching under short augmenting paths and restricted vertex reassignments — arXiv:2609.19001
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19001
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T17:09:23.574Z
- SHA-256 of the archived text
e9f3b80d9af1cadb4a0b5abcac883144b7c22414da1d9cb397e9e73c427da1c8- Stable URL of this page
https://metraipolis.com/documento/dc_6c4ff749f4fc
How to cite
Deterministic online matching under short augmenting paths and restricted vertex reassignments — arXiv:2609.19001 — arXiv (en), https://arxiv.org/abs/2609.19001 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6c4ff749f4fc (Metraipolis archive dc_6c4ff749f4fc, sha256 e9f3b80d9af1cadb4a0b5abcac883144b7c22414da1d9cb397e9e73c427da1c8)
BibTeX
@misc{dc6c4ff749f4fc,
title = {Deterministic online matching under short augmenting paths and restricted vertex reassignments — arXiv:2609.19001},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19001},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6c4ff749f4fc; sha256 e9f3b80d9af1cadb4a0b5abcac883144b7c22414da1d9cb397e9e73c427da1c8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19001. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study deterministic online bipartite matching with local recourse. Online vertices arrive one by one and reveal edges to a fixed offline set. After each arrival, the algorithm maintains a matching and may update it only by an augmenting path of length $1$ or $3$ starting at the new vertex. In the budgeted model $\operatorname{OMP}_3(s,t)$, each offline vertex can be reassigned at most $s$ times and each online vertex at most $t$ times. Our main result is a deterministic algorithm, Lowest-Cost-Path ($\operatorname{LCP}$), that achieves the optimal competitive ratio for every choice of budgets. If $s=0$ or $t=0$, the best possible ratio is $1/2$. For every $s\ge 1$ and finite $t$, the optimal ratio is $$ \gamma_t=\frac{2\cdot 2^t-1}{3\cdot 2^t-1}. $$ This value equals $3/5$ for $t=1$ and converges to $2/3$ as $t$ increases. For $t=\infty$, the optimal ratio is exactly $2/3$. In particular, allowing a single reassignment per offline vertex already matches the best guarantee achievable with any larger offline budget. We also prove matching upper bounds for all deterministic algorithms. Our analysis is primal--dual and uses a structural description of the history graph of $\operatorname{LCP}$, which explains how exhausted reassignment budgets can block length-$3$ augmentations. We also study offline-weighted variants. In particular, we determine the exact optimal deterministic ratios for two unit-offline-budget cases: $2-\sqrt2$ for $\operatorname{WOMP}_3(1,1)$, and $(\sqrt5-1)/2$ for $\operatorname{WOMP}_3(1,\infty)$. Both are strictly below their unweighted counterparts. If weights are placed on online vertices instead, no deterministic algorithm has a positive competitive ratio.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.19001 — 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-15T16:17:15.274Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).