A product form and a sub-additive theorem for the general stochastic matching model

Pascal Moyal 1 Ana Bušic 2, 3 Jean Mairesse 4
2 DYOGENE - Dynamics of Geometric Networks
DI-ENS - Département d'informatique de l'École normale supérieure, CNRS - Centre National de la Recherche Scientifique : UMR 8548, Inria de Paris
4 APR - Algorithmes, Programmes et Résolution
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We consider a stochastic matching model with a general matching graph, as introduced in \cite{MaiMoy16}. We show that the natural necessary condition of stability of the system exhibited therein is also sufficient whenever the matching policy is First Come, First Matched (FCFM). For doing so, we exhibit a stationary distribution under a remarkable product form, by using an original dynamic reversibility inspired by that of \cite{ABMW17} for the bipartite matching model. Second, we observe that most common matching policies (including FCFM, priorities and random) satisfy a remarkable sub-additive property, which we exploit to derive in many cases, a coupling result to the steady state, using a constructive backwards scheme {\em \`a la} Loynes. We then use these results to explicitly construct perfect bi-infinite matchings.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

Contributor : Ana Busic <>
Submitted on : Monday, December 25, 2017 - 4:28:20 PM
Last modification on : Wednesday, May 15, 2019 - 3:35:43 AM


Files produced by the author(s)


  • HAL Id : hal-01672482, version 1
  • ARXIV : 1711.02620


Pascal Moyal, Ana Bušic, Jean Mairesse. A product form and a sub-additive theorem for the general stochastic matching model. 2017. ⟨hal-01672482⟩



Record views


Files downloads