Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
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
Evolutionary Algorithms and the Maximum Matching Problem
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
How Asymmetry Helps Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The Natural Work-Stealing Algorithm is Stable
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of 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 optimization of monotone polynomials by the (1+1) EA and randomized local search
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms (TALG)
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed Learning of Wardrop Equilibria
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Atomic Congestion Games: Fast, Myopic and Concurrent
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
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
A dynamic approach for load balancing
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Quality-based resource brokerage for autonomous networked multimedia applications
IEEE Transactions on Circuits and Systems for Video Technology
Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Myopic distributed protocols for singleton and independent-resource congestion games
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
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
Peer-assisted texture streaming in metaverses
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Load balancing via random local search in closed and open systems
Queueing Systems: Theory and Applications
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
Approximating wardrop equilibria with finitely many agents
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Information Sciences: an International Journal
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
Learning equilibria of games via payoff queries
Proceedings of the fourteenth ACM conference on Electronic commerce
| Hi-index | 0.00 |
This paper studies a load balancing game introduced by Koutsoupias and Papadimitriou, that is intended to model a set of users who share several internet-based resources. Some of the recent work on this topic has considered the problem of constructing Nash equilibria, which are choices of actions where each user has optimal utility given the actions of the other users. A related (harder) problem is to find sequences of utility-improving moves that lead to a Nash equilibrium, starting from some given assignment of resources to users.We consider the special case where all resources are the same as each other. It is known already that there exist efficient algorithms for finding Nash equilibria; our contribution here is to show furthermore that Nash equilibria for this type of game are reached rapidly by Randomized Local Search, a simple generic method for local optimization. Our motivation for studying Randomized Local Search is that (as we show) it can be realised by a simple distributed network of users that act selfishly, have no central control and only interact via the effect they have on the cost functions of resources.