Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2206.10287

Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets

Johannes Bäumler·Martin Bullinger·Stefan Kober·Donghao Zhu
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study a dynamic matching setting where homogeneous agents arrive at random according to a Poisson process and randomly form edges yielding a sparse market. Agents stay in the market according to a certain sojourn time and wait to be matched with a compatible agent by a matching algorithm. When their maximum sojourn time is reached, they perish unmatched. The primary objective is to maximize the number of matched agents. Our main result is to show that a uniformly guaranteed sojourn time suffices to get almost optimal performance of instantaneous matching. Interestingly, this matching policy essentially keeps as few agents in the market as possible. Hence, in contrast to the common paradigm that market thickness is the crucial property for obtaining strong matching performance, we show that the agents' sojourn behavior can be an equally powerful factor. In addition, instantaneous matching is close to optimal with respect to minimizing waiting time. We develop new techniques for proving our results going beyond commonly adopted methods for Markov processes.

Explore related subjects

cs.DSecon.TH

Keep this discovery

BibTeXRIS

Johannes Bäumler, Martin Bullinger, Stefan Kober, Donghao Zhu. 2022-06-21. Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets. https://arxiv.org/abs/2206.10287

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗
arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗