Non zero-sum stochastic games in admission, service and routing control in queueing systems
DOI10.1007/BF01206560zbMATH Open0877.90097MaRDI QIDQ1362315FDOQ1362315
Authors: Eitan Altman 
Publication date: 3 August 1997
Published in: Queueing Systems (Search for Journal in Brave)
Recommendations
admission controlrouting controlservice controlnon-zero sum stochastic gamenon-cooperative dynamic control of queueing systems
Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Stochastic games, stochastic differential games (91A15)
Cites Work
- The Regulation of Queue Size by Levying Tolls
- Algorithms for stochastic games ? A survey
- Optimal Operating Policies for M/G/1 Queuing Systems
- A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
- Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces
- Preemptive innovation
- Title not available (Why is that?)
- On N-person stochastic games by denumerable state space
- Constrained admission control to a queueing system
- On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing Process
- Optimal control of service rates in networks of queues
- Equilibrium strategies and the value of information in a two line queueing system with threshold jockeying
- Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs
- Stable priority purchasing in queues
- Approximations in Dynamic Zero-Sum Games I
- Stochastic scheduling games with Markov decision arrival processes
- The Hawk–Dove game as an average-cost problem
- Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs
- \(S\)-modular games, with queueing applications
- Priority queues
- Zero-sum Markov games and worst-case optimal control of queueing systems
- On the optimality of (s, S)-strategies in a minimax inventory model with average cost criterion
- Contraction Conditions for Average and α-Discount Optimality in Countable State Markov Games with Unbounded Rewards
- Socially and Individually Optimal Control of Arrivals to a GI/M/1 Queue
- Title not available (Why is that?)
- Flow control using the theory of zero sum Markov games
- Stable strategies for processor sharing systems
- Sensitive Optimality Criteria in Countable State Dynamic Programming
- Title not available (Why is that?)
Cited In (12)
- Decentralized admission control of a queueing system: A game-theoretic model
- A game theoretic framework for distributed computing with dynamic set of agents
- Title not available (Why is that?)
- Service rate control of closed Jackson networks from game theoretic perspective
- Optimal service‐capacity allocation in a loss system
- Self-organized criticality in a dynamic game
- Non-cooperative queueing games on a network of single server queues
- Zero-sum Markov games and worst-case optimal control of queueing systems
- A survey on networking games in telecommunications
- Incentive effects of multiple-server queueing networks: the principal-agent perspective
- Dynamic Admission Game into an M/M/1 Queue
- An overview for Markov decision processes in queues and networks
This page was built for publication: Non zero-sum stochastic games in admission, service and routing control in queueing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362315)
