Playing off-line games with bounded rationality

DOI10.1016/J.MATHSOCSCI.2008.01.005zbMATH Open1142.91309OpenAlexW2138272075MaRDI QIDQ943583FDOQ943583

Authors Jérôme Renault, Marco Scarsini, 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

zbMATH Keywords

zero-sum gamesde Bruijn graphsbounded recallperiodic sequencesoblivious strategy

Mathematics Subject Classification ID

2-person games (91A05) Rationality and learning in game theory (91A26)

Recommendations

• Bounded versus unbounded rationality: The tyranny of the weak
• The complexity of two-person zero-sum games in extensive form
• Two-person repeated games with finite automata
• On finite strategy sets for finitely repeated zero-sum games.
• Strategic entropy and complexity in repeated games

Cites work

• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 2119669 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• A Minority Game with Bounded Recall
• Binary Ring Sequences
• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• Computing and Combinatorics
• Coordination through de Bruijn sequences
• Elementary Number Theory
• Finite Rationality and Interpersonal Complexity in Repeated Games
• Finite automata play the repeated prisoner's dilemma
• Finite memory and imperfect monitoring
• Finitely many players with bounded recall in infinitely repeated games
• Finitely repeated games with finite automata
• Growth of strategy sets, entropy, and nonstationary bounded recall
• Markov Perfect Industry Dynamics With Many Firms
• On finite strategy sets for finitely repeated zero-sum games.
• On the Complexity of Coordination
• Online concealed correlation and bounded rationality
• Repeated games with \(M\)-period bounded memory (pure strategies)
• Repeated games with bounded entropy
• Repeated games with finite automata
• Repeated games with stationary bounded recall strategies
• Strategic entropy and complexity in repeated games
• The Structure of Nash Equilibrium in Repeated Games with Finite Automata
• The complexity of computing a best response automaton in repeated games with mixed strategies
• Two-person repeated games with finite automata
• m-ary closed sequences

Cited in

(3)

• Unpredictability of complex (pure) strategies
• Optimal Off-line Experimentation for Games
• The strategic value of recall

This page was built for publication: Playing off-line games with bounded rationality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943583)