Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
Data networks
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Journal of the ACM (JACM)
Selfish traffic allocation for server farms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computer Networks and Systems: Queueing Theory and Performance Evaluation
Computer Networks and Systems: Queueing Theory and Performance Evaluation
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
The maximum latency of selfish routing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Bottleneck links, variable demand, and the tragedy of the commons
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Atomic routing games on maximum congestion
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Nash equilibria, the price of anarchy and the fully mixed nash equilibrium conjecture
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Atomic routing games on maximum congestion
Theoretical Computer Science
Routing games for traffic engineering
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Computing pure Nash and strong equilibria in bottleneck congestion games
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
On the hardness of network design for bottleneck routing games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
On the hardness of network design for bottleneck routing games
Theoretical Computer Science
Hi-index | 0.00 |
We look at the scenario of having to route a continuous rate of traffic from a source node to a sink node in a network, where the objective is to maximize throughput. This is of interest, e.g., for providers of streaming content in communication networks. The overall path latency, which was relevant in other non-cooperative network routing games such as the classic Wardrop model, is of lesser concern here. To that end, we define bottleneck games with splittable traffic where the throughput on a path is inversely proportional to the maximum latency of an edge on that very path—the bottleneck latency. Therefore, we define a Wardrop equilibrium as a traffic distribution where this bottleneck latency is at minimum on all used paths. As a measure for the overall system well-being—called social cost—we take the weighted sum of the bottleneck latencies of all paths. Our main findings are as follows: First, we prove social cost of Wardrop equilibria on series parallel graphs to be unique. Even more, for any graph whose subgraph induced by all simple start-destination paths is not series parallel, there exist games having equilibria with different social cost. For the price of stability, we give an independence result with regard to the network topology. Finally, our main result is giving a new exact price of stability for Wardrop/bottleneck games on parallel links with M/M/1 latency functions. This result is at the same time the exact price of stability for bottleneck games on general graphs.