Stability of the Bipartite Matching Model
From MaRDI portal
Publication:2837751
DOI10.1239/aap/1370870122zbMath1274.60228arXiv1003.3477OpenAlexW1979318710MaRDI QIDQ2837751
Ana Bušić, Varun Gupta, Jean Mairesse
Publication date: 11 July 2013
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.3477
Queueing theory (aspects of probability theory) (60K25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Flows in graphs (05C21)
Related Items (12)
Fluid and diffusion approximations of probabilistic matching systems ⋮ A general stochastic matching model on multigraphs ⋮ Stability regions of systems with compatibilities and ubiquitous measures on graphs ⋮ On the instability of matching queues ⋮ On spatial matchings: The first-in-first-match case ⋮ Reversibility and Further Properties of FCFS Infinite Bipartite Matching ⋮ Reward maximization in general dynamic matching systems ⋮ A product form for the general stochastic matching model ⋮ A stochastic matching model on hypergraphs ⋮ Stabilizing policies for probabilistic matching systems ⋮ Stochastic non-bipartite matching models and order-independent loss queues ⋮ On the Optimal Design of a Bipartite Matching Queueing System
Cites Work
- Unnamed Item
- A product form solution to a system with multi-type jobs and multi-type servers
- Non-negative matrices and Markov chains. 2nd ed
- Exact FCFS Matching Rates for Two Infinite Multitype Sequences
- Fcfs infinite bipartite matching of servers and customers
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Markov Chains
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
This page was built for publication: Stability of the Bipartite Matching Model
