Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The complexity of pure Nash equilibria
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
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Inapproximability of pure nash equilibria
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
The Speed of Convergence in Congestion Games under Best-Response Dynamics
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
On the impact of combinatorial structure on congestion games
Journal of the ACM (JACM)
Pure Nash equilibria in player-specific and weighted congestion games
Theoretical Computer Science
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
On the existence of pure nash equilibria inweighted congestion games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Proceedings of the 13th ACM Conference on Electronic Commerce
| Hi-index | 0.00 |
We investigate the speed of convergence of best response dynamics to approximately optimal solutions in weighted congestion games with polynomial delay functions. In [1] it has been shown that the convergence time of such dynamics to Nash equilibrium may be exponential in the number of players n even for unweighted players and linear delay functions. Nevertheless, extending the work of [11], we show that 驴(n loglog W) (where W is the sum of all the players' weights) best responses are necessary and sufficient to achieve states that approximate the optimal solution by a constant factor, under the assumption that every O(n) steps each player performs a constant (and non-null) number of best responses.