We consider an infinitely repeated two-person zero-sum game with incomplete information on one side, in which the maximizer is the (more) informed player. Such games have value v\infty (p) for all 0\leqp\leq1. The informed player can guarantee that all along the game the average payoff per stage...

We study two-person repeated games in which a player with a restricted set of strategies plays against an unrestricted player. An exogenously given bound on the complexity of strategies, which is measured by the size of the smallest automata that implement them, gives rise to a restriction on...

The set of payoffs associated to pure uniform equilibria of a repeated game with public observation is characterized in terms of the one shot-game. The key of the result is first, a study of the effect of undetectable deviations and second, the definition of new types of punishments using...

It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that players in a game may desire to balance maximization of payoff with minimization of strategy complexity, Rubinstein and...

This paper analyzes “influence peddling” in a model that portrays interactions involving human capital transfer and collusion-building, in which each government official regulates multiple firms simultaneously. We show that there exists a collusion maximizing equilibrium between a sequence...

We characterize the class of symmetric two-player games in which tit-for-tat cannot be beaten even by very sophisticated opponents in a repeated game. It turns out to be the class of exact potential games. More generally, there is a class of simple imitation rules that includes tit-for-tat but...

The concept of program equilibrium, introduced by Howard (Theory and Decision 24(3):203–213, <CitationRef CitationID="CR13">1988</CitationRef>) and further formalised by Tennenholtz (Game Econ Behav 49:363–373, <CitationRef CitationID="CR19">2004</CitationRef>), represents one of the most ingenious and potentially far-reaching applications of ideas from computer science in game...</citationref></citationref>

The known variants of the Folk theorem characterize the sets of equilibria for repeated games. The present paper considers dominance solutions of finitely repeated games and discounted supergames with perturbed payoff functions. The paper shows that for a normal form game the set of dominance...