A general stochastic matching model on multigraphs

zbMath1472.05123arXiv2011.05169MaRDI QIDQ5009806

Pascal Moyal, Irène Marcovici, Jocelyn Begeot, Youssef Rahme

Publication date: 6 August 2021

Full work available at URL: https://arxiv.org/abs/2011.05169

zbMATH Keywords

stabilitystochastic processesmatchingmultigraphsMarkovian queueing theory

Mathematics Subject Classification ID

Hypergraphs (05C65) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Structural characterization of families of graphs (05C75)

Related Items (2)

Stability regions of systems with compatibilities and ubiquitous measures on graphs ⋮ Stochastic non-bipartite matching models and order-independent loss queues

Cites Work

• Unnamed Item
• On the instability of matching queues
• Reward maximization in general dynamic matching systems
• Stabilizing policies for probabilistic matching systems
• Fluid and diffusion approximations of probabilistic matching systems
• Stability of the Bipartite Matching Model
• Exact FCFS Matching Rates for Two Infinite Multitype Sequences
• A skill based parallel service system under FCFS-ALIS — steady state, overloads, and abandonments
• 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
• A product form for the general stochastic matching model
• Markov Chains
• Reversibility and Further Properties of FCFS Infinite Bipartite Matching

This page was built for publication: A general stochastic matching model on multigraphs