Learning to cooperate in the Iterated Prisoner's Dilemma by means of social attachments

15Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The Iterated Prisoner's Dilemma (IPD) has been used as a paradigm for studying the emergence of cooperation among individual agents. Many computer experiments show that cooperation does arise under certain conditions. In particular, the spatial version of the IPD has been used and analyzed to understand the role of local interactions in the emergence and maintenance of cooperation. It is known that individual learning leads players to the Nash equilibrium of the game, which means that cooperation is not selected. Therefore, in this paper we propose that when players have social attachment, learning may lead to a certain rate of cooperation. We perform experiments where agents play the spatial IPD considering social relationships such as belonging to a hierarchy or to coalition. Results show that learners end up cooperating, especially when coalitions emerge. © 2011 The Brazilian Computer Society.

Cite

CITATION STYLE

APA

Bazzan, A. L. C., Peleteiro, A., & Burguillo, J. C. (2011). Learning to cooperate in the Iterated Prisoner’s Dilemma by means of social attachments. Journal of the Brazilian Computer Society, 17(3), 163–174. https://doi.org/10.1007/s13173-011-0038-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free