STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
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 maximum latency of selfish routing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing Nash equilibria for scheduling on restricted parallel links
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish load balancing and atomic congestion games
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
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
Computing correlated equilibria in multi-player games
Proceedings of the thirty-seventh 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
Computing equilibria in multi-player games
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
ACM SIGACT News
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Network design with weighted players
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
The price of anarchy for polynomial social cost
Theoretical Computer Science
Taxes for linear atomic congestion games
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Regret minimization and the price of total anarchy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graphical congestion games with linear latencies
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
A few good agents: multi-agent social learning
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Approximate Strong Equilibrium in Job Scheduling Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Interference Games in Wireless Networks
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Theoretical Computer Science
Journal of Artificial Intelligence Research
Anarchy, Stability, and Utopia: Creating Better Matchings
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Price of Stability in Survivable Network Design
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Performances of One-Round Walks in Linear Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
The Impact of Social Ignorance on Weighted Congestion Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Mediated Equilibria in Load-Balancing Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Approximate strong equilibrium in job scheduling games
Journal of Artificial Intelligence Research
Non-cooperative facility location and covering games
Theoretical Computer Science
On the performance of congestion games for optimum satisfiability problems
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Total latency in singleton congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Taxes for linear atomic congestion games
ACM Transactions on Algorithms (TALG)
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
Improved lower bounds on the price of stability of undirected network design games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
The limits of smoothness: a primal-dual framework for price of anarchy bounds
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Social context congestion games
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Exact Price of Anarchy for Polynomial Congestion Games
SIAM Journal on Computing
Selfish service installation in networks
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Exact price of anarchy for polynomial congestion games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Convergence and approximation in potential games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Tight bounds for selfish and greedy load balancing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the price of stability for designing undirected networks with fair cost allocations
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the price of stability for undirected network design
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Intrinsic robustness of the price of anarchy
Communications of the ACM
Convergence and approximation in potential games
Theoretical Computer Science
The price of anarchy in games of incomplete information
Proceedings of the 13th ACM Conference on Electronic Commerce
On bidimensional congestion games
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
On a noncooperative model for wavelength assignment in multifiber optical networks
IEEE/ACM Transactions on Networking (TON)
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
Social context congestion games
Theoretical Computer Science
Hi-index | 0.02 |
We consider the price of stability for Nash and correlated equilibria of linear congestion games. The price of stability is the optimistic price of anarchy, the ratio of the cost of the best Nash or correlated equilibrium over the social optimum. We show that for the sum social cost, which corresponds to the average cost of the players, every linear congestion game has Nash and correlated price of stability at most 1.6. We also give an almost matching lower bound of $1+\sqrt{3}/3=1.577$. We also consider the price of anarchy of correlated equilibria. We extend existing results about Nash equilibria to correlated equilibria and show that for the sum social cost, the price of anarchy is exactly 2.5, the same for pure and mixed Nash and for correlated equilibria. The same bound holds for symmetric games as well. We also extend the results about Nash equilibria to correlated equilibria for weighted congestion games and we show that when the social cost is the total latency, the price of anarchy is $(3+\sqrt{5})/2=2.618$.