C. Alós, -. Ferrer, and N. Netzer, The logit-response dynamics, Games and Economic Behavior, vol.68, issue.2, pp.413-427, 2010.

C. Alós, -. Ferrer, and N. Netzer, On the convergence of logit-response to (strict) nash equilibria, Economic Theory Bulletin, vol.5, issue.1, pp.1-8, 2017.

V. Auletta, D. Ferraioli, F. Pasquale, P. Penna, and G. Persiano, Logit dynamics with concurrent updates for local interaction potential games, Algorithmica, vol.73, issue.3, pp.511-546, 2015.

Y. Babichenko and O. Tamuz, Graphical potential games, Journal of Economic Theory, vol.163, pp.889-899, 2016.
DOI : 10.1016/j.jet.2016.03.010

URL : http://arxiv.org/pdf/1405.1481

J. P. Bailey and G. Piliouras, Multiplicative weights update in zero-sum games, ACM Conference on Economics and Computation (EC), pp.321-338, 2018.

L. E. Blume, The statistical mechanics of strategic interaction, Games and economic behavior, vol.5, issue.3, pp.387-424, 1993.

L. E. Blume, Population games, 1998.

Y. Cai and C. Daskalakis, On minmax theorems for multiplayer games, Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.217-234, 2011.

S. Chien and A. Sinclair, Convergence to approximate nash equilibria in congestion games, Games and Economic Behavior, vol.71, issue.2, pp.315-327, 2011.

P. Coucheney, S. Durand, B. Gaujal, and C. Touati, General revision protocols in best response algorithms for potential games, Netwok Games, Control and OPtimization (NetGCoop), 2014.
URL : https://hal.archives-ouvertes.fr/hal-01085077

C. Daskalakis and C. H. Papadimitriou, On a network generalization of the minmax theorem, International Colloquium on Automata, Languages, and Programming Automata (ICALP), pp.423-434, 2009.

M. Dyer and V. Mohanaraj, Pairwise-interaction games, International Colloquium on Automata, Languages and Programming (ICALP), vol.6755, pp.159-170, 2011.

D. Easley and J. Kleinberg, Networks, crowds, and markets, 2012.

G. Ellison, Learning, local interaction, and coordination, Econometrica, vol.61, issue.5, pp.1047-1071, 1993.

A. Fanelli, L. Moscardelli, and A. Skopalik, On the impact of fair best response dynamics, Proc. of the 37th international conference on Mathematical Foundations of Computer Science (MFCS), vol.7464, pp.360-371, 2012.

N. Fatès, D. Regnault, N. Schabanel, and E. Thierry, Asynchronous behavior of double-quiescent elementary cellular automata, Latin American Symposium on Theoretical Informatics (LATIN), vol.3887, pp.455-466, 2006.

D. Ferraioli, P. W. Goldberg, and C. Ventre, Decentralized dynamics for finite opinion games, Theoretical Computer Science, vol.648, pp.96-115, 2016.

D. Ferraioli and P. Penna, Imperfect best-response mechanisms, Theory of Computing Systems, vol.57, issue.3, pp.681-710, 2015.

D. Fotakis, A. C. Kaporis, and P. G. Spirakis, Atomic congestion games: Fast, myopic and concurrent. Theory of Computing Systems, vol.47, pp.38-59, 2010.

M. Kearns, M. L. Littman, and S. Singh, Graphical models for game theory, Conference on Uncertainty in Artificial Intelligence (UAI), pp.253-260, 2001.

E. Gabriel, H. Kreindler, and . Young, Rapid innovation diffusion in social networks, Proc. of the National Academy of Sciences, pp.10881-10888, 2014.

D. Asher-levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times, 2009.

F. Martinelli, Lectures on glauber dynamics for discrete spin models, Lectures on Probability Theory and Statistics, vol.1717, pp.93-191, 1999.

D. Monderer and L. S. Shapley, Potential games, Games and Economic Behavior, vol.14, issue.1, pp.124-143, 1996.

A. Montanari and A. Saberi, The spread of innovations in social networks, Proceedings of the National Academy of Sciences, vol.107, issue.47, pp.20196-20201, 2010.

P. Penna, The price of anarchy and stability in general noisy best-response dynamics, International Journal of Game Theory, vol.47, issue.3, pp.839-855, 2018.

G. Piliouras and J. S. Shamma, Optimization despite chaos: Convex relaxations to complex limit sets via poincaré recurrence, Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.861-873, 2014.

J. Rouquier, D. Regnault, and E. Thierry, Stochastic minority on graphs, Theoretical Computer Science, vol.412, issue.30, pp.3947-3963, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00539222

A. Alejandro, M. Schäffer, and . Yannakakis, Simple local search problems that are hard to solve, SIAM journal on Computing, vol.20, issue.1, pp.56-87, 1991.