We study a game of strategic experimentation with two-armed bandits where the risky arm distributes lump-sum payoffs according to a Poisson process. Its intensity is either high or low, and unknown to the players. We consider Markov perfect equilibria with beliefs as the state variable. As the...

We analyze continuous-time games of strategic experimentation with two-armedbandits when there is no discounting. We show that for all specifications of priorbeliefs and payoff-generating processes that satisfy some separability condition, the unique symmetric Markov perfect equilibrium can be...

We consider two players facing identical discrete-time bandit problems with a safe and a risky arm. In any period, the risky arm yields either a success or a failure, and the first success reveals the risky arm to dominate the safe one. When payoffs are public information, the ensuing free-rider...

We analyze a two-player game of strategic experimentation with two-armed bandits. Each player has to decide in continuous time whether to use a safe arm with a known payoff or a risky arm whose likelihood of delivering payoffs is initially unknown. The quality of the risky arms is perfectly...

This paper studies strongly symmetric equilibria (SSE) in continuous-time games of strategic experimentation with Poisson bandits. SSE payoffs can be studied via two functional equations similar to the HJB equation used for Markov equilibria. This is valuable for three reasons. First, these...

We study a continuous-time game of strategic experimentation in which the players try to assess the failure rate of some new equipment or technology. Breakdowns occur at the jump times of a Poisson process whose unknown intensity is either high or low. In marked contrast to existing models, we...

The paper analyzes a dynamic model of rational strategic learning in a network. It complements existing literature by providing a detailed picture of short-run dynamics in a game of strategic experimentation where agents are located in a social network. We show that the delay in information...

In the dynamic game we analyze, players are the members of a fixed network. Everyone is initially endowed with an information item that he is the only player to hold. Players are offered a finite number of periods to centralize the initially dispersed items in the hands of any one member of the...

We explore in an equilibrium framework whether games with multiple Nash equilibria are easier to play when players can communicate. We consider two variants, modelling talk about future plans and talk about past actions. The language from which messages are chosen is endogenous, messages are...

Games with multiple Nash equilibria are believed to be easier to play if players can communicate. We present a simple model of communication in games and investigate the importance of when communication takes place. Sending a message before play captures talk about intentions, after play...