Journal of the ACM (JACM)
The price of anarchy is independent of the network topology
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Designing Networks for Selfish Users is Hard
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences - Special issue on FOCS 2001
Altruism, selfishness, and spite in traffic routing
Proceedings of the 9th ACM conference on Electronic commerce
A new model for selfish routing
Theoretical Computer Science
Quality of routing congestion games in wireless sensor networks
Proceedings of the 4th Annual International Conference on Wireless Internet
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
Adaptive routing with stale information
Theoretical Computer Science
Atomic routing games on maximum congestion
Theoretical Computer Science
Strong and Pareto Price of Anarchy in Congestion Games
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Stackelberg Routing in Arbitrary Networks
Mathematics of Operations Research
Bottleneck congestion games with logarithmic price of anarchy
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Wardrop equilibria and price of stability for bottleneck games with splittable traffic
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
Braess's paradox, fibonacci numbers, and exponential inapproximability
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the price of anarchy and stability of correlated equilibria of linear congestion games,,
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The hardness of network design for unsplittable flow with selfish users
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Symmetry in network congestion games: pure equilibria and anarchy cost
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
SIAM Journal on Discrete Mathematics
| Hi-index | 0.01 |