Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Journal of the ACM (JACM)
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
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
ACM SIGACT News
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Routing selfish unsplittable traffic
ACM Transactions on Algorithms (TALG)
Atomic congestion games among coalitions
ACM Transactions on Algorithms (TALG)
Altruism, selfishness, and spite in traffic routing
Proceedings of the 9th ACM conference on Electronic commerce
Equilibria of atomic flow games are not unique
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
Approximation and Online Algorithms
Quality of routing congestion games in wireless sensor networks
Proceedings of the 4th Annual International Conference on Wireless Internet
Atomic routing games on maximum congestion
Theoretical Computer Science
The Impact of Oligopolistic Competition in Networks
Operations Research
Nonadaptive selfish routing with online demands
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Partition equilibrium always exists in resource selection games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Bottleneck congestion games with logarithmic price of anarchy
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Collusion in atomic splittable routing games
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Strong and correlated strong equilibria in monotone 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
Atomic routing games on maximum congestion
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
On the inefficiency of equilibria in congestion games
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Local smoothness and the price of anarchy in atomic splittable congestion games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete 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
| Hi-index | 0.00 |
One of the most successful applications of the price of anarchy---the worst-case ratio between the objective function values of noncooperative equilibria and optima---is to "selfish routing", a classical model of how independent network users route traffic in a congested network. However, almost all existing work on this topic (e.g., [2, 5, 7]) assumes a large population of very small network users, so that the actions of a single individual have negligible impact on the cost incurred by others. This assumption---in game theory terminology, that the game is nonatomic---is obviously not justifiable in all applications.