Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Improving local search heuristics for some scheduling problems—I
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Improving local search heuristics for some scheduling problems. Part II
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
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
Routing into two parallel links: game-theoretic distributed algorithms
Journal of Parallel and Distributed Computing
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
Developments from a June 1996 seminar on Online algorithms: the state of the art
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
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Efficient nash computation in large population games with bounded influence
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
A new model for selfish routing
Theoretical Computer Science
Distributed Learning of Wardrop Equilibria
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Improved equilibria via public service advertising
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
$\mathcal{NP}$-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Proceedings of the 10th ACM conference on Electronic commerce
Concurrent imitation dynamics in congestion games
Proceedings of the 28th ACM symposium on Principles of distributed computing
Distributed algorithms for QoS load balancing
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Characterizing the Existence of Potential Functions in Weighted Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Maximizing the Minimum Load: The Cost of Selfishness
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
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
Load balancing via random local search in closed and open systems
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analysis of multi-organization scheduling algorithms
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Extending the notion of rationality of selfish agents: Second Order Nash equilibria
Theoretical Computer Science
Optimal cost sharing protocols for scheduling games
Proceedings of the 12th ACM conference on Electronic commerce
Leading dynamics to good behavior
ACM SIGecom Exchanges
On the quality and complexity of pareto equilibria in the job scheduling game
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Distributed selfish load balancing on networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The price of anarchy on uniformly related machines revisited
Information and Computation
Demand allocation games: integrating discrete and continuous strategy spaces
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Proceedings of the 13th ACM Conference on Electronic Commerce
Distributed selfish load balancing with weights and speeds
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Load balancing via random local search in closed and open systems
Queueing Systems: Theory and Applications
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Mathematics of Operations Research
Congestion games with capacitated resources
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Optimal Cost Sharing for Resource Selection Games
Mathematics of Operations Research
NP-hardness of pure Nash equilibrium in Scheduling and Network Design Games
Theoretical Computer Science
ACM Transactions on Economics and Computation
The cost of selfishness for maximizing the minimum load on uniformly related machines
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We study the number of steps required to reach a pure Nash equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will minimize its cost. We consider a variety of load balancing models, including identical, restricted, related, and unrelated machines. Our results have a crucial dependence on the weights assigned to jobs. We consider arbitrary weights, integer weights, k distinct weights, and identical (unit) weights. We look both at an arbitrary schedule (where the only restriction is that a job migrates to a machine which lowers its cost) and specific efficient schedulers (e.g., allowing the largest weight job to move first). A by-product of our results is establishing a connection between various scheduling models and the game-theoretic notion of potential games. We show that load balancing in unrelated machines is a generalized ordinal potential game, load balancing in related machines is a weighted potential game, and load balancing in related machines and unit weight jobs is an exact potential game.