Fluid and diffusion approximations of probabilistic matching systems
From MaRDI portal
Publication:2397917
DOI10.1007/s11134-017-9516-3zbMath1373.60151DBLPjournals/questa/BukeC17OpenAlexW1560439300WikidataQ59614504 ScholiaQ59614504MaRDI QIDQ2397917
Publication date: 14 August 2017
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-017-9516-3
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Convergence of probability measures (60B10)
Related Items (11)
Double-ended queues with non-Poisson inputs and their effective algorithms ⋮ Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities ⋮ Fluid Models of Parallel Service Systems Under FCFS ⋮ A general stochastic matching model on multigraphs ⋮ A time-non-homogeneous double-ended queue with failures and repairs and its continuous approximation ⋮ Stability regions of systems with compatibilities and ubiquitous measures on graphs ⋮ On spatial matchings: The first-in-first-match case ⋮ Double-sided matching queues: priority and impatient customers ⋮ A product form for the general stochastic matching model ⋮ A stochastic matching model on hypergraphs ⋮ Optimal pricing and service capacity management for a matching queue problem with loss-averse customers
Cites Work
- Structure of large random hypergraphs
- A diffusion approximation for a Markovian queue with reneging
- Stabilizing policies for probabilistic matching systems
- A diffusion approximation for a GI/GI/1 queue with balking or reneging
- Stochastic-Process Limits
- Stability of the Bipartite Matching Model
- Queues with Many Servers and Impatient Customers
- Exact FCFS Matching Rates for Two Infinite Multitype Sequences
- Stability of the stochastic matching model
- Customer Abandonment in Many-Server Queues
- Diffusion Models for Double-ended Queues with Renewal Arrival Processes
- Fcfs infinite bipartite matching of servers and customers
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- The Double-Ended Queue with Bulk Service and Limited Waiting Space
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fluid and diffusion approximations of probabilistic matching systems