A stochastic matching model on hypergraphs

DOI10.1017/apr.2021.8zbMath1479.05244arXiv1907.12711OpenAlexW3215471813MaRDI QIDQ5013243

Youssef Rahme, Pascal Moyal

Publication date: 29 November 2021

Published in: Advances in Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

stabilitymatchingMarkovian queueing theory

Mathematics Subject Classification ID

Hypergraphs (05C65) Queueing theory (aspects of probability theory) (60K25) 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)

Related Items (1)

Stability regions of systems with compatibilities and ubiquitous measures on graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the instability of matching queues
• A condition for matchability in hypergraphs
• 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
• Stability of the stochastic matching model
• A NEW LOOK AT ORGAN TRANSPLANTATION MODELS AND DOUBLE MATCHING QUEUES
• Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
• Fcfs infinite bipartite matching of servers and customers
• Markov Chains
• Topics in the Constructive Theory of Countable Markov Chains
• A product form for the general stochastic matching model
• Dynamic Matching for Real-Time Ride Sharing
• Reversibility and Further Properties of FCFS Infinite Bipartite Matching

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