L. Bortolussi and N. Gast, Mean Field Approximation of Uncertain Stochastic Models, 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2016), 2016.
URL : https://hal.archives-ouvertes.fr/hal-01302416

L. Bortolussi and N. Gast, Mean-field limits beyond ordinary differential equations, Formal Methods for the Quantitative Evaluation of Collective Adaptive Systems, vol.13, pp.61-82, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01334358

G. Casale and N. Gast, Asymptotic analysis methods for list-based caches with non-uniform access costs, vol.36, p.33, 2019.

J. Doncel, N. Gast, and B. Gaujal, Are mean-field games the limits of finite stochastic games?" In: The 18th Workshop on MAthematical performance Modeling and Analysis (MAMA). 2016 (cit, p.57

J. Doncel, N. Gast, and B. Gaujal, Discrete mean field games: Existence of equilibria and convergence, Journal of Dynamics & Games, p.57, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01277098

C. Fricker, N. Gast, and A. Mohamed, Mean field analysis for inhomogeneous bike sharing systems, AofA 2012, International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01086055

C. Fricker and N. Gast, Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity, Euro journal on transportation and logistics, vol.5, pp.45-48, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01086009

N. Gast and B. Gaujal, A mean field approach for optimization in discrete time, Discrete Event Dynamic Systems, vol.57, p.13, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00788770

N. Gast and B. Gaujal, A Mean Field Approach for Optimization in Particle Systems and Applications, Fourth International Conference on Performance Evaluation Methodologies and Tools, p.57, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00788908

N. Gast and B. Gaujal, A Mean Field Model of Work Stealing in Large-Scale Systems, ACM SIGMETRICS, vol.25, p.9, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00788862

N. Gast and B. Gaujal, Markov chains with discontinuous drifts have differential inclusion limits, Performance Evaluation, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00787999

N. Gast and B. Gaujal, Mean field limit of non-smooth systems and differential inclusions, ACM SIGMETRICS Performance Evaluation Review, vol.38, pp.30-32, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00788863

N. Gast, B. Gaujal, and J. L. Boudec, Mean field for Markov decision processes: from discrete to continuous optimization, IEEE Transactions on Automatic Control, vol.57, issue.9, p.57, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00787996

N. Gast, G. Massonnet, D. Reijsbergen, and M. Tribastone, Probabilistic forecasts of bike-sharing systems for journey planning, Proceeding of the 24th ACM International Conference on Information and Knowledge Management (CIKM'15), 2015.
URL : https://hal.archives-ouvertes.fr/hal-01185840

N. Gast, Construction of Lyapunov functions via relative entropy with application to caching, The 18th Workshop on MAthematical performance Modeling and Analysis (MAMA). 2016 (cit. on pp. 3, 9, vol.12, p.33
URL : https://hal.archives-ouvertes.fr/hal-01321017

N. Gast, Expected Values Estimated via Mean-Field Approximation Are 1/N-Accurate", In: Proc. ACM Meas. Anal. Comput. Syst, vol.1, issue.1, pp.1-17, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01553133

N. Gast, Expected Values Estimated via Mean-Field Approximation Are 1/N-Accurate: Extended Abstract, Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS '17 Abstracts, pp.50-50, 2017.

N. Gast, Refined Mean Field Tool, vol.40, p.31, 2018.

N. Gast, The Power of Two Choices on Graphs: the Pair-Approximation is Accurate, ACM SIGMETRICS Performance Evaluation Review, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01199271

N. Gast, L. Bortolussi, and M. Tribastone, Size Expansions of Mean Field Approximation: Transient and Steady-State Analysis, In: Performance Evaluation, vol.28, pp.20-23, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01891636

N. Gast and B. Gaujal, Computing absorbing times via fluid approximations, Advances in Applied Probability, vol.49, p.57, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01337950

N. Gast, D. Latella, and M. Massink, A refined mean field approximation of synchronous discrete-time population models, Performance Evaluation, vol.126, pp.166-5316, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01845235

N. Gast and B. Van-houdt, A Refined Mean Field Approximation", In: Proc. ACM Meas. Anal. Comput. Syst, vol.1, issue.2, p.41, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01622054

N. Gast and B. Van-houdt, A Refined Mean Field Approximation, Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS '18, pp.113-113, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01622054

N. Gast and B. Van-houdt, Asymptotically Exact TTL-Approximations of the Cache Replacement Algorithms LRU(m) and h-LRU, 28th International Teletraffic Congress
URL : https://hal.archives-ouvertes.fr/hal-01292269

N. Gast and B. Van-houdt, Transient and Steady-state Regime of a Family of List-based Cache Replacement Algorithms, Proceedings of ACM SIGMETRICS, vol.7, pp.33-38, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01143838

N. Gast and B. Van-houdt, Transient and steady-state regime of a family of list-based cache replacement algorithms, Queueing Systems, vol.83, pp.293-328, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01143838

N. Gast and B. Van-houdt, TTL approximations of the cache replacement algorithms LRU(m) and h-LRU, Performance Evaluation, vol.117, pp.166-5316, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01622059

R. Aghajani and K. Ramanan, The hydrodynamic limit of a randomized load balancing network, The Annals of Applied Probability, vol.29, p.32, 2019.

A. Ale, P. Kirk, and M. P. Stumpf, A general moment expansion method for stochastic kinetic models, The Journal of chemical physics, vol.138, p.24, 2013.

O. I. Aven, E. G. Coffman, and Y. A. Kogan, Stochastic Analysis of Computer Storage, vol.5, pp.34-36, 1987.

F. Baccelli and T. Taillefumier, Replica-mean-field limits for intensitybased neural networks, 2019.

M. Benaim, Dynamics of stochastic approximation algorithms, Seminaire de probabilites XXXIII, p.11, 1999.

M. Benaim, Recursive algorithms, urn processes and chaining number of chain recurrent sets, Ergodic Theory and Dynamical Systems, vol.18, p.11, 1998.

M. Benaim and J. L. Boudec, On mean field convergence and stationary regime, p.12, 2011.

M. Benaim and J. Boudec, A class of mean field interaction models for computer and communication systems, Performance Evaluation, vol.65, pp.10-13, 2008.

O. Bencheikh and B. Jourdain, Bias behaviour and antithetic sampling in mean-field particle approximations of SDEs nonlinear in the sense of McKean, ESAIM: Proceedings and Surveys, vol.65, p.16, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01877002

J. Van-den, A. Berg, and . Gandolfi, LRU Is Better than FIFO under the Independent Reference Model, English. In: Journal of Applied Probability, vol.29, p.35, 1992.

M. Van-der-boor, S. C. Borst, J. S. Van-leeuwaarden, and D. Mukherjee, Scalable load balancing in networked systems: A survey of recent advances, p.49, 2018.

V. S. Borkar, Stochastic approximation: a dynamical systems viewpoint, vol.48, p.11, 2009.

L. Bortolussi and R. A. Hayden, Bounds on the deviation of discretetime Markov chains from their mean-field model, Performance Evaluation, vol.70, p.10, 2013.

J. L. Boudec, The stationary behaviour of fluid limits of reversible processes is concentrated on stationary points, p.12, 2010.

B. Boyac?, K. G. Zografos, and N. Geroliminis, An optimization framework for the development of efficient one-way car-sharing systems, European Journal of Operational Research, vol.240, p.55, 2015.

M. Bramson, Y. Lu, and B. Prabhakar, Randomized load balancing with general service time distributions, ACM SIGMETRICS performance evaluation review, vol.38, p.32, 2010.

A. Braverman and J. Dai, Stein's method for steady-state diffusion approximations of M/Ph/n+ M systems, The Annals of Applied Probability, vol.27, pp.550-581, 2017.

A. Braverman, J. Dai, and J. Feng, Stein's method for steady-state diffusion approximations: an introduction through the Erlang-A and Erlang-C models, Stochastic Systems, vol.6, pp.301-366, 2017.

A. S. Budhiraja, P. Dupuis, M. Fischer, and K. Ramanan, Limits of relative entropies associated with weakly interacting particle systems, In: Electronic Journal of Probability, vol.20, p.12, 2015.

P. Carpentier, J. Chancelier, M. D. Lara, and T. Rigaut, Time Blocks Decomposition of Multistage Stochastic Optimization Problems, vol.58, p.56, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01757113

G. Casale, Analyzing replacement policies in list-based caches with non-uniform access costs, IEEE INFOCOM 2018-IEEE Conference on Computer Communications, p.42, 2018.

A. Chaintreau, J. Boudec, and N. Ristanovic, The Age of Gossip: Spatial Mean Field Regime, SIGMETRICS Perform, vol.37, 2009.

H. Che, Y. Tung, and Z. Wang, Hierarchical Web caching systems: modeling, design and experimental results, IEEE J.Sel. A. Commun, vol.20, pp.1305-1314, 2002.

J. Cho, J. Boudec, and Y. Jiang, On the validity of the fixed point equation and decoupling assumption for analyzing the 802.11 mac protocol, ACM SIGMETRICS Performance Evaluation Review, vol.38, pp.36-38, 2010.

H. Chung, D. Freund, and D. B. Shmoys, Bike Angels: An Analysis of Citi Bike's Incentive Program, Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies, vol.55, p.47, 2018.

A. Dan and D. Towsley, An approximate analysis of the LRU and FIFO buffer replacement schemes, vol.18, p.7, 1990.

P. Dupuis and M. Fischer, On the construction of lyapunov functions for nonlinear markov processes via relative entropy, submitted for publication, p.12, 2011.

R. Fagin, Asymptotic miss ratios over independent references, Journal of Computer and System Sciences, vol.14, issue.2, pp.222-250, 1977.

R. Fagin and T. G. Price, Efficient Calculation of Expected Miss Ratios in the Independent Reference Model, In: SIAM J. Comput, vol.7, issue.6, pp.288-296, 1978.

C. Feng, J. Hillston, and D. Reijsbergen, Moment-based probabilistic prediction of bike availability for bike-sharing systems, International Conference on Quantitative Evaluation of Systems, p.53, 2016.

M. Fornasier and F. Solombrino, Mean-field optimal control, ESAIM: Control, Optimisation and Calculus of Variations, vol.20, p.56, 2014.

C. M. Fortuin, P. W. Kasteleyn, and J. Ginibre, Correlation inequalities on some partially ordered sets, Communications in Mathematical Physics, vol.22, p.35, 1971.

C. Fricker, P. Robert, and J. Roberts, A versatile and accurate approximation for LRU cache performance, 24th International Teletraffic Congress (ITC 24), vol.39, p.38, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00671937

J. Froehlich, J. Neumann, and N. Oliver, Sensing and Predicting the Pulse of the City through Shared Bicycling, In: IJCAI, vol.9, p.53, 2009.

E. Gelenbe, A Unified Approach to the Evaluation of a Class of Replacement Algorithms, IEEE Trans. Comput, vol.22, issue.6, pp.611-618, 1973.

D. George and C. Xia, Fleet-sizing and service availability for a vehicle rental system via closed queueing networks, European Journal of Operational Research, vol.211, p.53, 2011.

T. Gneiting and A. E. Raftery, Strictly proper scoring rules, prediction, and estimation, Journal of the American Statistical Association, vol.102, p.55, 2007.

J. Goutsias and G. Jenkinson, Markovian dynamics on complex reaction networks, Physics Reports, vol.529, p.24, 2013.

R. Grima, A study of the accuracy of moment-closure approximations for stochastic chemical kinetics, The Journal of chemical physics, vol.136, pp.4-616, 2012.

R. Grima, An effective rate equation approach to reaction kinetics in small volumes: Theory and application to biochemical reactions in nonequilibrium steady-state conditions, The Journal of chemical physics, vol.133, p.24, 2010.

M. C. Guenther and J. T. Bradley, Journey data based arrival forecasting for bicycle hire schemes, Analytical and Stochastic Modeling Techniques and Applications, p.53, 2013.

M. C. Guenther, A. Stefanek, and J. T. Bradley, Moment closures for performance models with highly non-linear rates, European Workshop on Performance Engineering, p.24, 2012.

I. Gurvich, Diffusion models and steady-State approximations for exponentially ergodic Markovian queues, Annals of Applied Probability, vol.24, pp.2527-2559, 2014.

J. H. Hester and D. S. Hirschberg, Self-organizing Linear Search, In: ACM Comput. Surv, vol.17, issue.3, p.34, 1985.

R. Hirade and T. Osogami, Analysis of Page Replacement Policies in the Fluid Limit, Oper. Res, vol.58, p.7, 2010.

L. Hodgkinson, R. Mcvinish, and P. K. Pollett, Normal approximations for discrete-time occupancy processes, 2018.

M. Huang, R. P. Malhamé, and P. E. Caines, Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle, Communications in Information & Systems, vol.6, issue.3, p.7, 2006.

P. Jelenkovic, Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities, Ann. Appl. Probab, vol.9, issue.2, p.7, 1999.

B. Jiang, P. Nain, and D. Towsley, On the Convergence of the TTL Approximation for an LRU Cache under Independent Stationary Request Processes, ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), vol.3, p.38, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01673272

E. Jones, T. Oliphant, and P. Peterson, SciPy: Open source scientific tools for Python, p.23, 2001.

A. Kaltenbrunner, R. Meza, J. Grivolla, J. Codina, and R. Banchs, Urban cycles and mobility patterns: Exploring and predicting trends in a bicycle-based public transport system, Pervasive and Mobile Computing, vol.6, p.53, 2010.

K. Kenthapadi and R. Panigrahy, Balanced allocation on graphs, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. SIAM, p.49, 2006.

W. F. King and I. , Analysis of Demand Paging Algorithms, pp.485-490, 1971.

V. N. Kolokoltsov, J. Li, and W. Yang, Mean field games and nonlinear Markov processes, 2011.

C. Kuehn, Moment closure-a brief review, Control of selforganizing nonlinear systems, p.24, 2016.

T. G. Kurtz, Solutions of Ordinary Differential Equations as Limits of Pure Jump Markov Processes, Journal of Applied Probability, vol.7, pp.49-58, 1970.

T. G. Kurtz, Strong approximation theorems for density dependent Markov chains, Stochastic Processes and Their Applications, vol.6, pp.223-240, 1978.

H. Kushner and G. G. Yin, Stochastic approximation and recursive algorithms and applications, vol.35, p.11, 2003.

G. Laporte, F. Meunier, and R. W. Calvo, Shared mobility systems, 4or 13, vol.4, p.55, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01792763

J. Lasry and P. Lions, Mean field games, Japanese journal of mathematics, vol.2, issue.1, pp.229-260, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00667356

D. Latella, M. Loreti, and M. Massink, On-the-fly PCTL fast meanfield approximated model-checking for self-organising coordination, Science of Computer Programming, vol.110, p.14, 2015.

J. Boudec, D. Mcdonald, and J. Mundinger, A generic mean field convergence result for systems of interacting objects, Fourth international conference on the quantitative evaluation of systems, pp.3-18, 2007.

Y. Lu, Q. Xie, G. Kliot, A. Geller, J. R. Larus et al., Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services, Performance Evaluation, vol.68, pp.1056-1071, 2011.

I. Marcovici, Automates cellulaires probabilistes et mesures spécifiques sur des espaces symboliques, p.55, 2013.

S. Méléard, Asymptotic behaviour of some interacting particle systems

B. Mckean-vlasov and . Models, Probabilistic models for nonlinear partial differential equations, pp.42-95, 1996.

W. Minnebo and B. Van-houdt, A fair comparison of pull and push strategies in large distributed networks, IEEE/ACM Transactions on Networking (TON), vol.22, pp.25-27, 2014.

M. D. Mitzenmacher, The Power of Two Random Choices in Randomized Load Balancing, vol.12, pp.25-27, 1996.

, MoReBikeS: Model Reuse with Bike rental Station data, p.53

D. Mukherjee, S. C. Borst, J. S. Van-leeuwaarden, and P. A. Whiting, Universality of power-of-d load balancing in many-server systems, Stochastic Systems, vol.8, p.49, 2018.

E. O'mahony and D. B. Shmoys, Data analysis and optimization for (citi) bike sharing, Twenty-ninth AAAI conference on artificial intelligence, p.55, 2015.

M. A. De-oca, E. Ferrante, A. Scheidler, C. Pinciroli, M. Birattari et al., Majority-rule opinion dynamics with differential latency: a mechanism for self-organized collective decision-making, Swarm Intelligence, vol.5, pp.305-327, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01406051

H. Ohtsuki, C. Hauert, E. Lieberman, and M. A. Nowak, A simple rule for the evolution of cooperation on graphs and social networks, Nature, vol.441, p.49, 2006.

R. T. Rockafellar, R. , and J. Wets, Scenarios and policy aggregation in optimization under uncertainty, Mathematics of operations research, vol.16, p.58, 1991.

D. Schnoerr, G. Sanguinetti, and R. Grima, Comparison of different moment-closure approximations for stochastic chemical kinetics, 11B610_1 (cit, vol.143, p.24, 2015.

A. Shapiro, Analysis of stochastic dual dynamic programming method, European Journal of Operational Research, vol.209, p.58, 2011.

A. Singh and J. P. Hespanha, Approximate moment dynamics for chemically reacting systems, IEEE Transactions on Automatic Control, vol.56, p.24, 2011.

D. Singhvi, S. Singhvi, P. I. Frazier, S. G. Henderson, E. O'mahony et al., Predicting bike usage for new york city's bike sharing system, Workshops at the Twenty-Ninth AAAI Conference on Artificial Intelligence, p.55, 2015.

P. Smadbeck and Y. N. Kaznessis, A closure scheme for chemical master equations, Proceedings of the National Academy of Sciences, vol.110, p.24, 2013.

D. Starobinski and D. Tse, Probabilistic Methods for Web Caching, Perform. Eval, vol.46, issue.01, p.34, 2001.

C. Stein, Approximate computation of expectations, Lecture Notes-Monograph Series, vol.7, p.10, 1986.

P. Tinnakornsrisuphap and A. M. Makowski, Limit Behavior of ECN/RED Gateways Under a Large Number of TCP Flows, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, p.13, 2003.

J. N. Tsitsiklis and K. Xu, On the power of (even a little) centralization in distributed processing, ACM SIGMETRICS Performance Evaluation Review, vol.39, pp.121-132, 2011.

N. Tsukada, R. Hirade, and N. Miyoshi, Fluid Limit Analysis of FIFO and RR Caching for Independent Reference Models". In: Perform, Eval, vol.69, issue.9, pp.166-5316, 2012.

B. Van-houdt, A mean field model for a class of garbage collection algorithms in flash-based solid state drives, ACM SIGMETRICS Performance Evaluation Review, vol.41, pp.191-202, 2013.

B. Van-houdt, Global attraction of ODE-based mean field models with hyperexponential job sizes, Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol.3, p.12, 2019.

T. Vasantam, A. Mukhopadhyay, and R. R. Mazumdar, Insensitivity of the mean-field Limit of Loss Systems Under Power-of-d Routing, p.48, 2017.

I. M. Verloop, Asymptotically optimal priority policies for indexable and nonindexable restless bandits, Ann. Appl. Probab, vol.26, p.58, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00743781

I. M. Verloop, Asymptotically optimal priority policies for indexable and nonindexable restless bandits, The Annals of Applied Probability, vol.26, p.17, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00743781

. Vls-&-stats, , p.56

N. D. Vvedenskaya, R. L. Dobrushin, and F. I. Karpelevich, Queueing system with selection of the shortest of two queues: An asymptotic approach, Problemy Peredachi Informatsii, vol.32, pp.20-34, 1996.

R. R. Weber and G. Weiss, On an index policy for restless bandits, Journal of Applied Probability, vol.27, p.58, 1990.

P. Whittle, Restless bandits: Activity allocation in a changing world, Journal of applied probability, vol.25, p.58, 1988.

Y. Yang, R. Luo, M. Li, M. Zhou, W. Zhang et al., Mean Field Multi-Agent Reinforcement Learning, Proceedings of the 35th International Conference on Machine Learning, vol.80, pp.5571-5580, 2018.

Z. Yang, J. Hu, Y. Shu, P. Cheng, J. Chen et al., Mobility modeling and prediction in bike-sharing systems, Proceedings of the 14th Annual International Conference on Mobile Systems, Applications, and Services, p.53, 2016.

L. Ying, On the Approximation Error of Mean-Field Models, Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, pp.285-297, 2016.

L. Ying, Stein's Method for Mean Field Approximations in Light and Heavy Traffic Regimes, Proceedings of the ACM on Measurement and Analysis of Computing Systems, vol.1, issue.1, p.18, 2017.

J. W. Yoon, F. Pinelli, and F. Calabrese, Cityride: a predictive bike sharing journey advisor, Mobile Data Management (MDM), 2012.

, IEEE 13th International Conference on, vol.54, p.53, 2012.