Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Randomized algorithms
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
The price of anarchy is independent of the network topology
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 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
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Algorithms for pure Nash equilibria in weighted congestion games
Journal of Experimental Algorithmics (JEA)
Taxes for linear atomic congestion games
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Atomic congestion games among coalitions
ACM Transactions on Algorithms (TALG)
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
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
Window-Games between TCP Flows
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Atomic Congestion Games: Fast, Myopic and Concurrent
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Improved equilibria via public service advertising
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Pure Nash equilibria in player-specific and weighted congestion games
Theoretical Computer Science
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
Atomic routing games on maximum congestion
Theoretical Computer Science
How hard is it to find extreme Nash equilibria in network congestion games?
Theoretical Computer Science
The Impact of Oligopolistic Competition in Networks
Operations Research
Characterizing the Existence of Potential Functions in Weighted 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
Mediated Equilibria in Load-Balancing Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Weighted Boolean formula games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Window-games between TCP flows
Theoretical Computer Science
Taxes for linear atomic congestion games
ACM Transactions on Algorithms (TALG)
On the existence of pure nash equilibria inweighted congestion games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Computational game theory: an introduction
Algorithms and theory of computation handbook
Bottleneck congestion games with logarithmic price of anarchy
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
A game theoretic analysis of network design with socially-aware users
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing (un-) splittable flow in games with player-specific affine latency functions
ACM Transactions on Algorithms (TALG)
Congestion games with variable demands
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Restoring pure equilibria to weighted congestion games
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Exact Price of Anarchy for Polynomial Congestion Games
SIAM Journal on Computing
Pure nash equilibria in player-specific and weighted congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
On the complexity of pure-strategy nash equilibria in congestion and local-effect games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
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
Symmetry in network congestion games: pure equilibria and anarchy cost
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Atomic congestion games among coalitions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The price of collusion in series-parallel networks
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Demand allocation games: integrating discrete and continuous strategy spaces
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Computing approximate pure Nash equilibria in congestion games
ACM SIGecom Exchanges
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Mathematics of Operations Research
On bidimensional congestion games
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Congestion games with player-specific constants
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Optimal Cost Sharing for Resource Selection Games
Mathematics of Operations Research
Future Generation Computer Systems
Altruism in Atomic Congestion Games
ACM Transactions on Economics and Computation
A routing strategy for non-cooperation wireless multi-hop ad hoc networks
Mobile Information Systems
Hi-index | 0.01 |
What is the price of anarchy when unsplittable demands are routed selfishly in general networks with load-dependent edge delays? Motivated by this question we generalize the model of Koutsoupias and Papadimitriou (Worst-case equilibria, in: Proc. of the 16th Annual Symp. on Theoretical Aspects of Computer Science (STACS '99), Lecture Notes in Computer Science, Vol. 1563, Springer, Berlin, 1999, pp. 404-413) to the case of weighted congestion games. We show that varying demands of users crucially affect the nature of these games, which are no longer isomorphic to exact potential games, even for very simple instances. Indeed we construct examples where even a single-commodity (weighted) network congestion game may have no pure Nash equilibrium.On the other hand, we prove that any weighted network congestion game with linear edge delays admits a pure Nash equilibrium that can be found in pseudo-polynomial time. Finally, we consider the family of l-layered networks and give a surprising answer to the question above: the price of anarchy of any weighted congestion game in a l-layered network with m edges and edge delays equal to the loads is Θ(log m/log log m).