Loading…

Comparisons of minimization and Atkinson's algorithm

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...

Full description

Saved in:
Bibliographic Details
Published in:Statistics in medicine 2010-03, Vol.29 (7-8), p.721-730
Main Authors: Senn, Stephen, Anisimov, Vladimir V., Fedorov, Valerii V.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. Copyright © 2010 John Wiley & Sons, Ltd.
ISSN:0277-6715
1097-0258
DOI:10.1002/sim.3763