Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish Routing in Capacitated Networks
Mathematics of Operations Research
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
On the Impact of Combinatorial Structure on Congestion Games
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Strong equilibrium in cost sharing connection games
Proceedings of the 8th ACM conference on Electronic commerce
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms (TALG)
Fast and compact: a simple class of congestion games
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Stackelberg strategies for atomic congestion games
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Pure nash equilibria in player-specific and weighted congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
The equilibrium existence problem in finite network congestion games
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
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
Tight bounds for selfish and greedy load balancing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Performances of One-Round Walks in Linear Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
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
Game theoretical aspects in modeling and analyzing the shipping industry
ICCL'11 Proceedings of the Second international conference on Computational logistics
Hi-index | 0.00 |
We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best response dynamics and on the pure Price of Anarchy. In particular, we consider symmetric congestion games on extension-parallel networks, an interesting class of networks with linearly independent paths, and establish two remarkable properties previously known only for parallel-link games. More precisely, we show that for arbitrary non-negative and non-decreasing latency functions, any best improvement sequence converges to a pure Nash equilibrium in at most nsteps, and that for latency functions in class $\mathcal{D}$, the pure Price of Anarchy is at most $\rho(\mathcal{D})$.