We analyze a toy class of two-player repeated games with two-sided incomplete information. In our model, two players are facing independent decision problems and each of them holds information that is potentially valuable to the other player. We study to what extent, and how, information can be...

We analyze a toy class of two-player repeated games with two-sided incomplete information. In effect, two players are facing independent decision problems and each of them holds information that is potentially valuable to the other player. We study to what extent, and how, information can be...

We study a general model of dynamic games with purely informational externalities. We prove that eventually all motives for experimentation disappear, and provide the exact rate at which experimentation decays. We also provide tight conditions under which players eventually reach a consensus....

We study stopping games in the setup of Neveu. We prove the existence of a uniform value (in a sense defined below), by allowing the players to use randomized strategies. In contrast with previous work, we make no comparison assumption on the payoff processes. Moreover, we prove that the value...

We study finite zero-sum stochastic games in which players do not observe the actions of their opponent. Rather, at each stage, each player observes a stochastic signal that may depend on the current state and on the pair of actions chosen by the players. We assume that each player observes the...

We provide a tight bound on the amount of experimentation under the optimal strategy in sequential decision problems. We show the applicability of the result by providing a bound on the cut-off in a one-arm bandit problem.

We study a two-player one-arm bandit problem in discrete time, in which the risky arm can have two possible types, high and low, the decision to stop experimenting is irreversible, and players observe each other's actions but not each other's payoffs. We prove that all equilibria are in cutoff...