Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
How unfair is optimal routing?
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computing Nash equilibria for scheduling on restricted parallel links
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
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 price of anarchy and stability of correlated equilibria of linear congestion games,,
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Symmetry in network congestion games: pure equilibria and anarchy cost
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
The price of anarchy for polynomial social cost
Theoretical Computer Science
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Malicious Bayesian Congestion Games
Approximation and Online Algorithms
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
Approximation and Online Algorithms
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Theoretical Computer Science
Strong and Pareto Price of Anarchy in Congestion Games
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Games with Congestion-Averse Utilities
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Covering Games: Approximation through Non-cooperation
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
The Impact of Social Ignorance on Weighted Congestion Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Stackelberg strategies for atomic congestion games
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Total latency in singleton congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On the existence of pure nash equilibria inweighted congestion games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Weighted congestion games: price of anarchy, universal worst-case examples, and tightness
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
The impact of altruism on the efficiency of atomic congestion games
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
On the inefficiency of equilibria in linear bottleneck congestion games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Routing (un-) splittable flow in games with player-specific affine latency functions
ACM Transactions on Algorithms (TALG)
Optimal cost sharing protocols for scheduling games
Proceedings of the 12th ACM conference on Electronic commerce
Good programming in transactional memory
Theoretical Computer Science
Restoring pure equilibria to weighted congestion games
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Exact Price of Anarchy for Polynomial Congestion Games
SIAM Journal on Computing
Price of anarchy for polynomial wardrop games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Local smoothness and the price of anarchy in atomic splittable congestion games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Efficiency analysis of load balancing games with and without activation costs
Journal of Scheduling
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Mathematics of Operations Research
On bidimensional congestion games
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
The price of anarchy for selfish ring routing is two
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
On a generalized Cournot oligopolistic competition game
Journal of Global Optimization
| Hi-index | 0.00 |
We show exact values for the price of anarchy of weighted and unweighted congestion games with polynomial latency functions. The given values also hold for weighted and unweighted network congestion games.