The "off line learning approximation" in continuous time neural networks: An adiabatic theorem. - Michel Benaïm (Neural Networks, 1993)

On Functional Approximation with Normalized Gaussian Units. - Michel Benaïm (Neural Comput., 1994)

Convergence Theorems for Hybrid Learning Rules. - Michel Benaïm (Neural Comput., 1995)

A two armed bandit type problem. - Michel Benaïm; Gérard Ben Arous (Int. J. Game Theory, 2003)

Stochastic Approximations and Differential Inclusions. - Michel Benaïm; Josef Hofbauer; Sylvain Sorin (SIAM J. Control. Optim., 2005)

Stochastic Approximations and Differential Inclusions, Part II: Applications. - Michel Benaïm; Josef Hofbauer; Sylvain Sorin (Math. Oper. Res., 2006)

A class of mean field interaction models for computer and communication systems. - Michel Benaïm; Jean-Yves Le Boudec (Perform. Evaluation, 2008)

Learning in games with unstable equilibria. - Michel Benaïm; Josef Hofbauer; Ed Hopkins (J. Econ. Theory, 2009)

A Class of Self-Interacting Processes with Applications to Games and Reinforced Random Walks. - Michel Benaïm; Olivier Raimond (SIAM J. Control. Optim., 2010)

On Mean Field Convergence and Stationary Regime - Michel Benaïm; Jean-Yves Le Boudec (CoRR, 2011)

Perturbations of Set-Valued Dynamical Systems, with Applications to Game Theory. - Michel Benaïm; Josef Hofbauer; Sylvain Sorin (Dyn. Games Appl., 2012)

Consistency of Vanishingly Smooth Fictitious Play. - Michel Benaïm; Mathieu Faure (Math. Oper. Res., 2013)

A generalized Pólya's urn with graph based interactions. - Michel Benaïm; Itai Benjamini; Jun Chen; Yuri Lima 002 (Random Struct. Algorithms, 2015)