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

推荐订阅源

F
Fortinet All Blogs
小众软件
小众软件
大猫的无限游戏
大猫的无限游戏
B
Blog RSS Feed
WordPress大学
WordPress大学
A
About on SuperTechFans
Apple Machine Learning Research
Apple Machine Learning Research
博客园 - 司徒正美
I
InfoQ
MyScale Blog
MyScale Blog
量子位
博客园 - 【当耐特】
M
MIT News - Artificial intelligence
H
Hackread – Cybersecurity News, Data Breaches, AI and More
博客园 - 三生石上(FineUI控件)
博客园 - 聂微东
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
博客园 - 叶小钗
J
Java Code Geeks
L
LangChain Blog
T
The Blog of Author Tim Ferriss
有赞技术团队
有赞技术团队
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
阮一峰的网络日志
阮一峰的网络日志

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
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 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)