Parallel Simulations of the Iterated n-Player Prisoner’s Dilemma

Conference paper

DOI: 10.1007/978-3-319-31447-1_6

Volume 9568 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Queiroz D., Sichman J. (2016) Parallel Simulations of the Iterated n-Player Prisoner’s Dilemma. In: Gaudou B., Sichman J. (eds) Multi-Agent Based Simulation XVI. MABS 2015. Lecture Notes in Computer Science, vol 9568. Springer, Cham

Abstract

We present in this work some extended results to those originally published in [8], when we simulated the Iterated n-Player Prisoner’s Dilemma in a sequential computer. In [12], we presented a solution to parallel agent-based simulations where agents need to interact with all its neighbours in a von Neumann neighbourhood, aiming to improve the usage of computational resources. By using such parallel techniques, we could better study the effect of several additional parameters of the Iterated n-Player Prisoner’s Dilemma simulation, like the grid dimension and the error rate.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Laboratório de Técnicas Inteligentes, PCSEscola Politécnica da Universidade de São PauloSão PauloBrazil