scientific article
From MaRDI portal
Publication:3956774
zbMath0493.90094MaRDI QIDQ3956774
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveycomplete informationrepeated gamescooperative behaviourincomplete informationequilibrium pointsupergamen-person gameoptimality conceptseffect of repetitionnon-cooperative behaviourrevelation and concealment
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Multistage and repeated games (91A20)
Related Items (71)
A one-period memory folk theorem for multilateral bargaining games ⋮ The complexity of interacting automata ⋮ On continuous reaction function equilibria in duopoly supergames with mean payoffs ⋮ Bounded memory folk theorem ⋮ Finite automata play the repeated prisoner's dilemma ⋮ Undiscounted equilibrium payoffs of repeated games with a continuum of players ⋮ Individually rational pure strategies in large games ⋮ Finite automata play repeated prisoner's dilemma with information processing costs ⋮ The evolution of cooperative strategies for asymmetric social interactions ⋮ Strong equilibria of a repeated game with randomized strategies ⋮ Approachability with bounded memory ⋮ Elementary subpaths in discounted stochastic games ⋮ Repeated games with stationary bounded recall strategies ⋮ On calculating the Krohn-Rhodes decomposition of automata ⋮ Evolutionarily stable strategies in the repeated prisoner's dilemma ⋮ A continuous-time average-cost flexible manufacturing and operator scheduling model solved by deconvexification over time ⋮ Reciprocal cooperation in the prisoner's dilemma repeated with random horizon ⋮ Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma ⋮ Limits of correlation in repeated games with bounded memory ⋮ A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff ⋮ Folk theorems with bounded recall under (almost) perfect monitoring ⋮ The evolution of rationality and the Red Queen. ⋮ A counterexample to the folk theorem with discounting ⋮ On the presence and absence of free entry in oligopoly equilibria ⋮ Strategic complexity in repeated extensive games ⋮ Preplay negotiations and the prisoner's dilemma ⋮ Robust and scalable middleware for selfish-computer systems ⋮ Symmetric play in repeated allocation games ⋮ Cooperation between emotional players ⋮ Set-valued games and mixed-strategy equilibria in discounted supergames ⋮ A generalized approach to belief learning in repeated games ⋮ The strategic value of recall ⋮ The repeated public goods game: a solution using tit-for-tat and the Lindahl point ⋮ The effect of noise and average relatedness between players in iterated games ⋮ On Finding Large Sets of Rewards in Two-Player ETP–ESP Games ⋮ Repeated Games with Complete Information ⋮ Zero-Sum Two Person Games ⋮ Game Theory and Strategic Complexity ⋮ On players with a bounded number of states ⋮ Information leakage forces cooperation ⋮ Repeated games, finite automata, and complexity ⋮ The graph of Prisoners' Dilemma supergame payoffs as a function of the discount factor ⋮ Informational requirements and strategic complexity in repeated games ⋮ Bounded versus unbounded rationality: The tyranny of the weak ⋮ Nash equilibrium strategies in repeated games with and without cost of implementation ⋮ Evolutionary stability in repeated games played by finite automata ⋮ Cooperation and computability in \(n\)-player games ⋮ Rationality and bounded information in repeated games, with application to the iterated prisoner's dilemma ⋮ Computer science and decision theory ⋮ Should I remember more than you? Best responses to factored strategies ⋮ A folk theorem for repeated games with unequal discounting ⋮ Perceptron versus automaton in the finitely repeated prisoner's dilemma ⋮ Repeated games with one-memory ⋮ Partners or rivals? Strategies for the iterated prisoner's dilemma ⋮ The Complexity of Nash Equilibria in Infinite Multiplayer Games ⋮ The Big Match in Small Space ⋮ Growth of strategy sets, entropy, and nonstationary bounded recall ⋮ The evolution of stochastic strategies in the prisoner's dilemma ⋮ Strategic entropy and complexity in repeated games ⋮ Evolved perception and behaviour in oligopolies ⋮ More on the `anti-folk theorem' ⋮ Communication, computability, and common interest games ⋮ Forecasting errors and bounded rationality: An example ⋮ Unanimity games and Pareto optimality ⋮ Unpredictability of complex (pure) strategies ⋮ Online concealed correlation and bounded rationality ⋮ Stochastic strategies in the prisoner's dilemma ⋮ Cooperation and bounded recall ⋮ Plausible cooperation ⋮ Uniqueness and efficiency of Nash equilibrium in a family of randomly generated repeated games. ⋮ Correlated equilibria in a class of repeated games with incomplete information
This page was built for publication:
