Finite automata play repeated prisoner's dilemma with information processing costs (Q1350653)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 984109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite automata play repeated prisoner's dilemma with information processing costs |
scientific article; zbMATH DE number 984109 |
Statements
Finite automata play repeated prisoner's dilemma with information processing costs (English)
0 references
27 February 1997
0 references
Prisoner's dilemma
0 references
Genetic algorithm
0 references
Learning
0 references
Computational complexity
0 references
0.93617296
0 references
0.87581813
0 references
0.8752225
0 references
0 references
0.8671883
0 references
0.85767597
0 references
0.8559398
0 references
0.8514946
0 references
0.8420343
0 references
0.83929396
0 references
