Package: randomizr 2.0.1

A hypothetical experiment | Simple random assignment | Complete random assignment | Simple and complete random assignment compared | Block random assignment | Balanced random assignment | Clustered assignment | Blocked and clustered assignment | Calculating probabilities of assignment | Best practices | Random assignment procedure = Random assignment function | Check probabilities of assignment directly | Save your random assignment

Terms used in this article | balanced_ra guarantees | 1. Demonstration | Uneven blocks | Balancing a covariate | 2. Logic | Three C++ implementations | 2.1 Two-arm pivot | One draw: four units, target 2.3 | Leftover pairing across blocks | C++: cube_pivot_pass | 2.2 Multi-arm cube | One draw: four units, three arms | C++: the fair bet, the window, and per-block landing | 2.3 Cube-on-X | One draw: $x=(1,2,3,6)$, $p_i=1/2$ | C++: the main loop | C++: finding a direction | 3. Examples | 3.1 One winner from unequal chances | 3.2 Two-arm counts with blocks | 3.3 Three arms, no blocks | 3.4 Heterogeneous probabilities | 3.5 Clusters | Clusters with a covariate | 3.6 formula plus blocks | 3.7 Multi-arm totals with blocks are not tight | 3.8 An attainable covariate total that is still missed | 3.9 An example of an attainable covariate total that never appears at all | 4. Analysing an assignment | 4.1 Weight by the probability of the condition received | 4.2 Standard errors: fine without formula, conservative with it | 5. Declaring the design | 6. Caveats | References

Written with AI, and checked accordingly | What a guarantee looks like here | The designs being checked | What randomizr promises | What this does not cover