On the sub-additivity of stochastic matching - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2023

On the sub-additivity of stochastic matching

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.
Fichier principal
Vignette du fichier
MoyBusMai_Questa2.pdf (559.75 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04088419 , version 1 (04-05-2023)

Identifiers

Cite

Pascal Moyal, Ana Busic, Jean Mairesse. On the sub-additivity of stochastic matching. 2023. ⟨hal-04088419⟩
39 View
15 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More