The role of information processing cost as the foundation of bounded rationality in game theory
From MaRDI portal
Publication:2442560
DOI10.1016/0165-1765(96)00828-2zbMath1284.91063OpenAlexW2024549569MaRDI QIDQ2442560
Publication date: 3 April 2014
Published in: Economics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0165-1765(96)00828-2
Noncooperative games (91A10) Other game-theoretic models (91A40) Rationality and learning in game theory (91A26)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- Finite automata play the repeated prisoner's dilemma
- Bounded rationality. A Simon-like explication
- Computability, complexity and economics
- Polynomially bounded rationality
- Bounded rationality, neural network and folk theorem in repeated games with discounting
- Rationalizable Strategic Behavior
- Search Decisions with Limited Memory
- Finite Rationality and Interpersonal Complexity in Repeated Games
- Rationality, Computability, and Nash Equilibrium
This page was built for publication: The role of information processing cost as the foundation of bounded rationality in game theory