Stochastic matching with few queries: (1-ε) approximation

2020 ◽  
Author(s):  
Soheil Behnezhad ◽  
Mahsa Derakhshan ◽  
MohammadTaghi Hajiaghayi
Keyword(s):  
Stochastic Matching

scholarly journals A product form for the general stochastic matching model

2021 ◽  
Vol 58 (2) ◽  
pp. 449-468
Author(s):  
Pascal Moyal ◽  
Ana Bušić ◽  
Jean Mairesse
Keyword(s):  
Stationary Distribution ◽  
Product Form ◽  
Necessary Condition ◽  
Matching Model ◽  
Bipartite Matching ◽  
Compatibility Graph ◽  
Stochastic Matching ◽  
Dynamic Reversibility ◽  
Original Dynamic ◽  
Do So

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.

scholarly journals A general stochastic matching model on multigraphs

2021 ◽  
Vol 18 (1) ◽  
pp. 1325
Author(s):  
Jocelyn Begeot ◽  
Irène Marcovici ◽  
Pascal Moyal ◽  
Youssef Rahme
Keyword(s):  
Matching Model ◽  
Stochastic Matching ◽  
General Stochastic

Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts

Algorithmica ◽  
2019 ◽  
Vol 82 (1) ◽  
pp. 64-87 ◽  
Author(s):  
Brian Brubach ◽  
Karthik A. Sankararaman ◽  
Aravind Srinivasan ◽  
Pan Xu
Keyword(s):  
Stochastic Matching

scholarly journals Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation

2010 ◽  
Vol 205 (1) ◽  
pp. 19-30 ◽  
Author(s):  
Bruno Escoffier ◽  
Laurent Gourvès ◽  
Jérôme Monnot ◽  
Olivier Spanjaard
Keyword(s):  
Spanning Tree ◽  
Two Stage ◽  
Stochastic Matching
Sign in / Sign up

Export Citation Format

Share Document