Abstract
AbstractWe consider a stochastic matching model with a general compatibility graph, as introduced by Mairesse and Moyal (2016). We show that the natural necessary condition of stability of the system is also sufficient for the natural ‘first-come, first-matched’ matching policy. To do so, we derive the stationary distribution under a remarkable product form, by using an original dynamic reversibility property related to that of Adan, Bušić, Mairesse, and Weiss (2018) for the bipartite matching model.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference21 articles.
1. [20] Rahmé, Y. and Moyal, P. (2019). A stochastic matching model on hypergraphs. Preprint, arXiv:math.PR/1907.12711.
2. Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
3. A NEW LOOK AT ORGAN TRANSPLANTATION MODELS AND DOUBLE MATCHING QUEUES
4. Stabilizing policies for probabilistic matching systems
5. [18] Moyal, P. , Bušić, A. and Mairesse, J. (2018). Loynes construction for the extended bipartite matching. Preprint, arXiv:math.PR/1803.02788.
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献