scientific article
From MaRDI portal
Publication:3351186
zbMath0727.90105MaRDI QIDQ3351186
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyrepeated gamesautomatonNash-equilibrium\(\epsilon \) -equilibriumcomplexity strategiessubgame perfect \(\epsilon \) -equilibrium
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Multistage and repeated games (91A20)
Related Items (31)
The complexity of interacting automata ⋮ Bounded computational capacity equilibrium ⋮ Computing equilibria: a computational complexity perspective ⋮ Bounded rationality, strategy simplification, and equilibrium ⋮ Limits of correlation in repeated games with bounded memory ⋮ Directed graphical structure, Nash equilibrium, and potential games ⋮ On finite strategy sets for finitely repeated zero-sum games. ⋮ Randomization and simplification in dynamic decision-making. ⋮ The role of information processing cost as the foundation of bounded rationality in game theory ⋮ Arrow's theorem, countably many agents, and more visible invisible dictators ⋮ Symmetric play in repeated allocation games ⋮ Finite automata equilibria with discounting ⋮ Equilibrium paths in discounted supergames ⋮ The strength of a little perfection ⋮ Algorithmic rationality: game theory with costly computation ⋮ Limited focus in dynamic games ⋮ A strong anti-folk theorem ⋮ Computer science and decision theory ⋮ Should I remember more than you? Best responses to factored strategies ⋮ Perceptron versus automaton in the finitely repeated prisoner's dilemma ⋮ The myth of the folk theorem ⋮ Repeated games with one-memory ⋮ Partners or rivals? Strategies for the iterated prisoner's dilemma ⋮ Reactive strategies: an inch of memory, a mile of equilibria ⋮ The Big Match in Small Space ⋮ Strategic entropy and complexity in repeated games ⋮ The core of a repeated \(n\)-person cooperative game ⋮ Repeated games with \(M\)-period bounded memory (pure strategies) ⋮ Online concealed correlation and bounded rationality ⋮ Little perfection and complexity ⋮ Computability, complexity and economics
This page was built for publication:
