Reward maximization in general dynamic matching systems
From MaRDI portal
Publication:2326234
DOI10.1007/s11134-018-9593-yzbMath1437.60070arXiv1608.01646OpenAlexW2569323557WikidataQ128958484 ScholiaQ128958484MaRDI QIDQ2326234
Mohammad Reza Nazari, Alexander L. Stolyar
Publication date: 7 October 2019
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.01646
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (6)
Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities ⋮ A general stochastic matching model on multigraphs ⋮ Stability regions of systems with compatibilities and ubiquitous measures on graphs ⋮ A product form for the general stochastic matching model ⋮ A stochastic matching model on hypergraphs ⋮ On the Optimal Design of a Bipartite Matching Queueing System
Cites Work
- Unnamed Item
- Unnamed Item
- Greedy primal-dual algorithm for dynamic resource allocation in complex networks
- Control of systems with flexible multi-server pools: a shadow routing approach
- Optimal control of a high-volume assemble-to-order system with maximum leadtime quotation and expediting
- Stabilizing policies for probabilistic matching systems
- Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
- Stability of the Bipartite Matching Model
- Bayesian Mechanism Design
- Exact FCFS Matching Rates for Two Infinite Multitype Sequences
- Stability of the stochastic matching model
- Fcfs infinite bipartite matching of servers and customers
- Reversibility and Further Properties of FCFS Infinite Bipartite Matching
- The Double-Ended Queue with Bulk Service and Limited Waiting Space
This page was built for publication: Reward maximization in general dynamic matching systems
