Dynamic spatial matching

DOI10.1214/25-AAP2154MaRDI QIDQ6907648zbMATH OpenFDO

Authors Yash Kanoria

Publication date 1 November 2025

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/25-AAP2154

zbMATH Keywords

dynamic arrivalslength scalesmatching algorithmsonline matching platformsspatial heterogeneity

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Analysis of algorithms (68W40) Stochastic network models in operations research (90B15)

Cites work

• A Poisson allocation of optimal tail
• A stable marriage of Poisson and Lebesgue
• Extra heads and invariant allocations
• Gravitational allocation for uniform points on the sphere
• Gravitational allocation to Poisson points
• Heavy-Traffic Limits for Queues with Many Exponential Servers
• Matching random samples in many dimensions
• On optimal matchings
• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
• The average-case analysis of some on-line algorithms for bin packing
• The theory and practice of revenue management
• Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
• Upper and lower bounds for stochastic processes. Decomposition theorems

This page was built for publication: Dynamic spatial matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907648)