On complexity as bounded rationality (extended abstract)

DOI10.1145/195058.195445zbMath1345.68216OpenAlexW2092183701MaRDI QIDQ2817667

Mihalis Yannakakis, Christos H. Papadimitriou

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195445

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Multistage and repeated games (91A20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Computing equilibria: a computational complexity perspective ⋮ A general criterion and an algorithmic framework for learning in multi-agent systems ⋮ Bounded rationality, strategy simplification, and equilibrium ⋮ The robustness of zero-determinant strategies in iterated prisoner's dilemma games ⋮ Coalitions among computationally bounded agents ⋮ Logical omniscience ⋮ Mirror games against an open book player ⋮ On the impact of player capability on congestion games ⋮ Worst-case equilibria ⋮ A Solution Concept Related to “Bounded Rationality” for some Two-Echelon Models ⋮ Repeated games with bounded entropy ⋮ On equilibria in games with imperfect recall ⋮ Introduction to computer science and economic theory ⋮ Algorithmic rationality: game theory with costly computation ⋮ Computer science and decision theory ⋮ Bargaining with limited computation: Deliberation equilibrium ⋮ Codification schemes and finite automata ⋮ On composition of bounded-recall plans ⋮ Strategic entropy and complexity in repeated games ⋮ Distributed Algorithms for Aggregative Games on Graphs ⋮ Online concealed correlation and bounded rationality