… balanced. Recent work has studied the question of how this can take place within a distributed
setting in which agents migrate selfishly … in a strongly distributed setting, uses no central …

… We study distributed load balancing in networks with selfish agents. In … n selfish agents that
unilaterally decide to move from one vertex to another if this improves their experienced load. …

… consider neighborhood load balancing in the context of selfish clients. … selfish user. The
objective of the user is to allocate his/her task to a processor with minimum load, where the load …

… In computer science, load balancing is traditionally viewed as an algorithmic problem. We
design and analyze algorithms, either centralized or distributed, that compute the mapping A . …

… a distributed setting in which agents migrate selfishly without … be implemented in a strongly
distributed setting, uses no central … For©, the system becomes approximately balanced (an-…

… Our load balancing game is inspired by the emerging class of Internet-centric applications …
, but it has broader implications for any uncoordinated distributed system. In a P2P system, for …

… Two fundamental variants of load-balancing problems are selfish load balancing (aka
load-balancing games), where clients are non-cooperative selfish players aimed at minimizing …

… We also present a distributed algorithm iteratively balancing the load. We show how … load
exchanged by the algorithm. During the experimental evaluation, we show that the distributed …

… We consider the problem of deterministic distributed load balancing of indivisible tasks in
the discrete setting. A set of n processors is connected into a d-regular symmetric network. In …

… different protocols, ie, different load balancing schemes. … a load balancing scheme for
large-scale distributed systems, … the performance of distributed systems through load balancing. If …