Fluid and diffusion approximations of probabilistic matching systems
DOI10.1007/S11134-017-9516-3zbMATH Open1373.60151DBLPjournals/questa/BukeC17OpenAlexW1560439300WikidataQ59614504 ScholiaQ59614504MaRDI QIDQ2397917FDOQ2397917
Authors: Burak Büke, Hanyi Chen
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
Recommendations
- Stabilizing policies for probabilistic matching systems
- Stochastic non-bipartite matching models and order-independent loss queues
- Reward maximization in general dynamic matching systems
- Fluid models of parallel service systems under FCFS
- Fluid and diffusion models for a system of taxis and customers with delayed matching
Convergence of probability measures (60B10) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- Stochastic-Process Limits
- Queues with many servers and impatient customers
- Customer abandonment in many-server queues
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Double-Ended Queue with Bulk Service and Limited Waiting Space
- A diffusion approximation for a GI/GI/1 queue with balking or reneging
- Structure of large random hypergraphs
- A diffusion approximation for a Markovian queue with reneging
- Stability of the stochastic matching model
- Exact FCFS matching rates for two infinite multitype sequences
- Fcfs infinite bipartite matching of servers and customers
- Stability of the bipartite matching model
- Diffusion Models for Double-ended Queues with Renewal Arrival Processes
- Stabilizing policies for probabilistic matching systems
Cited In (13)
- Double-sided matching queues: priority and impatient customers
- Optimal pricing and service capacity management for a matching queue problem with loss-averse customers
- Matched queues with matching batch pair \((m, n)\)
- A product form for the general stochastic matching model
- A fluid approximation for a matching model with general reneging distributions
- Stability regions of systems with compatibilities and ubiquitous measures on graphs
- A time-non-homogeneous double-ended queue with failures and repairs and its continuous approximation
- A stochastic matching model on hypergraphs
- Double-ended queues with non-Poisson inputs and their effective algorithms
- Fluid Models of Parallel Service Systems Under FCFS
- A general stochastic matching model on multigraphs
- On spatial matchings: The first-in-first-match case
- Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities
This page was built for publication: Fluid and diffusion approximations of probabilistic matching systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397917)