Playing off-line games with bounded rationality
From MaRDI portal
Publication:943583
DOI10.1016/j.mathsocsci.2008.01.005zbMath1142.91309OpenAlexW2138272075MaRDI QIDQ943583
Marco Scarsini, Jérôme Renault, Tristan Tomala
Publication date: 10 September 2008
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: http://publications.ut-capitole.fr/3131/1/offline20071121.pdf
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- Growth of strategy sets, entropy, and nonstationary bounded recall
- Finite automata play the repeated prisoner's dilemma
- Repeated games with stationary bounded recall strategies
- The complexity of computing a best response automaton in repeated games with mixed strategies
- Repeated games with \(M\)-period bounded memory (pure strategies)
- Finitely many players with bounded recall in infinitely repeated games
- On finite strategy sets for finitely repeated zero-sum games.
- Two-person repeated games with finite automata
- Repeated games with finite automata
- Strategic entropy and complexity in repeated games
- Repeated games with bounded entropy
- Online concealed correlation and bounded rationality
- m-ary closed sequences
- Finite memory and imperfect monitoring
- Coordination through de Bruijn sequences
- Finitely Repeated Games with Finite Automata
- Binary Ring Sequences
- Markov Perfect Industry Dynamics With Many Firms
- Finite Rationality and Interpersonal Complexity in Repeated Games
- The Structure of Nash Equilibrium in Repeated Games with Finite Automata
- Elementary Number Theory
- A Minority Game with Bounded Recall
- On the Complexity of Coordination
- Computing and Combinatorics
This page was built for publication: Playing off-line games with bounded rationality
