Approximating the First-Come, First-Served Stochastic Matching Model with Ohm’s Law

2018 ◽  
Vol 66 (5) ◽  
pp. 1423-1432 ◽  
Author(s):  
Mohammad M. Fazel-Zarandi ◽  
Edward H. Kaplan
2016 ◽  
Vol 72 (7) ◽  
Author(s):  
Alexander Alexandrovich Antonov
Keyword(s):  

1975 ◽  
Vol 57 (S1) ◽  
pp. S38-S38
Author(s):  
W. M. Mills ◽  
J. D. Gilliom
Keyword(s):  

2021 ◽  
Vol 58 (2) ◽  
pp. 449-468
Author(s):  
Pascal Moyal ◽  
Ana Bušić ◽  
Jean Mairesse

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.


2021 ◽  
Author(s):  
Jinyun Tang ◽  
Jinyun Tang ◽  
William Riley ◽  
Gianna L Maschmann ◽  
Eoin L Brodie
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document