Finite automata play the repeated prisoner's dilemma
From MaRDI portal
Publication:1084866
DOI10.1016/0022-0531(86)90021-9zbMath0606.68050OpenAlexW2131724520MaRDI QIDQ1084866
Publication date: 1986
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0531(86)90021-9
Noncooperative games (91A10) Learning and adaptive systems in artificial intelligence (68T05) Cooperative games (91A12) 2-person games (91A05) Multistage and repeated games (91A20)
Related Items (only showing first 100 items - show all)
ON THE SURVIVAL OF COOPERATION UNDER DIFFERENT MATCHING SCHEMES ⋮ Bounded rationality and repeated network formation ⋮ Analogy-based expectation equilibrium ⋮ Approachability with bounded memory ⋮ Games with Symmetric Incomplete Information and Asymmetric Computational Resources ⋮ Complexity of games and bounded rationality ⋮ Spatial games and the maintenance of cooperation. ⋮ The robustness of zero-determinant strategies in iterated prisoner's dilemma games ⋮ In and out of equilibrium. II: Evolution in repeated games with discounting and complexity costs ⋮ Limits of correlation in repeated games with bounded memory ⋮ Nonlocal correlations and noise in different settings of a two-player game ⋮ Bounded Computational Capacity Equilibrium in Repeated Two-Player Zero-Sum Games ⋮ A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff ⋮ Forgetful updating and stubborn decision-makers ⋮ On the impact of player capability on congestion games ⋮ Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners' dilemma game ⋮ Strategic complexity in repeated extensive games ⋮ The role of information processing cost as the foundation of bounded rationality in game theory ⋮ The value of (bounded) memory in a changing world ⋮ Cooperation between emotional players ⋮ Stable sampling in repeated games ⋮ Game Theory and Strategic Complexity ⋮ Imperfect recall and time inconsistencies: an experimental test of the absentminded driver ``paradox ⋮ Incentive constraints in games with bounded memory ⋮ Introduction to computer science and economic theory ⋮ Algorithmic rationality: game theory with costly computation ⋮ Problem solving by heterogeneous agents ⋮ Analogies, adaptation, and anomalies ⋮ A strong anti-folk theorem ⋮ Cooperation and computability in \(n\)-player games ⋮ Computer science and decision theory ⋮ Model-based learning of interaction strategies in multi-agent systems ⋮ Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness ⋮ Controlling conditional expectations by zero-determinant strategies ⋮ Repeated Sequential Prisoner's Dilemma: The Stackleberg Variant ⋮ Introduction to learning and bounded rationality. (Preface to the special issue.) ⋮ Conditions that enable a player to surely win in sequential quantum games ⋮ Online concealed correlation and bounded rationality ⋮ Plausible cooperation ⋮ Representing the knowledge of Turing machines ⋮ Bargaining and markets: Complexity and the competitive outcome ⋮ On the optimality of monetary trading ⋮ Bounded computational capacity equilibrium ⋮ Bounded rationality, neural network and folk theorem in repeated games with discounting ⋮ Belief-based equilibrium ⋮ Simplicity of beliefs and delay tactics in a concession game ⋮ A simple model of secure public communication ⋮ Finite automata play repeated prisoner's dilemma with information processing costs ⋮ The complexity of computing best-response automata in repeated games ⋮ An axiomatization of plays in repeated games ⋮ Acceptable strategy profiles in stochastic games ⋮ Repeated games with stationary bounded recall strategies ⋮ On the complexity of repeated principal agent games ⋮ On calculating the Krohn-Rhodes decomposition of automata ⋮ On the interpretation of decision problems with imperfect recall ⋮ Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game ⋮ Evolutionarily stable strategies in the repeated prisoner's dilemma ⋮ Bounded rationality, strategy simplification, and equilibrium ⋮ Satisficing leads to cooperation in mutual interests games ⋮ Rationality and bounded rationality ⋮ Bottom-up design of strategic options as finite automata ⋮ A lower bound on computational complexity given by revelation mechanisms ⋮ Learning to play limited forecast equilibria ⋮ Modelling equilibrium play as governed by analogy and limited foresight ⋮ Bounded memory and permanent reputations ⋮ Computational economics and economic theory: Substitutes or complements? ⋮ Errors can increase cooperation in finite populations ⋮ In and out of equilibrium. I: Evolution of strategies in repeated games with discounting. ⋮ Finite rationalizability and cooperation in the finitely repeated prisoners' dilemma ⋮ Cooperative strategies in anonymous economies: an experiment ⋮ Nash equilibrium when players account for the complexity of their forecasts. ⋮ Evolutionary stability and lexicographic preferences. ⋮ How burning money requires a lot of rationality to be effective ⋮ A computer scientist looks at game theory. ⋮ Some notes on Church's thesis and the theory of games ⋮ On the non-existence of a rationality definition for extensive games ⋮ Repeated implementation and complexity considerations ⋮ Adaptation and complexity in repeated games ⋮ Fault-tolerant strategies in the iterated prisoner's dilemma ⋮ Symmetric play in repeated allocation games ⋮ Cycles in extensive form perfect information games ⋮ Computability and randomness of Nash equilibrium in infinite games ⋮ Finitely repeated prisoners' dilemma experiments without a commonly known end ⋮ Learning with bounded memory in games ⋮ Behavioral spillovers and cognitive load in multiple games: an experimental study ⋮ Towards a theory of game-based non-equilibrium control systems ⋮ On equilibria in games with imperfect recall ⋮ Finite automata equilibria with discounting ⋮ The effect of noise and average relatedness between players in iterated games ⋮ Computing equilibria in discounted dynamic games ⋮ Playing off-line games with bounded rationality ⋮ Imperfect equilibrium ⋮ Induction and the Ramsey policy ⋮ Agility in repeated games: an example ⋮ The strength of a little perfection ⋮ Information leakage forces cooperation ⋮ Repeated games, finite automata, and complexity ⋮ Computation as a correlation device ⋮ The complexity of computing a best response automaton in repeated games with mixed strategies ⋮ Coalition formation under limited communication
Cites Work
This page was built for publication: Finite automata play the repeated prisoner's dilemma
