Evolution And The Complexity Of Finite Automata
Prisoner's dilemma played by finite automata is reviewed again using a slightly modified measure of complexity. At a first step, an equilibrium with a large number of possible outcomes is shown to hold. At a second stage, we consider a game of repeated interaction, and show that on (limit) equilibrium only cooperative actions are played. We conclude that cooperation is the result of a (complex) long interaction.
Volume (Year): 09 (2007)
Issue (Month): 04 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/igtr/igtr.shtml |
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:igtrxx:v:09:y:2007:i:04:p:731-743. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)
If references are entirely missing, you can add them using this form.