Non-cooperative queueing games on a network of single server queues
From MaRDI portal
Publication:2052440
DOI10.1007/s11134-020-09681-9zbMath1478.91004OpenAlexW3121274853MaRDI QIDQ2052440
Judith Timmer, Richard J. Boucherie, Corine M. Laan
Publication date: 26 November 2021
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-020-09681-9
Noncooperative games (91A10) Games involving graphs (91A43) Queues and service in operations research (90B22) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items
Cites Work
- Unnamed Item
- Cost sharing of cooperating queues in a Jackson network
- Network topology and equilibrium existence in weighted network congestion games
- Network design with weighted players
- Pure Nash equilibria in player-specific and weighted congestion games
- To queue or not to queue: equilibrium behavior in queueing systems.
- An interdiction game on a queueing network with multiple intruders
- Congestion games with player-specific payoff functions
- A class of games possessing pure-strategy Nash equilibria
- A survey on networking games in telecommunications
- Non-cooperative games
- Restoring Pure Equilibria to Weighted Congestion Games
- On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games
- The Price of Stability for Network Design with Fair Cost Allocation
- Rational Queueing
- Optimal Design of Queueing Systems
- Individual versus Social Optimization in the Allocation of Customers to Alternative Servers
- Design of Cognitive Radio Systems Under Temperature-Interference Constraints: A Variational Inequality Approach
- Customer and Cost Sharing in a Jackson Network
- Algorithmic Game Theory
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- A paradox of congestion in a queuing network
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
- Game Theory
- Generalized Nash equilibrium problems
