On the sub-additivity of stochastic matching
From MaRDI portal
Publication:6623437
DOI10.1007/s11134-024-09919-wMaRDI QIDQ6623437
Jean Mairesse, Pascal Moyal, Ana Bušić
Publication date: 24 October 2024
Published in: Queueing Systems (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two ergodicity criteria for stochastically recursive sequences
- On the instability of matching queues
- Perfect sampling using bounding chains.
- Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
- Reward maximization in general dynamic matching systems
- Stability of the Bipartite Matching Model
- Exact FCFS Matching Rates for Two Infinite Multitype Sequences
- Stability of the stochastic matching model
- A NEW LOOK AT ORGAN TRANSPLANTATION MODELS AND DOUBLE MATCHING QUEUES
- Fcfs infinite bipartite matching of servers and customers
- Some Relations Between Nonexpansive and Order Preserving Mappings
- Exact Sampling from a Continuous State Space
- Perfect simulation and backward coupling∗
- Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- How to couple from the past using a read-once source of randomness
- A product form for the general stochastic matching model
- A general stochastic matching model on multigraphs
- A stochastic matching model on hypergraphs
- Stochastic non-bipartite matching models and order-independent loss queues
- Reversibility and Further Properties of FCFS Infinite Bipartite Matching
- Stability regions of systems with compatibilities and ubiquitous measures on graphs
- Generalized Max-Weight Policies in Stochastic Matching
This page was built for publication: On the sub-additivity of stochastic matching
