Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
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 and the Price of Anarchy
Selfish Routing and the Price of Anarchy
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Tradeoffs in worst-case equilibria
Theoretical Computer Science - Approximation and online algorithms
Tight bounds for worst-case equilibria
ACM Transactions on Algorithms (TALG)
The price of anarchy for polynomial social cost
Theoretical Computer Science
Selfish Routing with Incomplete Information
Theory of Computing Systems
Regret minimization and the price of total anarchy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A new model for selfish routing
Theoretical Computer Science
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences
The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
Mathematics of Operations Research
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
The Impact of Oligopolistic Competition in Networks
Operations Research
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Theory of Computing Systems - Special Section: Algorithmic Game Theory; Guest Editors: Burkhard Monien and Ulf-Peter Schroeder
Total latency in singleton congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Computing Nash Equilibria for Scheduling on Restricted Parallel Links
Theory of Computing Systems
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
Selfish Traffic Allocation for Server Farms
SIAM Journal on Computing
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
Theory of Computing Systems
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 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
Local smoothness and the price of anarchy in atomic splittable congestion games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Intrinsic robustness of the price of anarchy
Communications of the ACM
The price of anarchy in games of incomplete information
Proceedings of the 13th ACM Conference on Electronic Commerce
Optimal Cost Sharing for Resource Selection Games
Mathematics of Operations Research
Price of stability in polynomial congestion games
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.02 |
We show exact values for the worst-case price of anarchy in weighted and unweighted (atomic unsplittable) congestion games, provided that all cost functions are bounded-degree polynomials with nonnegative coefficients. The given values also hold for weighted and unweighted network congestion games.