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

DOI10.1016/0165-1889(94)00848-1zbMath0875.90347MaRDI QIDQ1350653

Teck-Hua Ho

Publication date: 27 February 1997

Published in: Journal of Economic Dynamics \& Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-1889(94)00848-1

zbMATH Keywords

Genetic algorithm; Learning; Computational complexity; Prisoner's dilemma

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

91A20: Multistage and repeated games

Related Items

An analytical framework for the Prisoner’s Dilemma: Finite state machine representation for interactions between deterministic strategies, A model of learning and emulation with artificial adaptive agents

Cites Work

• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• Evolutionary stability in extensive two-person games
• Money as a medium of exchange in an economy with artificially intelligent agents
• Finite automata play the repeated prisoner's dilemma
• The complexity of computing best-response automata in repeated games
• Rational cooperation in the finitely repeated prisoners' dilemma
• Evolution, learning, and economic behavior
• Adaptive and sophisticated learning in normal form games
• Repeated games, finite automata, and complexity
• Evolutionary stability in repeated games played by finite automata
• Communication, computability, and common interest games
• Small talk and cooperation: A note on bounded rationality
• Finite Rationality and Interpersonal Complexity in Repeated Games
• The Structure of Nash Equilibrium in Repeated Games with Finite Automata
• Evolutionary Games in Economics
• The Folk Theorem in Repeated Games with Discounting or with Incomplete Information
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item