The Price of Anarchy for Restricted Parallel Links (original) (raw)
Related papers
On the Price of Anarchy for High-Price Links
Web and Internet Economics, 2019
Price of Anarchy in Networks with Heterogeneous Latency Functions
Mathematics of Operations Research
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences, 2008
Computing Nash Equilibria for Scheduling on Restricted Parallel Links
Theory of Computing Systems, 2009
Optimal routing in parallel, non-observable queues and the price of anarchy revisited
2010
Bottleneck Routing Games in Communication Networks
IEEE Journal on Selected Areas in Communications, 2000
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
SIAM Journal on Discrete Mathematics, 2011
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
2005
Pricing Networks with Selfish Routing
2003
Routing into two parallel links: game-theoretic distributed algorithms
2001
On Worst-Case Equilibria for the Internet
Upper Bounding the Price of Anarchy in Atomic Splittable Selfish Routing
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
2002
Price of Anarchy in Transportation Networks: Efficiency and Optimality Control
Physical Review Letters, 2008
2002
Theoretical Computer Science, 2009
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
2004
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003
Congestion Games, Load Balancing, and Price of Anarchy
Lecture Notes in Computer Science, 2005
Models of Paradoxical Coincident Cost Degradation in Noncooperative Networks
Game Theory Relaunched, 2013
Fast, Fair, and Efficient Flows in Networks
Operations Research, 2007
The Price of Stability for Network Design with Fair Cost Allocation
SIAM Journal on Computing, 2008
On the hardness of network design for bottleneck routing games
Theoretical Computer Science, 2014
How to find Nash equilibria with extreme total latency in network congestion games?
2010
A new model for selfish routing
Theoretical Computer Science, 2008
Network uncertainty in selfish routing
Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006
Network resource allocation and a congestion game
PROCEEDINGS OF THE ANNUAL ALLERTON …, 2003
Efficiency loss in a network resource allocation game
Mathematics of Operations Research, 2004
Fundamental limits of locally-computed incentives in network routing
2017 American Control Conference (ACC), 2017