A Heavy Traffic Theory of Matching Queues
Sushil Mahavir Varma, Siva Theja Maguluri

TL;DR
This paper develops a heavy traffic theory for matching queues, revealing phase transitions in queue behavior depending on control cost and scaling parameters, with implications for online matching platforms.
Contribution
It introduces a novel asymptotic regime analysis for matching queues, identifying three distinct regimes and their limiting distributions based on control cost and scaling parameters.
Findings
Delay-driven regime with asymmetrical Laplace distribution
Cost-driven regime with uniform or truncated exponential distribution
Hybrid regime with Gibbs distribution
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 that goes to zero and a time scaling parameter that goes to infinity. Depending on the cost of control, we show that the rates of and that optimize the trade-off between…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Queuing Theory Analysis · Markov Chains and Monte Carlo Methods · Random Matrices and Applications
