Complexity of games and bounded rationality

DOI10.1080/02331939008843631zbMath0715.90010OpenAlexW2080872500MaRDI QIDQ3202087

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

zbMATH Keywords

choice functionslimited rationality

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Formal languages and automata (68Q45) Social choice (91B14)

Related Items (2)

On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making ⋮ On effectively computable realizations of choice functions

Cites Work

• Unnamed Item
• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• Finite automata play the repeated prisoner's dilemma
• The complexity of computing best-response automata in repeated games
• Finite Rationality and Interpersonal Complexity in Repeated Games

This page was built for publication: Complexity of games and bounded rationality