Stabilizing policies for probabilistic matching systems
From MaRDI portal
Publication:2352994
DOI10.1007/s11134-015-9433-2zbMath1319.60173OpenAlexW2003957400MaRDI QIDQ2352994
Publication date: 7 July 2015
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/24495186/Buke_Chen_SPPMS.pdf
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of continuous-time Markov processes on discrete state spaces (60J28)
Related Items (8)
Double-ended queues with non-Poisson inputs and their effective algorithms ⋮ Fluid and diffusion approximations of probabilistic matching systems ⋮ Fluid Models of Parallel Service Systems Under FCFS ⋮ A general stochastic matching model on multigraphs ⋮ Stability regions of systems with compatibilities and ubiquitous measures on graphs ⋮ Reward maximization in general dynamic matching systems ⋮ A product form for the general stochastic matching model ⋮ A stochastic matching model on hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Sample-path analysis of queueing systems
- Stability of the Bipartite Matching Model
- Exact FCFS Matching Rates for Two Infinite Multitype Sequences
- Probability and Stochastics
- Diffusion Models for Double-ended Queues with Renewal Arrival Processes
- Topics in the Constructive Theory of Countable Markov Chains
- Fcfs infinite bipartite matching of servers and customers
- Queues with paired customers
- Applied Probability and Queues
- Assembly-like queues
- The Double-Ended Queue with Bulk Service and Limited Waiting Space
This page was built for publication: Stabilizing policies for probabilistic matching systems