Finite automata play repeated prisoner's dilemma with information processing costs (Q1350653)

From MaRDI portal
Revision as of 11:06, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finite automata play repeated prisoner's dilemma with information processing costs
scientific article

    Statements

    Finite automata play repeated prisoner's dilemma with information processing costs (English)
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    Prisoner's dilemma
    0 references
    Genetic algorithm
    0 references
    Learning
    0 references
    Computational complexity
    0 references
    0 references