Complexity of games and bounded rationality
From MaRDI portal
Recommendations
Cites work
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- Finite automata play the repeated prisoner's dilemma
- Finite Rationality and Interpersonal Complexity in Repeated Games
- scientific article; zbMATH DE number 3854762 (Why is no real title available?)
- The complexity of computing best-response automata in repeated games
Cited in
(14)- Computational complexity in additive hedonic games
- On effectively computable realizations of choice functions
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
- Organisations as teams of automata
- Sum-of-squares for bounded rationality
- Precise complexity of the core in dichotomous and additive hedonic games
- Simple complexity from imitation games
- Games of constraints for complex systems
- The role of information processing cost as the foundation of bounded rationality in game theory
- Indices of Criticality in Simple Games
- Rationality, Computability, and Nash Equilibrium
- scientific article; zbMATH DE number 592681 (Why is no real title available?)
- Game theory and strategic complexity
- Rationality, computability, and complexity
This page was built for publication: Complexity of games and bounded rationality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3202087)
