This paper initiates the study of long term interactions where players' bounded rationality varies over time. Time dependent bounded rationality is reflected in part in the number $\psi(t)$ of distinct strategies in the first $t$-stages. We examine how the growth rate of $\psi_i(t)$ affects...

A (pure) strategy in a repeated game is a mapping from histories, or, more generally, signals, to actions. We view the implementation of such a strategy as a computational procedure and attempt to capture in a formal model the following intuition: as the game proceeds, the amount of information...

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

We show that local potential maximizer ([15]) with constant weights is stochastically stable in the log-linear dynamics provided that the payoff function or the associated local potential function is supermodular. We illustrate and discuss, through a series of examples, the use of our main...

We show that local potential maximizer ([15]) with constant weights is stochas- tically stable in the log-linear dynamics provided that the payo® function or the associated local potential function is supermodular. We illustrate and discuss, through a series of examples, the use of our main...