Bounded computational capacity equilibrium
From MaRDI portal
Publication:281361
DOI10.1016/j.jet.2016.02.007zbMath1369.91020arXiv1008.2632OpenAlexW2100195774MaRDI QIDQ281361
Penélope Hernández, Eilon Solan
Publication date: 11 May 2016
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.2632
Related Items (4)
Games with Symmetric Incomplete Information and Asymmetric Computational Resources ⋮ Bounded Computational Capacity Equilibrium in Repeated Two-Player Zero-Sum Games ⋮ Equilibrium payoffs in repeated two-player zero-sum games of finite automata ⋮ Systems of Bounded Rational Agents with Information-Theoretic Constraints
Cites Work
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- Finite automata play a repeated extensive game
- Finite automata play the repeated prisoner's dilemma
- Finite automata equilibria with discounting
- Repeated games, finite automata, and complexity
- 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
- Repeated games with bounded entropy
- Finitely Repeated Games with Finite Automata
- The Structure of Nash Equilibrium in Repeated Games with Finite Automata
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounded computational capacity equilibrium
