A mean field approach for optimization in discrete time

Discrete Event Dynamic Systems: Theory and Applications

Volumn 21, Issue 1, 2011, Pages 63-101

  Gast, Nicolas ^a,b   Gaujal, Bruno ^b,c  

^a UNIV GRENOBLE ALPES   (France)

^b LIG   (France)

^c INRIA   (France)

Author keywords

Brokering; Markov decision process; Mean field

Indexed keywords

BEHAVIORAL RESEARCH; COMPUTATION THEORY; DIGITAL CONTROL SYSTEMS; DISCRETE TIME CONTROL SYSTEMS; GRID COMPUTING; LEARNING ALGORITHMS; MARKOV PROCESSES; STOCHASTIC SYSTEMS;

BROKERING; COMMON ENVIRONMENT; DISCRETE - TIME SYSTEMS; INDEPENDENT OBJECTS; MARKOV DECISION PROCESSES; MEAN FIELD; MEAN FIELD APPROACH; SPEED OF CONVERGENCE;

COSTS;

EID: 79951558493     PISSN: 09246703     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10626-010-0094-3     Document Type: Conference Paper

References (23)

1. M Benaïm J-Y Le Boudec 2008 A class of mean field interaction models for computer and communication systems Perform Eval 65 11-12 823 838 10.1016/j.peva.2008.03.005
2. Berten V, Gaujal B (2007a) Brokering strategies in computational grids using stochastic prediction models. Parallel Comput (Special Issue on Large Scale Grids)
3. Berten V, Gaujal B (2007b) Grid brokering for batch allocation using indexes. In: Euro-FGI NET-COOP. LNCS, Avignon, France
4. Bobbio A, Gribaudo M, Telek M (2008) Analysis of large scale interacting systems by mean field method. In: 5th international conference on quantitative evaluation of systems (QEST), St Malo, pp 215-224
5. Bordenave C, Anantharam V (2007) Optimal control of interacting particle systems. Tech Rep 00397327, CNRS Open-Archive HAL
6. C Bordenave D McDonald A Proutière 2010 A particle system in interaction with a rapidly varying environment: mean field limits and applications Networks and Heterogeneous Media (NHM) 5 1 31 62 10.3934/nhm.2010.5.31
7. Borkar V (2008) Stochastic approximation: a dynamical systems viewpoint. Cambridge University Press
8. Durrett R (1991) Probability: theory and examples. Wadsworth & Brooks/Cole
9. EGEE (2010) Enabling grids for E-science
10. Gast N, Gaujal B (2009) A mean field approach for optimization in particle systems and applications. In: Fourth international conference on performance evaluation methodologies and tools, ValueTools
11. Gast N, Gaujal B, Le Boudec J-Y (2010) Mean field for Markov decision processes: from discrete to continuous optimization. Tech rep, INRIA
12. C Graham 2000 Chaoticity on path space for a queueing network with selection of the shortest queue among several J Appl Probab 37 198 211 0961.60091 10.1239/jap/1014842277 1761670
13. Hochbaum DS (1996) Approximation algorithms for NP-hard problems. PWS Publishing Co. Boston, MA, USA
14. W Hoeffding 1963 Probability inequalities for sums of bounded random variables J Am Stat Assoc 58 301 13 30 0127.10602 10.2307/2282952 144363
15. Kurtz T (1978) Strong approximation theorems for density dependent Markov chains. Stoch Process Their Appl. Elsevier
16. J-Y Le Boudec D McDonald J Mundinger 2007 A generic mean field convergence result for systems of interacting objects QEST 2007 3 18
17. J Palmer I Mitrani 2005 Optimal and heuristic policies for dynamic server allocation J Parallel Distrib Comput 65 10 1204 1211 1077.68526 10.1016/j.jpdc.2005.04.010 Special issue: design and performance of networks for super-, cluster-, and grid-computing (part I) (Pubitemid 41240624)
18. CH Papadimitriou JN Tsitsiklis 1999 The complexity of optimal queueing network control Math Oper Res 24 293 305 0977.90008 10.1287/moor.24.2.293 1853877
19. Puterman ML (2005) Markov decision processes: discrete stochastic dynamic programming. Wiley-Interscience
20. Rolski T (1983) Comparison theorems for queues with dependent interarrival times. In: Lecture notes in control and information sciences, vol 60. Springer, pp 42-71
21. Schwartz JT (1969) Nonlinear functional analysis. Gordon and Breach Science Publishers, New York
22. RR Weber G Weiss 1990 On an index policy for restless bandits J Appl Probab 27 637 648 0735.90072 10.2307/3214547 1067028
23. Whittle P (1988) A celebration of applied probability. J Appl Probab Spec 25A(chap. restless bandits: activity allocation in a changing world): 287-298