• Graduate program
    • Why Tinbergen Institute?
    • Program Structure
    • Courses
    • Course Registration
    • Facilities
    • Admissions
    • Recent PhD Placements
  • Research
  • News
  • Events
    • Summer School
      • Behavioral Macro and Complexity
      • Econometrics and Data Science Methods for Business and Economics and Finance
      • Inequalities in Health and Healthcare
      • Introduction in Genome-Wide Data Analysis
      • Research on Productivity, Trade, and Growth
      • Summer School Business Data Science Program
    • Events Calendar
    • Tinbergen Institute Lectures
    • Annual Tinbergen Institute Conference
    • Events Archive
  • Summer School
  • Alumni
  • Times
Home | Events Archive | Model-based Sampling To Identify Customized Treatments

Model-based Sampling To Identify Customized Treatments

  • Series
    PhD Lunch Seminars
  • Speaker
  • Field
    Organizations and Markets
  • Location
  • Date and time

    April 20, 2021
    13:00 - 14:00

In laboratory and field experiments, behavioral scientists and consumer researchers are often interested in identifying the largest Conditional Average Treatment Effect (CATE) for subgroups or covariates of interest: in other words, the aim is customizing the optimal treatment. This can be difficult in high-dimensional settings, with many covariates and many treatments available. I propose a novel sampling algorithm, named Top-and-Challenger, to identify the largest CATEs using the smallest possible sample size. The data are collected in small sequential batches: based on earlier statistical outcomes, the algorithm calibrates the allocation of subsequent treatments. The algorithm is based on the following: a hierarchical spike-and-slab model performs variable selection and, if there is an effect, pools information across treatments. Then, based on the model estimates, the algorithm favors administering the top two most promising treatments. Given that the objective is identifying the most effective treatments, the Top-and-Challenger algorithm easily outperforms random allocation as well as other commonly used algorithms for multi-armed bandits, such as Thompson sampling. I also release codes to design adaptive experiments with Qualtrics, automatically adjusting treatment allocations over batches using Top-and-Challenger. In the empirical application, I apply the novel algorithm to customize “earmarking lists” for charity donations, demonstrating practical feasibility.