In a role game, players can condition their strategies on their player position in the base game. If the base game is strategically equivalent to a zero-sum game, the set of Nash equilibria of the role game is globally asymptotically stable under the best response dynamics. If the base game is 2...

A population of players repeatedly plays an n strategy symmetric game. Players update their strategies by sampling the behavior of k opponents and playing a best response to the distribution of strategies in the sample. Suppose the game possesses a ${1 \over k}$-dominant strategy which is...

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...