Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2306.12394 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909212947251200 |
|---|---|
| author | Ravichandran, Arun Pashley, Nicole E. Libgober, Brian Dasgupta, Tirthankar |
| author_facet | Ravichandran, Arun Pashley, Nicole E. Libgober, Brian Dasgupta, Tirthankar |
| contents | Optimizing the allocation of units into treatment groups can help researchers improve the precision of causal estimators and decrease costs when running factorial experiments. However, existing optimal allocation results typically assume a super-population model and that the outcome data comes from a known family of distributions. Instead, we focus on randomization-based causal inference for the finite-population setting, which does not require model specifications for the data or sampling assumptions. We propose exact theoretical solutions for optimal allocation in $2^K$ factorial experiments under complete randomization with A-, D- and E-optimality criteria. We then extend this work to factorial designs with block randomization. We also derive results for optimal allocations when using cost-based constraints. To connect our theory to practice, we provide convenient integer-constrained programming solutions using a greedy optimization approach to find integer optimal allocation solutions for both complete and block randomization. The proposed methods are demonstrated using two real-life factorial experiments conducted by social scientists. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_12394 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Optimal allocation of sample size for randomization-based inference from $2^K$ factorial designs Ravichandran, Arun Pashley, Nicole E. Libgober, Brian Dasgupta, Tirthankar Methodology Applications Optimizing the allocation of units into treatment groups can help researchers improve the precision of causal estimators and decrease costs when running factorial experiments. However, existing optimal allocation results typically assume a super-population model and that the outcome data comes from a known family of distributions. Instead, we focus on randomization-based causal inference for the finite-population setting, which does not require model specifications for the data or sampling assumptions. We propose exact theoretical solutions for optimal allocation in $2^K$ factorial experiments under complete randomization with A-, D- and E-optimality criteria. We then extend this work to factorial designs with block randomization. We also derive results for optimal allocations when using cost-based constraints. To connect our theory to practice, we provide convenient integer-constrained programming solutions using a greedy optimization approach to find integer optimal allocation solutions for both complete and block randomization. The proposed methods are demonstrated using two real-life factorial experiments conducted by social scientists. |
| title | Optimal allocation of sample size for randomization-based inference from $2^K$ factorial designs |
| topic | Methodology Applications |
| url | https://arxiv.org/abs/2306.12394 |