惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

IT之家
IT之家
U
Unit 42
大猫的无限游戏
大猫的无限游戏
H
Help Net Security
G
Google Developers Blog
Recent Announcements
Recent Announcements
B
Blog RSS Feed
罗磊的独立博客
博客园 - Franky
J
Java Code Geeks
S
SegmentFault 最新的问题
D
DataBreaches.Net
C
Check Point Blog
Blog — PlanetScale
Blog — PlanetScale
T
The Blog of Author Tim Ferriss
有赞技术团队
有赞技术团队
腾讯CDC
博客园_首页
美团技术团队
V
Visual Studio Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
GbyAI
GbyAI
The Cloudflare Blog
aimingoo的专栏
aimingoo的专栏

math.PR updates on arXiv.org

Visibility in the Boolean Model on Harmonic Manifolds Global estimates on the Brenier map Geodesics and Wandering Exponents in Brochette First-Passage Percolation State-dependent inverse-subordinator time changes of regenerative processes: Excursion structure and multiscale occupation-time limits Randomly twisted transfer operators and singular values statistics Generalized Bessel-Dunkl diffusions An almost sure invariance principle for the Takagi-van der Waerden class functions Central limit theorems for high dimensional lattice polytopes: cosmological polytopes Convergence rate estimates for semigroups and heat kernels associated with resistance forms Second-order Poincaré inequalities and localization on the Poisson space Maximum Probability of Independence in Transitive Matroids On global solutions to the semidiscrete stochastic heat equation The Poisson Tail Conjecture for primes in short intervals A Complete Spectral Analysis of the CEV Operator with Applications to Arbitrage Holographic functions and neural networks From Betting to Empirical Bernstein LIL Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise Pointwise Generalization in Deep Neural Networks Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process A note on connections between the Föllmer process and the denoising diffusion probabilistic model Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights Propagation of Chaos in Contextual Flow Maps Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures $α$-TCAV: A Unified Framework for Testing with Concept Activation Vectors Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model On the Limits of Latent Reuse in Diffusion Models State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives
A Heavy Traffic Theory of Matching Queues
[Submitted on 20 Oct 2021 (v1), last revised 8 Jul 2026 (this ve · 2021-10-20 · via math.PR updates on arXiv.org

View PDF

Abstract:Motivated by emerging applications in online matching platforms and marketplaces, we study a matching queue. Customers and servers that arrive in a matching queue depart as soon as they are matched. While state-dependent control is an effective lever to regulate the throughput and delay, it often comes at a cost in practice for matching platforms. Optimizing this fundamental trade-off motivates the use of small amounts of control, so we study a matching queue in an asymptotic regime where the state-dependent control decreases to zero. Unlike the heavy traffic regime in classical queues, there are two different ways the control can be sent to zero, via a magnitude scaling parameter $\epsilon$ that goes to zero and a time scaling parameter $\tau$ that goes to infinity.
Depending on the cost of control, we show that the rates of $\epsilon$ and $\tau$ that optimize the trade-off between delay and cost of control could correspond to three different regimes. As we traverse these regimes, we observe a phase transition in the limiting distribution of the matching queue. We show that a low cost of control corresponds to the regime $\epsilon \tau \rightarrow 0$ and we call it the delay-driven regime. The limiting behavior in this regime is an asymmetrical Laplace distribution. On the other hand, $\epsilon \tau \rightarrow \infty$ is the cost-driven regime corresponding to a high cost of control where the limiting behavior is either a uniform or a truncated exponential distribution. We christen the in-between regime of $\epsilon\tau \rightarrow (0, \infty)$ the hybrid regime where the limiting behavior is a Gibbs distribution. These results are obtained by novel generalizations of the transform method, where each regime requires new ideas. The hybrid regime employs inverse Fourier transforms while the other two regimes engineer multiple complex exponential test functions.

Submission history

From: Sushil Mahavir Varma [view email]
[v1] Wed, 20 Oct 2021 05:07:00 UTC (115 KB)
[v2] Sat, 18 Jun 2022 23:03:44 UTC (139 KB)
[v3] Sun, 1 Dec 2024 21:27:56 UTC (141 KB)
[v4] Wed, 8 Jul 2026 06:13:47 UTC (154 KB)