Social Learning in One-Arm Bandit Problems

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. Copyright The Econometric Society 2007.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 89 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.