Back to Search
Start Over
On the sub-additivity of stochastic matching.
- Source :
-
Queueing Systems . Sep2024, Vol. 107 Issue 3/4, p295-339. 45p. - Publication Year :
- 2024
-
Abstract
- We consider a stochastic matching model with a general compatibility graph, as introduced in Mairesse and Moyal (J Appl Probab 53(4):1064–1077, 2016). 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 à 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *MARKOV processes
*STOCHASTIC models
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 02570130
- Volume :
- 107
- Issue :
- 3/4
- Database :
- Academic Search Index
- Journal :
- Queueing Systems
- Publication Type :
- Academic Journal
- Accession number :
- 179067684
- Full Text :
- https://doi.org/10.1007/s11134-024-09919-w