Stackelberg scheduling strategies
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Applications of approximation algorithms to cooperative games
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
Flows over time with load-dependent transit times
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
Journal of the ACM (JACM)
Load Balancing in Distributed Systems: An Approach Using Cooperative Games
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Algorithms, Games, and the Internet
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Improved Results for Stackelberg Scheduling Strategies
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Game-Theoretic Model and Algorithm for Load Balancing in Distributed Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
Strategyproof cost-sharing mechanisms for set cover and facility location games
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
Miscomputing ratio: social cost of selfish computing
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Stability vs optimality tradeoff in game theoretic mechanisms for QoS provision
Proceedings of the 2003 ACM symposium on Applied computing
A Randomized Online Algorithm for Bandwidth Utilization
Journal of Scheduling
How to route and tax selfish unsplittable traffic
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On the expected payment of mechanisms for task allocation
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
Network QoS games: stability vs optimality tradeoff
Journal of Computer and System Sciences
A game theoretic approach for power aware middleware
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Strategyproof cost-sharing mechanisms for set cover and facility location games
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Algorithmic foundations of the internet
ACM SIGACT News
A network pricing game for selfish traffic
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The communication cost of selfishness: ex post implementation
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Low-Cost Routing in Selfish and Rational Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
Noncooperative load balancing in distributed systems
Journal of Parallel and Distributed Computing
Agent-based randomized broadcasting in large networks
Discrete Applied Mathematics
Loss-cognizant pricing in networks with greedy users
Computer Networks: The International Journal of Computer and Telecommunications Networking
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Routing selfish unsplittable traffic
ACM Transactions on Algorithms (TALG)
Multiple access game in ad-hoc network
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Mixed Nash equilibria in selfish routing problems with dynamic constraints
Theoretical Computer Science
Internet economics: the use of Shapley value for ISP settlement
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
A combinatorial allocation mechanism with penalties for banner advertising
Proceedings of the 17th international conference on World Wide Web
A game-theoretic analysis of wireless access point selection by mobile users
Computer Communications
Altruism, selfishness, and spite in traffic routing
Proceedings of the 9th ACM conference on Electronic commerce
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
The Local and Global Price of Anarchy of Graphical Games
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
On cooperative settlement between content, transit and eyeball internet service providers
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Proceedings of the 10th ACM conference on Electronic commerce
Traffic Networks and Flows over Time
Algorithmics of Large and Complex Networks
Simulation analysis of decision-making policy for on-demand transport systems
Applied Intelligence
IEEE Transactions on Information Theory
Nash Equilibria and the Price of Anarchy for Flows over Time
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On Equilibria for ADM Minimization Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Parametric Packing of Selfish Items and the Subset Sum Algorithm
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Strategyproof cost-sharing mechanisms for set cover and facility location games
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Theoretical Computer Science
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the performance of congestion games for optimum satisfiability problems
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Cooperative interdomain traffic engineering using Nash bargaining and decomposition
IEEE/ACM Transactions on Networking (TON)
Local and global price of anarchy of graphical games
Theoretical Computer Science
Internet economics: the use of Shapley value for ISP settlement
IEEE/ACM Transactions on Networking (TON)
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
Algorithmic foundations of the internet: roundup
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Experimental results for stackelberg scheduling strategies
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
On allocations with negative externalities
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Competitive contagion in networks
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Computer Science Review
A game-theoretic model of attention in social networks
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
A note on a selfish bin packing problem
Journal of Global Optimization
Hi-index | 0.06 |
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route traffic such that the sum of all travel times-the total latency-is minimized. In many settings, including the Internet and other large-scale communication networks, it may be expensive or impossible to regulate network traffic so as to implement an optimal assignment of routes. In the absence of regulation by some central authority, we 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 will not minimize the total latency; hence, this lack of regulation carries the cost of decreased network performance. We quantify the degradation in network performance due to unregulated traffic. We prove that if the latency of each edge is a linear function of its congestion, then the total latency of the routes chosen by selfish network users is at most 4/3 times the minimum possible total latency (subject to the condition that all traffic must be routed). We also consider the more general setting in which edge latency functions are assumed only to be continuous and non-decreasing in the edge congestion.