Mean-field game approach to admission control of an M/M/ queue with shared service cost
DOI10.1007/S13235-015-0168-9zbMATH Open1391.91033OpenAlexW2154535170WikidataQ59471367 ScholiaQ59471367MaRDI QIDQ2013315FDOQ2013315
Authors: Eitan Altman, Arnob Ghosh, Piotr Więcek
Publication date: 17 August 2017
Published in: Dynamic Games and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13235-015-0168-9
Recommendations
- Dynamic Admission Game into an M/M/1 Queue
- Rate control under heavy traffic with strategic servers
- Admission control to an M/M/1 queue with partial information
- Mean field stochastic games: monotone costs and threshold policies
- A numerical scheme for a mean field game in some queueing systems based on Markov chain approximation method
Semidefinite programming (90C22) Queueing theory (aspects of probability theory) (60K25) Stochastic games, stochastic differential games (91A15)
Cites Work
- Worst-case equilibria
- The Regulation of Queue Size by Levying Tolls
- Optimal control of admission to a quenching system
- The Price of Stability for Network Design with Fair Cost Allocation
- Title not available (Why is that?)
- On Quasi-Stationary distributions in absorbing discrete-time finite Markov chains
- Title not available (Why is that?)
- Robust game theory
- Constrained admission control to a queueing system
- On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing Process
- Optimal decentralized flow control of Markovian queueing networks with multiple controllers
- Individual equilibrium and learning in processor sharing systems
- On the existence of equilibria in noncooperative optimal flow control
- Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs
- Admission control in stochastic event graphs
- Admission control to an M/M/1 queue with partial information
- Title not available (Why is that?)
Cited In (6)
- Admission control to an M/M/1 queue with partial information
- Approximations for a queueing game model with join-the-shortest-queue strategy
- Inefficiency in stochastic queueing systems with strategic customers
- Dynamic Admission Game into an M/M/1 Queue
- Total reward semi-Markov mean-field games with complementarity properties
- Rate control under heavy traffic with strategic servers
This page was built for publication: Mean-field game approach to admission control of an \(M/M/\infty \) queue with shared service cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013315)