Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
On the existence of equilibria in noncooperative optimal flow control
Journal of the ACM (JACM)
Making greed work in networks: a game-theoretic analysis of switch service disciplines
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
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
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
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
Architecting noncooperative networks
IEEE Journal on Selected Areas in Communications
How to route and tax selfish unsplittable traffic
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
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
Computing equilibria in multi-player games
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
Algorithms for pure Nash equilibria in weighted congestion games
Journal of Experimental Algorithmics (JEA)
On the convergence of multicast games in directed networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Routing selfish unsplittable traffic
ACM Transactions on Algorithms (TALG)
(Almost) optimal coordination mechanisms for unrelated machine scheduling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Atomic congestion games among coalitions
ACM Transactions on Algorithms (TALG)
Distributed Learning of Wardrop Equilibria
UC '08 Proceedings of the 7th international conference on Unconventional Computing
The Price of Anarchy on Uniformly Related Machines Revisited
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Atomic Congestion Games: Fast, Myopic and Concurrent
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
The Price of Stochastic Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Pure Nash equilibria in player-specific and weighted congestion games
Theoretical Computer Science
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
Fast and compact: a simple class of congestion games
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Mediated Equilibria in Load-Balancing Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Stability and Convergence in Selfish Scheduling with Altruistic Agents
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
Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A unified approach to congestion games and two-sided markets
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Myopic distributed protocols for singleton and independent-resource congestion games
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Managing end-user preferences in the smart grid
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Designing a practical access point association protocol
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the packing of selfish items
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Pareto efficiency and approximate pareto efficiency in routing and load balancing 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
Dynamic inefficiency: anarchy without stability
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Pure nash equilibria in player-specific and weighted congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
The equilibrium existence problem in finite network congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Convergence and approximation in potential games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Nash equilibria, the price of anarchy and the fully mixed nash equilibrium conjecture
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Coordination mechanisms for selfish scheduling
WINE'05 Proceedings of the First international conference on Internet and Network Economics
A simple graph-theoretic model for selfish restricted scheduling
WINE'05 Proceedings of the First international conference on Internet and Network Economics
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
Atomic congestion games among coalitions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Multicast transmissions in non-cooperative networks with a limited number of selfish moves
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On nash equilibria for multicast transmissions in ad-hoc wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Congestion games, load balancing, and price of anarchy
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Convergence and approximation in potential games
Theoretical Computer Science
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
A first step towards analyzing the convergence time in player-specific singleton congestion games
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Information Sciences: an International Journal
Capacitated network design games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Pricing of parking for congestion reduction
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Convergence of best-response dynamics in games with conflicting congestion effects
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Future Generation Computer Systems
Learning equilibria of games via payoff queries
Proceedings of the fourteenth ACM conference on Electronic commerce
Journal of Parallel and Distributed Computing
| Hi-index | 0.01 |
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 (such as allowing the largest weight job to move first).