Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Load balancing and Poisson equation in a graph
Concurrency: Practice and Experience
Dynamic load balancing by random matchings
Journal of Computer and System Sciences
Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing Schemes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fast convergence to Wardrop equilibria by adaptive sampling methods
Proceedings of the thirty-eighth annual ACM symposium on Theory of 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
Regret based dynamics: convergence in weakly acyclic games
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Fast load balancing via bounded best response
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed Selfish Load Balancing
SIAM Journal on Computing
Inapproximability of pure nash equilibria
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the impact of combinatorial structure on congestion games
Journal of the ACM (JACM)
A new analytical method for parallel, diffusion-type load balancing
Journal of Parallel and Distributed Computing
Near-perfect load balancing by randomized rounding
Proceedings of the forty-first annual ACM symposium on Theory of computing
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
Adaptive routing with stale information
Theoretical Computer Science
Load balancing without regret in the bulletin board model
Proceedings of the 28th ACM symposium on Principles of distributed computing
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
Payoff-Based Dynamics for Multiplayer Weakly Acyclic Games
SIAM Journal on Control and Optimization
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Atomic Congestion Games: Fast, Myopic and Concurrent
Theory of Computing Systems - Special Section: Algorithmic Game Theory; Guest Editors: Burkhard Monien and Ulf-Peter Schroeder
Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Distributed selfish load balancing with weights and speeds
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Brief announcement: threshold load balancing in networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
We study distributed load balancing in networks with selfish agents. In the simplest model considered here, there are n identical machines represented by vertices in a network and m ≫ n selfish agents that unilaterally decide to move from one vetex to another if this improves their experienced load. We present several protocols for concurrent migration that satisfy desirable properties such as being based only on local information and computation and the absence of global coordination or cooperation of agents. Our main contribution is to show rapid convergence of the resulting migration process to states that satisfy different stability or balance criteria. In particular, the convergence time to a Nash equilibrium is only logarithmic in m and polynomial in n, where the polynomial depends on the graph structure. Using a slight modification with neutral moves, a perfectly balanced state can be reached after additional time polynomial in n. In addition, we show reduced convergence times to approximate Nash equilibria. Finally, we extend our results to networks of machines with different speeds or to agents that have different weights and show similar results for convergence to approximate and exact Nash equilibria.