STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms
Journal of the ACM (JACM)
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Selfish routing with incomplete information
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Exact price of anarchy for polynomial congestion games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
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
On the inefficiency of equilibria in congestion games
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Routing (un-) splittable flow in games with player-specific linear latency functions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Network games with atomic players
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Routing (un-) splittable flow in games with player-specific affine latency functions
ACM Transactions on Algorithms (TALG)
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
SIAM Journal on Discrete Mathematics
On a generalized Cournot oligopolistic competition game
Journal of Global Optimization
Hi-index | 0.00 |
In this work, we consider Wardrop games where traffic has to be routed through a shared network. Traffic is allowed to be split into arbitrary pieces and can be modeled as network flow. For each edge in the network there is a latency function that specifies the time needed to traverse the edge given its congestion. In a Wardrop equilibrium, all used paths between a given source-destination pair have equal and minimal latency. In this paper, we allow for polynomial latency functions with an upper bound d and a lower bound s on the degree of all monomials that appear in the polynomials. For this environment, we prove upper and lower bounds on the price of anarchy.