This article explores the conditions under which agents will cooperate in one-shot two-player Prisoner's Dilemma games if they are able to withdraw from playing the game and can learn to recognize the trustworthiness of their opponents. When the agents display a number of symbols and they learn which symbols are important to estimate the trustworthiness of others, agents will evolve who cooperate in games in line with experimental observations. These results are robust to significant levels of mutations and errors made by the players.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 65 (2008) Issue (Month): 3-4 (March) Pages: 458-471 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
For technical questions regarding this item, or to correct its listing, contact: (Heidi Boesdal).
Related research
Keywords:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)