On the sub-additivity of stochastic matching
Probability
2023-05-09 v2
Abstract
We consider a stochastic matching model with a general compatibility graph, as introduced in \cite{MaiMoy16}. We prove that most common matching policies (including FCFM, priorities and random) satisfy a particular sub-additive property, which we exploit to show in many cases, the coupling-from-the-past to the steady state, using a backwards scheme {\em \`a la} Loynes. We then use these results to explicitly construct perfect bi-infinite matchings, and to build a perfect simulation algorithm in the case where the buffer of the system is finite.
Keywords
Cite
@article{arxiv.2305.00187,
title = {On the sub-additivity of stochastic matching},
author = {Pascal Moyal and Ana Busic and Jean Mairesse},
journal= {arXiv preprint arXiv:2305.00187},
year = {2023}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1711.02620