Assignment-based anticlustering splits units into equal groups that are as alike as possible and scales to millions of units, but it is deterministic. Jittering the sort that defines its batches and shuffling the group labels make it an experimental design with exact randomization inference. Each of its steps turns out to be the greedy allocation of the multi-arm adaptive design ARMM, found by an assignment problem instead of a search over all orderings of the arms. In simulations with 4 to 50 arms, it balanced covariate means better than every other design whose cost is linear in the number of units, by a margin that grew with the number of arms; run on the covariates and their squares, it gave the smallest error and the most power for a nonlinear outcome in nearly every setting.
Cite: Gaurav Sood. "Randomized Assignment-Based Anticlustering for Experiments with Many Arms." https://gsood.com/research/randomized-assignment-based-anticlustering-for-experiments-with-many-arms/
BibTeX:
@misc{soodrandomized,
author = {Gaurav Sood},
title = {{Randomized Assignment-Based Anticlustering for Experiments with Many Arms}},
note = {Working paper},
url = {https://gsood.com/research/randomized-assignment-based-anticlustering-for-experiments-with-many-arms/}
}