Longest-Queue Policies in Dynamic Matching with Abandonments
math.OC, econ.TH, math.PR
Submitted: 2026-11-01
Updated: 2026-11-01
Comments: 39 pages, 4 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence
- Dynamic control of stochastic matching systems in heavy traffic: An effective computational method for high-dimensional problems
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise