Complexity of games and bounded rationality
From MaRDI portal
DOI10.1080/02331939008843631zbMATH Open0715.90010OpenAlexW2080872500MaRDI QIDQ3202087FDOQ3202087
Authors: Hans W. Gottinger 
Publication date: 1990
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939008843631
Recommendations
Formal languages and automata (68Q45) Social choice (91B14) Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05)
Cites Work
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- Finite Rationality and Interpersonal Complexity in Repeated Games
- Finite automata play the repeated prisoner's dilemma
- The complexity of computing best-response automata in repeated games
- Title not available (Why is that?)
Cited In (13)
- Rationality, computability, and complexity
- Sum-of-squares for bounded rationality
- On effectively computable realizations of choice functions
- Title not available (Why is that?)
- Rationality, Computability, and Nash Equilibrium
- Computational complexity in additive hedonic games
- Indices of Criticality in Simple Games
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
- The role of information processing cost as the foundation of bounded rationality in game theory
- Game theory and strategic complexity
- Simple complexity from imitation games
- Precise complexity of the core in dichotomous and additive hedonic games
- Games of constraints for complex systems
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)
