Distributed Selfish Load Balancing
<|reference_start|>Distributed Selfish Load Balancing: Suppose that a set of $m$ tasks are to be shared as equally as possible amongst a set of $n$ resources. A game-theoretic mechanism to find a suitable allocation is to associate each task with a ``selfish agent'', and require each agent to select a resource, with the cost of a resource being the number of agents to select it. Agents would then be expected to migrate from overloaded to underloaded resources, until the allocation becomes balanced.   Recent work has studied the question of how this can take place within a distributed setting in which agents migrate selfishly without any centralized control. In this paper we discuss a natural protocol for the agents which combines the following desirable features: It can be implemented in a strongly distributed setting, uses no central control, and has good convergence properties. For $m\gg n$, the system becomes approximately balanced (an $\epsilon$-Nash equilibrium) in expected time $O(\log\log m)$. We show using a martingale technique that the process converges to a perfectly balanced allocation in expected time $O(\log\log m+n^4)$. We also give a lower bound of $\Omega(\max\{\log\log m,n\})$ for the convergence time.<|reference_end|>
@article{berenbrink2005distributed,
    title={Distributed Selfish Load Balancing},
    author={Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul Goldberg,
  Zengjian Hu, Russell Martin},
    journal={arXiv preprint arXiv:cs/0506098},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0506098},
    primaryClass={cs.GT math.OC}
}