Related Experiment Video
Updated: Jun 15, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
Published on: March 1, 2022
Comparisons of minimization and Atkinson's algorithm
Stephen Senn1, Vladimir V Anisimov, Valerii V Fedorov
1Department of Statistics, University of Glasgow, Glasgow G12 8QW, U.K. stephen@stats.gla.ac.uk
Abstract:
Some general points regarding efficiency in clinical trials are made. Reasons as to why fitting many covariates to adjust the estimate of the treatment effect may be less problematic than commonly supposed are given. Two methods of dynamic allocation of patients based on covariates, minimization and Atkinson's approach, are compared and contrasted for the particular case where all covariates are binary. The results of Monte Carlo simulations are also presented. It is concluded that in the cases considered, Atkinson's approach is slightly more efficient than minimization although the difference is unlikely to be very important in practice. Both are more efficient than simple randomization, although it is concluded that fitting covariates may make a more valuable and instructive contribution to inferences about treatment effects than only balancing them.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Trial and Error and Algorithm
Methods of Medium Optimization
Optimization Problems
Application of Linearization and Approximation
Linear Approximations
