O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal et al., Centralized versus distributed schedulers for multiple bag-of-task applications, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006.
DOI : 10.1109/IPDPS.2006.1639262

E. Koutsoupias and C. Papadimitriou, Worst-case equilibria, STACS, 1998.
DOI : 10.1007/3-540-49116-3_38

D. Braess, ber ein paradoxien aus der verkehrsplanung, Unternehmensforschung, vol.12, pp.258-68, 1968.
DOI : 10.1007/bf01918335

A. Legrand and C. Touati, Non-Cooperative Scheduling of Multiple Bag-of-Task Applications, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, 2005.
DOI : 10.1109/INFCOM.2007.57

URL : https://hal.archives-ouvertes.fr/inria-00153577

M. Banikazemi, J. Sampathkumar, S. Prabhu, D. Panda, and P. Sadayappan, Communication modeling of heterogeneous networks of workstations for performance characterization of collective operations, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99), pp.125-133, 1999.
DOI : 10.1109/HCW.1999.765117

A. Bar-noy, S. Guha, J. S. Naor, and B. Schieber, Message Multicasting in Heterogeneous Networks, SIAM Journal on Computing, vol.30, issue.2, pp.347-358, 2000.
DOI : 10.1137/S0097539798347906

C. Banino, O. Beaumont, L. Carter, J. Ferrante, A. Legrand et al., Scheduling strategies for master-slave tasking on heterogeneous processor platforms, IEEE Transactions on Parallel and Distributed Systems, vol.15, issue.4, pp.319-330, 2004.
DOI : 10.1109/TPDS.2004.1271181

URL : https://hal.archives-ouvertes.fr/hal-00789427

P. Dutot, Complexity of master???slave tasking on heterogeneous trees, special issue on the Dagstuhl meeting on Scheduling for Computing and Manufacturing systems, 2004.
DOI : 10.1016/j.ejor.2003.10.051

URL : https://hal.archives-ouvertes.fr/inria-00001076

B. Hong and V. Prasanna, Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., 2004.
DOI : 10.1109/IPDPS.2004.1302974

C. Banino, O. Beaumont, L. Carter, J. Ferrante, A. Legrand et al., Scheduling strategies for master-slave tasking on heterogeneous processor platforms, IEEE Transactions on Parallel and Distributed Systems, vol.15, issue.4, pp.319-330, 2004.
DOI : 10.1109/TPDS.2004.1271181

URL : https://hal.archives-ouvertes.fr/hal-00789427

J. F. Nash, Equilibrium points in n-person games, Proceedings of the National Academy of Sciences, vol.8, issue.1, pp.48-49, 1950.
DOI : 10.1073/pnas.36.1.48

C. Touati, E. Altman, and J. Galtier, Generalised Nash bargaining solution for banwidth allocation, Computer Networks, 2006.
DOI : 10.1016/j.comnet.2005.12.006

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.3442

H. Kameda, Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks, pp.405-417, 2004.
DOI : 10.1007/978-3-540-24693-0_34

C. H. Papadimitriou and M. Yannakakis, On the approximability of trade-offs and optimal access of Web sources, Proceedings 41st Annual Symposium on Foundations of Computer Science, p.86, 2000.
DOI : 10.1109/SFCS.2000.892068

H. Ya¨?cheya¨?che, R. R. Mazumdar, and C. Rosenberg, A game theoretic framework for bandwidth allocation and pricing in broadband networks, IEEE/ACM Transactions on Networking, vol.8, issue.5, pp.667-678, 2000.
DOI : 10.1109/90.879352