Scholion.ai

Social Learning in One-Arm Bandit Problems

Dinah Rosenberg, Eilon Solan, Nicolas Vieille

Econometrica · 2007 · Volume 75 · Issue 6

DOI: 10.1111/j.1468-0262.2007.00807.x

Abstract

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 strategies and provide several qualitative results on the sequence of cutoffs.

Keywords

Social learning, one-arm bandit, equilibrium, cutoff strategies

Enable JavaScript for citation tools and additional paper interactions.