On players with a bounded number of states

DOI10.1016/0899-8256(92)90008-GzbMath0767.90097MaRDI QIDQ1187868

Christos H. Papadimitriou

Publication date: 3 August 1992

Published in: Games and Economic Behavior (Search for Journal in Brave)

zbMATH Keywords

repeated prisoner's dilemmabest response automaton

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Multistage and repeated games (91A20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Bargaining and markets: Complexity and the competitive outcome, Computing equilibria: a computational complexity perspective, On calculating the Krohn-Rhodes decomposition of automata, Bounded rationality, strategy simplification, and equilibrium, Rationality and bounded rationality, Bottom-up design of strategic options as finite automata, On finite strategy sets for finitely repeated zero-sum games., On the impact of player capability on congestion games, New complexity results about Nash equilibria, Game Theory and Strategic Complexity, Program equilibrium, Computer science and decision theory, Model-based learning of interaction strategies in multi-agent systems, Limitations of learning in automata-based systems, Unpredictability of complex (pure) strategies, Computability, complexity and economics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• The complexity of computing best-response automata in repeated games
• Repeated games with finite automata
• The Complexity of Markov Decision Processes