D. Angluin, J. Aspnes, D. Eisenstat, and E. Ruppert, The computational power of population protocols, Distributed Computing, vol.34, issue.3, pp.279-304, 2007.
DOI : 10.1007/s00446-007-0040-2

D. Angluin, J. Aspnes, M. Chan, M. J. Fischer, H. Jiang et al., Stably Computable Properties of Network Graphs, DCOSS, pp.63-74, 2005.
DOI : 10.1007/11502593_8

D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta, Computation in networks of passively mobile finite-state sensors, PODC, pp.290-299, 2004.

D. Angluin, J. Aspnes, and D. Eisenstat, Stably computable predicates are semilinear, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.292-299, 2006.
DOI : 10.1145/1146381.1146425

D. Angluin, J. Aspnes, M. J. Fischer, and H. Jiang, Self-stabilizing population protocols, OPODIS'2005, pp.79-90, 2005.
DOI : 10.1007/11795490_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.589

R. M. Axelrod, The evolution of cooperation, Science, vol.211, issue.4489, 1984.
DOI : 10.1126/science.7466396

J. Beauquier, J. Burman, J. Clément, and S. Kutten, On utilizing speed in networks of mobile agents, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.305-314, 2010.
DOI : 10.1145/1835698.1835775
URL : https://hal.archives-ouvertes.fr/inria-00531438

K. Binmore, Fun and Games. D.C. Heath and Company, 1992.

O. Bournez, J. Chalopin, J. Cohen, and X. Koegler, Playing With Population Protocols, The Complexity of a Simple Program, 2008.
DOI : 10.4204/EPTCS.1.1
URL : https://hal.archives-ouvertes.fr/inria-00330344

C. Delporte-gallet, H. Fauconnier, R. Guerraoui, and E. Ruppert, When Birds Die: Making Population Protocols Fault-Tolerant, DCOSS, pp.51-66, 2006.
DOI : 10.1007/11776178_4
URL : https://hal.archives-ouvertes.fr/hal-00154871

M. E. Dyer, L. Goldberg, C. S. Greenhill, G. Istrate, and M. Jerrum, Convergence of the Iterated Prisoner's Dilemma Game, Combinatorics, Probability and Computing, vol.11, issue.02, 2002.
DOI : 10.1017/S096354830100503X

L. Fribourg, S. Messika, and C. Picaronny, Coupling and self-stabilization, Distributed Computing, vol.25, issue.2, pp.221-232, 2006.
DOI : 10.1007/s00446-005-0142-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.2505

D. Fudenberg and D. K. Levine, The Theory of Learning in Games. Number 624, 1996.

J. Hofbauer and K. Sigmund, Evolutionary game dynamics, Bulletin of the American Mathematical Society, vol.40, issue.04, pp.479-519, 2003.
DOI : 10.1090/S0273-0979-03-00988-1

G. Istrate, M. V. Marathe, and S. S. Ravi, Adversarial scheduling in evolutionary game dynamics. CoRR, abs/0812, 1194.

A. D. Jaggard, M. Schapira, and R. N. Wright, Distributed computing with adaptive heuristics, Proceedings of Innovations in Computer Science ICS, 2011.

D. Kraines and V. Kraines, Pavlov and the prisoner's dilemma, Theory and Decision, vol.248, issue.5, pp.47-79, 1988.
DOI : 10.1007/BF00134056

O. Michail, I. Chatzigiannakis, and P. G. Spirakis, New Models for Population Protocols, Synthesis Lectures on Distributed Computing Theory, vol.2, issue.1, 2011.
DOI : 10.2200/S00328ED1V01Y201101DCT006

M. Nowak and K. Sigmund, A strategy of win-stay, lose-shift that outperforms tit-for-tat in the Prisoner's Dilemma game, Nature, vol.364, issue.6432, pp.36456-58, 1993.
DOI : 10.1038/364056a0

M. Presburger, Uber die Vollstandig-keit eines gewissen systems der Arithmetik ganzer Zahlen, welchemdie Addition als einzige Operation hervortritt. Comptesrendus du I Congres des Mathematicians des Pays Slaves, pp.92-101, 1929.

W. Jörgen and . Weibull, Evolutionary Game Theory, 1995.