Social Learning in One-Arm Bandit Problems - HEC Paris - École des hautes études commerciales de Paris Access content directly
Journal Articles Econometrica Year : 2007

Social Learning in One-Arm Bandit Problems

Eilon Solan
  • Function : Author
  • PersonId : 858141


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.
No file

Dates and versions

hal-00464609 , version 1 (17-03-2010)


  • HAL Id : hal-00464609 , version 1


Nicolas Vieille, Dinah Rosenberg, Eilon Solan. Social Learning in One-Arm Bandit Problems. Econometrica, 2007, Vol.75,n°6, pp.1591-1611. ⟨hal-00464609⟩
110 View
0 Download


Gmail Facebook X LinkedIn More