Although complete randomization ensures covariate balance on average, the chance of
observing significant differences between treatment and control covariate distributions …

The design of experiments involves a compromise between covariate balance and
robustness. This article provides a formalization of this tradeoff and describes an …

In this paper, we study the design and analysis of experiments conducted on a set of units
over multiple time periods in which the starting time of the treatment may vary by unit. The …

Algorithmic obstructions in the random number partitioning problem Page 1 The Annals of
Applied Probability 2023, Vol. 33, No. 6B, 5497–5563 https://doi.org/10.1214/23-AAP1953 …

The seminal work of considers rerandomization for all the units at one time. In practice,
however, experimenters may have to rerandomize units sequentially. For example, a …

Motivated by problems in controlled experiments, we study the discrepancy of random
matrices with continuous entries where the number of columns $ n $ is much larger than the …

There is a long debate in experimental design between the classic randomization design of
Fisher, Yates, Kempthorne, Cochran, and those who advocate deterministic assignments …

Classical randomized experiments, equipped with randomization-based inference, provide
assumption-free inference for treatment effects. They have been the gold standard for …

Blocking is commonly used in randomized experiments to increase efficiency of estimation.
A generalization of blocking removes allocations with imbalance in covariate distributions …

We initiate the study of the algorithmic problem of certifying lower bounds on the
discrepancy of random matrices: given an input matrix $ A\in\mathbb {R}^{m\times n} …