Codification schemes and finite automata

DOI10.1016/j.mathsocsci.2008.01.007zbMath1155.91311OpenAlexW2085551087MaRDI QIDQ1005753

Penélope Hernández, Amparo Urbano

Publication date: 10 March 2009

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2008.01.007

zbMATH Keywords

complexityrepeated gamesfinite automatacodification

Mathematics Subject Classification ID

Cooperative games (91A12) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• Two-person repeated games with finite automata
• Repeated games with finite automata
• Strategic entropy and complexity in repeated games
• Small talk and cooperation: A note on bounded rationality
• How to play with a biased coin?
• Repeated games with bounded entropy
• Finitely Repeated Games with Finite Automata
• On complexity as bounded rationality (extended abstract)
• Finite Rationality and Interpersonal Complexity in Repeated Games
• The Structure of Nash Equilibrium in Repeated Games with Finite Automata
• Optimal Use of Communication Resources
• Empirical Distributions of Beliefs Under Imperfect Observation
• On the Complexity of Coordination

This page was built for publication: Codification schemes and finite automata