Article Dans Une Revue Queueing Systems Année : 2025

Insensitivity for Matching Systems

Résumé

Abstract We study matching queues motivated by applications in ride-sharing platforms, where items (e.g., drivers and riders) arrive over time and are matched based on a compatibility graph. Our model generalizes classical compatibility queueing models and queue-based ride-sharing models by allowing exogenous driver arrivals, queues for both drivers and riders, and arbitrary bipartite compatibility structures. We provide sufficient conditions under which the stationary distribution exhibits insensitivity to 1) service-time (drive-time) distributions and 2) the matching policies of drivers and riders, respectively. Using tools from Kelly networks and order-independent queues, we provide simple and unified proofs of insensitivity to service-time distributions and to matching policies for a broad class of models. Our policy insensitivity result requires a finite buffer; we demonstrate through counterexamples that such insensitivity may fail when the buffer is infinite. Our results also shed light on insensitivity in related redundancy systems, offering new insights into their stationary behavior.

Fichier principal
Vignette du fichier
s11134-025-09943-4.pdf (408.91 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Licence

Dates et versions

hal-05117107 , version 1 (07-05-2026)

Licence

Identifiants

Citer

Runhan Xie, Elene Anton, Kristen Gardner, Rhonda Righter. Insensitivity for Matching Systems. Queueing Systems, 2025, 109 (2), pp.15. ⟨10.1007/s11134-025-09943-4⟩. ⟨hal-05117107⟩
25 Consultations
0 Téléchargements

Altmetric

Partager

  • More