Codification schemes and finite automata
From MaRDI portal
Publication:1005753
DOI10.1016/J.MATHSOCSCI.2008.01.007zbMATH Open1155.91311OpenAlexW2085551087MaRDI QIDQ1005753FDOQ1005753
Authors: P. 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Repeated games with finite automata
- Strategic entropy and complexity in repeated games
- Repeated games with bounded entropy
- Finitely repeated games with finite automata
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- Finite Rationality and Interpersonal Complexity in Repeated Games
- The Structure of Nash Equilibrium in Repeated Games with Finite Automata
- Title not available (Why is that?)
- Optimal Use of Communication Resources
- Empirical Distributions of Beliefs Under Imperfect Observation
- On the Complexity of Coordination
- Two-person repeated games with finite automata
- Small talk and cooperation: A note on bounded rationality
- On complexity as bounded rationality (extended abstract)
- How to play with a biased coin?
Cited In (4)
This page was built for publication: Codification schemes and finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1005753)
