A single, long-run player plays a simultaneous-move stage game against a sequence of opponents who only play once, but observe all previous play. If there is a positive prior probability that the long-run player will always play the pure strategy he would most like to commit himself to (his...

We use the theory of learning in games to show that no-trade results do not require that gains from trade are common knowledge nor that play is a Nash Equilibrium.

In a self-confining equilibrium, each player's strategy is a best response to his beliefs about the play of his opponents and each player's beliefs are correct along the equilibrium path of play. Thus, if a self-confirming equilibrium occurs repeatedly, no player ever observes play that...

This paper studies reputation effects in games with a single long-run player whose choice of stage-game strategy is imperfectly observed by his opponents. The authors obtain lower and upper bounds on the long-run player's payoff in any Nash equilibrium of the game. If the long-run player's...

In some experiments, rational players who understand the structure of the game could improve their payoff. The authors bound the size of the observed losses in several such experiments. To do this, they suppose that the observed play resembles an equilibrium because players learn about their...