Finitely Repeated Games with Finite Automata
From MaRDI portal
Publication:2757548
DOI10.1287/moor.23.3.513zbMath0985.91011OpenAlexW2004956350MaRDI QIDQ2757548
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a979eaa758dfbca7daa26b9322b62a44f3d4b7e5
Related Items (23)
The complexity of interacting automata ⋮ An epistemic approach to explaining cooperation in the finitely repeated Prisoner's dilemma ⋮ Bounded computational capacity equilibrium ⋮ Which Logic for the Radical Anti-realist? ⋮ Computing equilibria: a computational complexity perspective ⋮ Bounded rationality and repeated network formation ⋮ Games with Symmetric Incomplete Information and Asymmetric Computational Resources ⋮ Unnamed Item ⋮ Bottom-up design of strategic options as finite automata ⋮ Completely uncoupled dynamics and Nash equilibria ⋮ Modelling equilibrium play as governed by analogy and limited foresight ⋮ Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners' dilemma game ⋮ Repeated games with bounded entropy ⋮ Playing off-line games with bounded rationality ⋮ Complexity and effective prediction ⋮ Computer science and decision theory ⋮ Perceptron versus automaton in the finitely repeated prisoner's dilemma ⋮ Codification schemes and finite automata ⋮ Strategic entropy and complexity in repeated games ⋮ Repeated Sequential Prisoner's Dilemma: The Stackleberg Variant ⋮ Unpredictability of complex (pure) strategies ⋮ Online concealed correlation and bounded rationality ⋮ Plausible cooperation
This page was built for publication: Finitely Repeated Games with Finite Automata
