V. Anantharam and C. Bordenave, Optimal control of interacting particle systems, Private Communication, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00397327

M. Bena?m, J. Y. Le, and . Boudec, A Class Of Mean Field Interaction Models for Computer and Communication Systems

V. Berten and B. Gaujal, Brokering strategies in computational grids using stochastic prediction models, Parallel Computing, vol.33, issue.4-5, 2007.
DOI : 10.1016/j.parco.2007.02.013

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

V. Berten and B. Gaujal, Grid Brokering for Batch Allocation Using Indexes, Euro-FGI NET-COOP, 2007.
DOI : 10.1007/978-3-540-72709-5_23

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

C. Bordenave, D. Mcdonald, and A. Proutiere, A particle system in interaction with a rapidly varying environment: Mean field limits and applications. Arxiv preprint math, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00629339

V. Borkar, Stochastic approximation, Resonance, vol.8, issue.s.471012, 2008.
DOI : 10.1007/s12045-013-0136-x

J. Y. Boudec, D. Mcdonald, and J. Mundinger, A Generic Mean Field Convergence Result for Systems of Interacting Objects. QEST, pp.3-18, 2007.

R. Durrett, Probability: theory and examples, 1991.
DOI : 10.1017/CBO9780511779398

C. Graham, Chaoticity on path space for a queueing network with selection of the shortest queue among several, Journal of Applied Probability, vol.28, issue.01, pp.198-211, 2000.
DOI : 10.1007/BF01199263

D. S. Hochbaum, Approximation algorithms for NP-hard problems, 1996.

J. Palmer and I. Mitrani, Optimal and heuristic policies for dynamic server allocation, Special issue: Design and Performance of Networks for Super-, Cluster-, and Grid-Computing (Part I), pp.1204-1211, 2005.
DOI : 10.1016/j.jpdc.2005.04.010

C. H. Papadimitriou and J. N. Tsitsiklis, The complexity of optimal queueing network control, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory, pp.293-305, 1999.
DOI : 10.1109/SCT.1994.315792

M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1994.
DOI : 10.1002/9780470316887

T. Rolski, Comparison theorems for queues with dependent interarrival times, Lecture Notes in Control and Information Sciences, pp.42-71, 1983.

R. Richard, G. Weber, and . Weiss, On an index policy for restless bandits, Journal of Applied Probability, vol.27, pp.637-648, 1990.

P. Whittle, A celebration of applied probability, volume 25A, chapter Restless bandits: activity allocation in a changing world INRIA Centre de recherche INRIA Grenoble ? Rhône-Alpes 655, J. Appl. Probab. Spec., j. gani edition, pp.287-298, 1988.