Designing Networks for Selfish Users is Hard
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Braess's paradox in large random graphs
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
How much can taxes help selfish routing?
Journal of Computer and System Sciences - Special issue on network algorithms 2005
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
Theoretical Computer Science
Efficient Methods for Selfish Network Design
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Braess's paradox for flows over time
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Braess's paradox in large sparse graphs
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Optimal sub-networks in traffic assignment problem and the Braess paradox
Computers and Industrial Engineering
Braess's paradox, fibonacci numbers, and exponential inapproximability
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Experimental results for stackelberg scheduling strategies
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Efficient methods for selfish network design
Theoretical Computer Science
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
SIAM Journal on Discrete Mathematics
Random Structures & Algorithms
On the hardness of network design for bottleneck routing games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
On the hardness of network design for bottleneck routing games
Theoretical Computer Science
| Hi-index | 0.00 |