Grupo - Dilema Do Prisioneiro

De Física Computacional
Edição feita às 18h32min de 20 de janeiro de 2018 por Leonardoxr (Discussão | contribs)

Ir para: navegação, pesquisa

Integrantes do grupo: Leonardo Xavier Rodrigues (262696) e Rodrigo Lopes de Sousa Silva (262705)

Introdução

Prisoner's dilemma (PD): ( R, T, S, P ) = ( b-c, b, -c, 0 ) SD: (R, T, S, P) = (b − c/2, b, b − c, 0)

      1. pay-off matrix, i.e. what player 1 gets when playing against 2:
  1. player 2
  2. defect cooperate
  3. player defect P T
  4. 1 cooperate S R



Dilema Do Prisioneiro

Dilema SnowDrift

Algorítmo De Jogos

Algorítmo Dilema do prisioneiro (População Misturada)

Algorítmo Dilema do prisioneiro (População Estruturada

Algorítmo Dilema SnowDrift

Resultados


Programas

Programas Usados[[1]]

Bibliografia

  • Dusan Misevic,Sebastian Bonhoeffer, Spatial cooperation games

https://www.ethz.ch/content/dam/ethz/special-interest/usys/ibz/theoreticalbiology/education/learningmaterials/701-1424-00L/scg.pdf

  • Game theory and physics, American Journal of Physics 73, 405 (2005)

http://dx.doi.org/10.1119/1.1848514

  • MARTIN A. NOWAK, SEBASTIAN BONHOEFFER, AND ROBERT M. MAY,Spatial games and the maintenance of cooperation

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC43892/pdf/pnas01133-0277.pdf

  • Behavioural evolution: Cooperate with thy neighbour?

https://www.nature.com/articles/428611a