A learning rule is uncoupled if a player does not condition his strategy on the opponent's payoffs. It is radically uncoupled if a player does not condition his strategy on the opponent's actions or payoffs. We demonstrate a family of simple, radically uncoupled learning rules whose...

In this paper, I analyze stochastic adaptation in finite n-player games played by heterogeneous populations of myopic best repliers, better repliers and imitators. In each period, one individual from each of n populations, one for each player role, is drawn to play and chooses a pure strategy...

This paper considers finitely repeated games played by procedurally rational players, who sample their available alternatives and use realized payoffs as a basis for strategy selection. The corresponding solution concept is that of (payoff) sampling equilibrium, which is a distribution over...

We illustrate one way in which a population of boundedly rational individuals can learn to play an approximate Nash equilibrium. Players are assumed to make strategy choices using a combination of imitation and innovation. We begin by looking at an imitation dynamic and provide conditions under...

We demonstrate that one should not expect convergence of the proposals to the subgame perfect Nash equilibrium offer in standard ultimatum games. First, imposing strict experimental control of the behavior of the receiving players and focusing on the behavior of the proposers, we show...

We define a finite-horizon repeated network formation game with consent, and study the differences induced by different levels of individual rationality. We prove that perfectly rational players will remain unconnected at the equilibrium, while nonempty equilibrium networks may form when,...

In this paper we model an evolutionary process with perpetual random shocks, where individuals sample population-specific strategy and payoff realizations and imitate the most successful behavior. For finite n-player games we prove that in the limit, as the perturbations tend to zero, only...

This work studies the value of two-person zero-sum repeated games in which at least one of the players is restricted to (mixtures of) bounded recall strategies. A (pure) k-recall strategy is a strategy that relies only on the last k periods of history. This work improves previous results...