Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
On complexity as bounded rationality (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Randomized algorithms
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Virtual path bandwidth allocation in multiuser networks
IEEE/ACM Transactions on Networking (TON)
Dynamics of IP traffic: a study of the role of variability and the impact of control
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
How unfair is optimal routing?
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On the relationship between file sizes, transport protocols, and self-similar network traffic
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
Designing Networks for Selfish Users is Hard
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Game Theory and Mathematical Economics: A Theoratical Computer Scientist's Introduction
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Rate of change and other metrics: a live study of the world wide web
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proceedings of the twenty-second annual symposium on Principles of distributed computing
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A network pricing game for selfish traffic
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Distributed selfish load balancing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed 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
Tradeoffs in worst-case equilibria
Theoretical Computer Science - Approximation and online algorithms
Tight bounds for worst-case equilibria
ACM Transactions on Algorithms (TALG)
Utilitarian resource assignment
Journal of Discrete Algorithms
The price of anarchy for polynomial social cost
Theoretical Computer Science
IEEE Transactions on Parallel and Distributed Systems
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms (TALG)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A new model for selfish routing
Theoretical Computer Science
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences
The Influence of Link Restrictions on (Random) Selfish Routing
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
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
A dynamic approach for load balancing
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation
Theoretical Computer Science
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Tradeoffs and average-case equilibria in selfish routing
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A network creation game with nonuniform interests
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Price of anarchy in non-cooperative load balancing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Extending the notion of rationality of selfish agents: Second Order Nash equilibria
Theoretical Computer Science
Price of anarchy in non-cooperative load balancing games
Performance Evaluation
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
Exact price of anarchy for polynomial congestion games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Atomic routing games on maximum congestion
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
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
Geometric network design with selfish agents
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Game-Theoretic analysis of internet switching with selfish users
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Atomic selfish routing in networks: a survey
WINE'05 Proceedings of the First international conference on Internet and Network Economics
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Congestion games, load balancing, and price of anarchy
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Game-theoretic analysis of Internet switching with selfish users
Theoretical Computer Science
Extending the notion of rationality of selfish agents: second order Nash equilibria
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On Nash Equilibria for a Network Creation Game
ACM Transactions on Economics and Computation
Hi-index | 0.01 |
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model of Koutsoupias and Papadimitriou. We present the first thorough study of this model for general, monotone families of cost functions and for cost functionsm from Queueing Theory. Our main results can be summarized as follows.We give a precise characterization of cost functions having a bounded/unbounded coordination ratio. For example, cost functions that describe the expected delay in queueing systems have an unbounded coordination ratio.We show that an unbounded coordination ratio implies additionally an extremely high performance degradation under bicriteria measures. We demonstrate that the price of selfish routing can be as high as a bandwidth degradation by a factor that is linear in the network size.We separate the game theoretic (integral) allocation model from the (fractional) flow model by demonstrating that even a very small, in fact negligible, amount of integrality can lead to a dramatic performance degradation.We unify recent results on selfish routing under different objectives by showing that an unbounded coordination ratio under the min-max objective implies an unbounded coordination ratio under the average-cost (or total-latency) objective and vice versa..Our special focus lies on cost functions describing the behavior of Web servers that can open only a limited number of TCP connections. In particular, we compare the performance of queueing systems that serve all incoming requests with servers that reject requests in case of overload.From the result presented in this paper we conclude that queuing systems without rejection cannot give any reasonable guarantee on the expected delay of requests under selfish routing even when the injected load is far away from the capacity of the system. In contrast, Web server farms that are allowed to reject requests can guarantee a high quality of service for every individual request stream even under relatively high injection rates.