TASKS ALLOCATION PROBLEM AS A NON-COOPERATIVE GAME

We present the problem of tasks allocation in its general form as a non-cooperative game between players. For this game, we give the Nash equilibrium structure and on the basis of this structure, we draw a distributed tasks allocation algorithm that can find this equilibrium.

[1]  Anthony T. Chronopoulos,et al.  Noncooperative load balancing in distributed systems , 2005, J. Parallel Distributed Comput..

[2]  Berthold Vöcking,et al.  Tight bounds for worst-case equilibria , 2002, SODA '02.

[3]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[4]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[5]  Xueyan Tang,et al.  Optimizing static job scheduling in a network of heterogeneous computers , 2000, Proceedings 2000 International Conference on Parallel Processing.

[6]  Eitan Altman,et al.  On the Convergence to Nash Equilibrium in Problems of Distributed Computing , 2002, Ann. Oper. Res..

[7]  Eric van Damme,et al.  Non-Cooperative Games , 2000 .

[8]  Henri Casanova,et al.  Scheduling divisible loads on star and tree networks: results and open problems , 2005, IEEE Transactions on Parallel and Distributed Systems.

[9]  Phillipp Kaestner,et al.  Linear And Nonlinear Programming , 2016 .

[10]  Bruce Bueno de Mesquita,et al.  An Introduction to Game Theory , 2014 .

[11]  Yves Robert,et al.  Mapping and load-balancing iterative computations , 2004, IEEE Transactions on Parallel and Distributed Systems.