Earning while learning: How to run batched bandit experiments

Davud Rostam-Afschar and Jan Kemper
Additional contact information
Jan Kemper: Universität Mannheim

Italian Stata Conference 2026 from Stata Users Group

Abstract: Researchers typically collect experimental data sequentially, allowing early outcome observations and adaptive treatment assignment to reduce exposure to inferior treatments. This presentation reviews multi-armed-bandit adaptive experimental designs that balance exploration and exploitation. Because adaptively collected experimental data through bandit algorithms violate standard asymptotics, inference is challenging. We implement an estimator that yields valid heteroskedasticity-robust confidence intervals in batched bandit designs and compare coverage in Monte Carlo simulations. We introduce bbandits for Stata, a tool for designing experiments via simulation, running interactive bandit experiments, and implementing and analyzing adaptively collected data. bbandits includes three common assignment algorithms—ε-first, ε-greedy, and Thompson sampling—and supports estimation, inference, and visualization.

References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Journal Article: Earning while learning: How to run batched bandit experiments (2026)
Working Paper: Earning While Learning: How to Run Batched Bandit Experiments (2026)
Working Paper: Earning While Learning: How to Run Batched Bandit Experiments (2026)
Working Paper: Earning while learning: How to run batched bandit experiments
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:boc:ital26:04

Access Statistics for this paper

More papers in Italian Stata Conference 2026 from Stata Users Group Contact information at EDIRC.
Bibliographic data for series maintained by Christopher F Baum ().