scholar.google.com › citations
Dec 22, 2010 · We consider the problem of dynamically reallocating (or re-routing) m weighted tasks among a set of n uniform resources (one may think of ...
We consider the problem of dynamically reallocating (or re-routing) m weighted tasks among a set of n uniform resources (one may think of the tasks as ...
Convergence to Equilibria in Distributed, Selfish Reallocation ...
primo.pugetsound.edu › fulldisplay
We consider the problem of dynamically reallocating (or re-routing) m weighted tasks among a set of n uniform resources (one may think of the tasks as selfish ...
Abstract. We consider the problem of dynamically reallocating (or rerouting) m weighted tasks among a set of n uniform resources (one may think of the tasks ...
In this paper we consider neighborhood load balancing in the context of selfish clients. We assume that a network of n processors and m tasks is given.
In this paper we consider neighborhood load balancing in the context of selfish clients. We assume that a network of n processors and m tasks is given. The ...
Convergence to equilibria in dis- tributed, selfish reallocation processes with weighted tasks. In Proc. of the 15the Annual Eu- ropean Symposium on ...
CONVERGENCE TO NASH EQUILIBRIA IN DISTRIBUTED AND. SELFISH REALLOCATION PROCESSES by. Iman Hajirasouliha. B.Sc., Sharif University of Technology, Tehran, Iran ...
Bibliographic details on Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks.
2010. Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks. P Berenbrink, T Friedetzky, I Hajirasouliha, Z Hu.