Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Journal of the ACM (JACM)
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Convex Optimization
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
Network uncertainty in selfish routing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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
Network games with atomic players
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Taxes for linear atomic congestion games
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Subjective vs. Objective Reality -- The Risk of Running Late
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Pure Nash equilibria in player-specific and weighted congestion games
Theoretical Computer Science
Theoretical Computer Science
Characterizing the Existence of Potential Functions in Weighted Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Total latency in singleton congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Weighted Boolean formula 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)
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the existence of pure nash equilibria inweighted congestion games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Optimal cost sharing protocols for scheduling games
Proceedings of the 12th ACM conference on Electronic commerce
Congestion games with variable demands
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Pure nash equilibria in player-specific and weighted congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Price of anarchy for polynomial wardrop games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Mechanisms and allocations with positive network externalities
Proceedings of the 13th ACM Conference on Electronic Commerce
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Mathematics of Operations Research
Congestion games with player-specific constants
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Routing and scheduling with incomplete information
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Optimal Cost Sharing for Resource Selection Games
Mathematics of Operations Research
On a generalized Cournot oligopolistic competition game
Journal of Global Optimization
Hi-index | 0.01 |
In this work we study weighted network congestion games with player-specific latency functions where selfish players wish to route their traffic through a shared network. We consider both the case of splittable and unsplittable traffic. Our main findings are as follows: For routing games on parallel links with linear latency functions without a constant term we introduce two new potential functions for unsplittable and for splittable traffic respectively. We use these functions to derive results on the convergence to pure Nash equilibria and the computation of equilibria. We also show for several generalizations of these routing games that such potential functions do not exist. We prove upper and lower bounds on the price of anarchy for games with linear latency functions. For the case of unsplittable traffic the upper and lower bound are asymptotically tight.