Ostracism for improving cooperation in the iterated prisoner's dilemma game

Research output: Contribution to conferencePaperpeer-review

5 Scopus citations


This paper considers methods for improving cooperation in the Iterated Prisoner's Dilemma (IPD) game. We consider two previous efforts for improving cooperation that use a bias in selecting opponents in the IPD game: the space-based approach and the tag-based approach. In the biased opponent selection mechanism, opponents are selected using a bias based on, for example, a normal distribution function around the player who tries to choose opponents; i.e., the closer a prospective opponent is to a player, the higher the probability that it will be chosen as an opponent by that player. The cooperation can be achieved by promoting the emergence of cooperators' clusters; thus, cooperators will play the game with the cooperators within the «kin dusters». Our research shows that use of ostracism schemes that expel dissimilar players from the kin clusters can greatly support the biased opponent selection mechanism and therefore promote cooperation in the overall environment.

Original languageEnglish (US)
Number of pages6
StatePublished - 1999
Externally publishedYes
Event1999 Congress on Evolutionary Computation, CEC 1999 - Washington, DC, United States
Duration: Jul 6 1999Jul 9 1999


Other1999 Congress on Evolutionary Computation, CEC 1999
Country/TerritoryUnited States
CityWashington, DC

ASJC Scopus subject areas

  • Computational Mathematics


Dive into the research topics of 'Ostracism for improving cooperation in the iterated prisoner's dilemma game'. Together they form a unique fingerprint.

Cite this