Online load balancing and network flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Scheduling Parallel Machines On-line
SIAM Journal on Computing
Approximation schemes for scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
Journal of the ACM (JACM)
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
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Load balancing in the L/sub p/ norm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing Nash equilibria for scheduling on restricted parallel links
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish load balancing and atomic congestion games
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
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
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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
Taxes for linear atomic congestion games
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling to maximize participation
Theoretical Computer Science
The Influence of Link Restrictions on (Random) Selfish Routing
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On the Road to $\mathcal{PLS}$-Completeness: 8 Agents in a Singleton Congestion Game
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
Performances of One-Round Walks in Linear Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
The Impact of Social Ignorance on Weighted Congestion Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the Inefficiency Ratio of Stable Equilibria in Congestion Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Mediated Equilibria in Load-Balancing Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
A dynamic approach for load balancing
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Distributed flow detection over multi-path sessions
Computer Communications
Scheduling to maximize participation
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Nonadaptive selfish routing with online demands
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Total latency in singleton congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Tradeoffs and Average-Case Equilibria in Selfish Routing
ACM Transactions on Computation Theory (TOCT)
Taxes for linear atomic congestion games
ACM Transactions on Algorithms (TALG)
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
Analysis of multi-organization scheduling algorithms
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
The impact of altruism on the efficiency of atomic congestion games
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Improved lower bounds on the price of stability of undirected network design games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Inner product spaces for MinSum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing
Social context congestion games
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
A graph partitioning game for distributed simulation of networks
Proceedings of the 2011 International Workshop on Modeling, Analysis, and Control of Complex Networks
On the price of stability for undirected network design
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
On bidimensional congestion games
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Distributed Online Algorithms for the Agent Migration Problem in WSNs
Mobile Networks and Applications
Hi-index | 0.02 |
We study the load balancing problem in the context of a set of clients each wishing to run a job on a server selected among a subset of permissible servers for the particular client. We consider two different scenarios. In selfish load balancing, each client is selfish in the sense that it selects to run its job to the server among its permissible servers having the smallest latency given the assignments of the jobs of other clients to servers. In online load balancing, clients appear online and, when a client appears, it has to make an irrevocable decision and assign its job to one of its permissible servers. Here, we assume that the clients aim to optimize some global criterion but in an online fashion. A natural local optimization criterion that can be used by each client when making its decision is to assign its job to that server that gives the minimum increase of the global objective. This gives rise to greedy online solutions. The aim of this paper is to determine how much the quality of load balancing is affected by selfishness and greediness. We characterize almost completely the impact of selfishness and greediness in load balancing by presenting new and improved, tight or almost tight bounds on the price of anarchy and price of stability of selfish load balancing as well as on the competitiveness of the greedy algorithm for online load balancing when the objective is to minimize the total latency of all clients on servers with linear latency functions.