PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES
From MaRDI portal
Publication:5358089
DOI10.1017/S0269964816000097zbMath1370.90084MaRDI QIDQ5358089
Publication date: 19 September 2017
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Communication networks in operations research (90B18) Applications of game theory (91A80) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Cites Work
- Unnamed Item
- Worst-case analysis of non-cooperative load balancing
- A survey on game theory applications in wireless networks
- EquiCast: scalable multicast with selfish users
- To queue or not to queue: equilibrium behavior in queueing systems.
- Potential games
- Sensible decisions based on QoS
- The price of anarchy in an exponential multi-server
- A survey on networking games in telecommunications
- A mathematical model for the TCP tragedy of the commons
- Selfish Traffic Allocation for Server Farms
- The Impact of Oligopolistic Competition in Networks
- Capacity allocation under noncooperative routing
- Penalty-Regulated Dynamics and Robust Learning Procedures in Games
- Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies
- Random Neural Networks with Synchronized Interactions
- Individual versus Social Optimization in the Allocation of Customers to Alternative Servers
- Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Algorithmic Game Theory
- The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Routing into two parallel links: Game-theoretic distributed algorithms
