2007Unpublished venueRequires access

Information Sharing in the Iterated Prisoner's Dilemma Game

Ayman Ghoneim, Hussein A. Abbass, Michael Barlow

Open publisher page 9 citations

Abstract

In the iterated prisoner's dilemma (IPD) game, players normally have access to their own history, without being able to communicate global information. In this paper, we introduce information sharing among players of the IPD game. During the co-evolutionary process, players obtain access, through information sharing, to the common strategy adopted by the majority of the population in the previous generation. An extra bit is added to the history portion in the strategy chromosome. This extra bit holds a value of 0 if the decisions to cooperate were greater than the decisions to defect in the last generation and 1 if otherwise. We show that information sharing alters the dynamics of the IPD game

About this research paper

What this paper is about

In the iterated prisoner's dilemma (IPD) game, players normally have access to their own history, without being able to communicate global information. In this paper, we introduce information sharing among players of the IPD game. During the co-evolutionary process, players obtain access, through information sharing, to the common strategy adopted by the majority of the population in the previous generation. An extra bit is added to the history portion in the strategy chromosome. This extra bit holds a value of 0 if the decisions to cooperate were greater than the decisions to defect in the last generation and 1 if otherwise. We show that information sharing alters the dynamics of the IPD game

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In the iterated prisoner's dilemma (IPD) game, players normally have access to their own history, without being able to communicate global information. In this paper, we introduce information sharing among players of the IPD game. During the co-evolutionary process, players obtain access, through information sharing, to the common strategy adopted by the majority of the population in the previous generation. An extra bit is added to the history portion in the strategy chromosome. This extra bit holds a value of 0 if the decisions to cooperate were greater than the decisions to defect in the last generation and 1 if otherwise. We show that information sharing alters the dynamics of the IPD game

Key concepts: Prisoner's dilemma, Computer science, Iterated function, Dilemma, Information sharing, Population, Complete information, Game theory

Related papers

Back to paper searchBrowse research topicsOriginal source
Information Sharing in the Iterated Prisoner's Dilemma Game — Research Paper | ScholarLens