Data structures and network algorithms
Data structures and network algorithms
Inefficiency of Nash equilibria
Mathematics of Operations Research
Data networks (2nd ed.)
Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Virtual path bandwidth allocation in multiuser networks
IEEE/ACM Transactions on Networking (TON)
Stackelberg scheduling strategies
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms, games, and the internet
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
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the performance of user equilibria in traffic networks
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Designing Networks for Selfish Users is Hard
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Selfish routing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the performance of user equilibria in traffic networks
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish routing with atomic players
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Bottleneck links, variable demand, and the tragedy of the commons
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Tradeoffs in worst-case equilibria
Theoretical Computer Science - Approximation and online algorithms
Tight bounds for worst-case equilibria
ACM Transactions on Algorithms (TALG)
On the price of anarchy in unbounded delay networks
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
The effectiveness of Stackelberg strategies and tolls for network congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Altruism, selfishness, and spite in traffic routing
Proceedings of the 9th ACM conference on Electronic commerce
The effect of local scheduling in load balancing designs
ACM SIGMETRICS Performance Evaluation Review
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Stackelberg Routing in Arbitrary Networks
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Improving the Efficiency of Load Balancing Games through Taxes
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
Approximation and Online Algorithms
A comparative analysis of server selection in content replication networks
IEEE/ACM Transactions on Networking (TON)
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
Worst-Case Efficiency Analysis of Queueing Disciplines
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Adaptive routing with stale information
Theoretical Computer Science
Eliciting Coordination with Rebates
Transportation Science
Power allocation games for MIMO multiple access channels with coordination
IEEE Transactions on Wireless Communications
The Impact of Oligopolistic Competition in Networks
Operations Research
Efficiency and stability of Nash equilibria in resource allocation games
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Nonadaptive selfish routing with online demands
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Stackelberg strategies for atomic congestion games
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Communications of the ACM
Stackelberg Routing in Arbitrary Networks
Mathematics of Operations Research
Optimal sensing strategy for opportunistic secondary users in a cognitive radio network
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Weighted congestion games: price of anarchy, universal worst-case examples, and tightness
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Pareto efficiency and approximate pareto efficiency in routing and load balancing games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
On the existence of optimal taxes for network congestion games with heterogeneous users
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Reducing the maximum latency of selfish ring routing via pairwise cooperations
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Selfish Traffic Allocation for Server Farms
SIAM Journal on Computing
Extending the notion of rationality of selfish agents: Second Order Nash equilibria
Theoretical Computer Science
Routing (un-) splittable flow in games with player-specific affine latency functions
ACM Transactions on Algorithms (TALG)
Optimal cost sharing protocols for scheduling games
Proceedings of the 12th ACM conference on Electronic commerce
On optimal single-item auctions
Proceedings of the forty-third annual ACM symposium on Theory of computing
A competitive strategy for routing flow over time
ACM SIGecom Exchanges
The price of forgetting in parallel and non-observable queues
Performance Evaluation
Efficiency of restricted tolls in non-atomic network routing games
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
The equilibrium existence problem in finite network congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Price of anarchy for polynomial wardrop games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
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
The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games
Operations Research
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
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 price of anarchy of cournot oligopoly
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On the inefficiency of equilibria in congestion games
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Network games with atomic players
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
Intrinsic robustness of the price of anarchy
Communications of the ACM
The price of anarchy in an exponential multi-server
Operations Research Letters
Bounding the inefficiency of Nash equilibria in games with finitely many players
Operations Research Letters
Pairwise cooperations in selfish ring routing for minimax linear latency
Theoretical Computer Science
ACM SIGecom Exchanges
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
SIAM Journal on Discrete Mathematics
The effectiveness of stackelberg strategies and tolls for network congestion games
ACM Transactions on Algorithms (TALG)
A market-inspired approach for intersection management in urban road traffic networks
Journal of Artificial Intelligence Research
On a generalized Cournot oligopolistic competition game
Journal of Global Optimization
Hi-index | 0.03 |
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experienced by network traffic on an edge of the network is a function of the edge congestion, and network users are assumed to selfishly route traffic on minimum-latency paths. The quality of a routing of traffic is measured by the sum of travel times, also called the total latency. The outcome of selfish routing--a Nash equilibrium--does not in general minimize the total latency; hence, selfish behavior carries the cost of decreased network performance. We quantify this degradation in network performance via the price of anarchy, the worst-possible ratio between the total latency of a Nash equilibrium and of an optimal routing of the traffic. In this paper, we show that the price of anarchy is determined only by the simplest of networks. Specifically, we prove that under weak hypotheses on the class of allowable edge latency functions, the worst-case ratio between the total latency of a Nash equilibrium and of a minimum-latency routing for any multicommodity flow network is achieved by a single-commodity instance in a network of parallel links. In the special case where the class of allowable latency functions includes all of the constant functions, we prove that a network with only two parallel links suffices to achieve the worst-possible ratio. Our guarantee that simple networks always furnish worst-possible examples provides a powerful method for computing the price of anarchy with respect to an arbitrary class of latency functions. We apply this method to function classes that have been well studied in the literature, including degree-bounded polynomials and queuing delay functions. These are the first tight analyses of the price of anarchy for significant classes of latency functions outside the class of linear functions.