Data structures and network algorithms
Data structures and network algorithms
Inefficiency of Nash equilibria
Mathematics of Operations Research
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)
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
Journal of the ACM (JACM)
Proceedings of the 4th ACM conference on Electronic commerce
How much can taxes help selfish routing?
Proceedings of the 4th ACM conference on Electronic commerce
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The maximum latency of selfish routing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
Inefficiency in provisioning interconnected communication networks
Proceedings of the 6th ACM conference on Electronic commerce
The price of selfish behavior in bilateral network formation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A network pricing game for selfish traffic
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Non-cooperative multicast and facility location games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Strong equilibrium in cost sharing connection games
Proceedings of the 8th ACM conference on Electronic commerce
Distributed network monitoring and multicommodity flows: a primal-dual approach
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
The price of anarchy in network creation games
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Game-theoretic recommendations: some progress in an uphill battle
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Sensitivity of Wardrop Equilibria
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Avoidance of Traffic Delay for Panicking Crowds Subject to Information Propagation
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Theoretical Computer Science
Conflicting Congestion Effects in Resource Allocation Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Equilibrium dynamic systems intelligence
WSEAS Transactions on Information Science and Applications
Equilibrium dynamic systems integration
ICAI'09 Proceedings of the 10th WSEAS international conference on Automation & information
Efficient Methods for Selfish Network Design
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Journal of Artificial Intelligence Research
Competitive safety analysis: robust decision-making in multi-agent systems
Journal of Artificial Intelligence Research
Simulation analysis of decision-making policy for on-demand transport systems
Applied Intelligence
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Simulation analysis of paradoxical navigation in traffic congestion network
MIC '08 Proceedings of the 27th IASTED International Conference on Modelling, Identification and Control
A network formation game approach to study bittorrent tit-for-tat
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
The hardness of selective network design for bottleneck routing games
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Computational game theory: an introduction
Algorithms and theory of computation handbook
On the packing of selfish items
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The price of anarchy in cooperative network creation games
ACM SIGecom Exchanges
How bad are selfish investments in network security?
IEEE/ACM Transactions on Networking (TON)
Dynamic inefficiency: anarchy without stability
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Analysis of selfish behaviors on door-to-door transport system
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
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
Atomic selfish routing in networks: a survey
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Price of anarchy, locality gap, and a network service provider game
WINE'05 Proceedings of the First international conference on Internet and Network Economics
The price of anarchy in network creation games
ACM Transactions on Algorithms (TALG)
Adversarial behavior in network mechanism design
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Experimental results for stackelberg scheduling strategies
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands
Operations Research Letters
Efficient methods for selfish network design
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
The price of anarchy for selfish ring routing is two
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Hi-index | 0.00 |
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a directed network in which each edge possesses a latency function describing the common latency incurred by all traffic on the edge as a function of the edge congestion. Given a rate of traffic between each pair of nodes in the network, we aspire toward an assignment of traffic to paths in which the sum of all travel times (the total latency) is minimized; however, in many settings network users are free to route their traffic in a selfish manner, without regard to the total latency. We therefore assume that each network user routes its traffic on the minimum-latency path available to it, given the network congestion caused by the other users. In general such a "selfishly motivated" assignment of traffic to paths (a Nash equilibrium) will not 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, defined as the worst possible ratio between the total latency of a Nash equilibrium and of a minimum-latency routing of the traffic.In this paper, we show that the underlying network topology plays no role in the determination of the price of anarchy. Specifically, we show 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 on a set 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. Informally, these results imply that the inefficiency inherent in a flow at Nash equilibrium stems from the inability of selfish users to discern which of two competing routes is superior and not from the topological complexity arising from the diverse intersections of many paths belonging to different commoditie.Our proof techniques also give powerful methods for computing the price of anarchy with respect to an arbitrary class of latency functions. We apply these methods to function classes that have been well studied in the literature (such as degree-bounded polynomials and functions of the form $\ell(x) = (u—x)—1} that are used to model edges with capacity u), thereby achieving the first tight analyses of the price of anarchy for significant classes of latency functions outside the class of linear functions.