This competition is part of the Bradford Quantum Hackathon 2025. Please join the event on Aqora and ensure to follow the rules specified there.
Assigning subjects to treatment groups is is pivotal in experimental clinical trials for novel drugs. A critical component involves identifying distinct subject cohorts suitable for specific treatments. These cohorts should exhibit maximum similarity based on measurable covariates (or attributes), which influence individual responses to treatment, thus enabling the differentiation of treatment effects from confounding factors.
Timeline
Start
Oct 2025 Mon, France Time
End
Nov 2025 Fri, France Time
Purpose
The objective of the assignment is to minimize the discrepancy between any two groups in the weighted sum of the first and second moments of the covariates.
Setting
Each patient is associated with r=3 covariates wi=(wi1,wi2,wi3) that are relevant for predicting the patient's outcome. There are n patients in total. The decision maker knows the total number of subjects of the experiment n and the respective covariates w=(w1,⋯,wn). The decision maker will assign k:=n/m subjects to each of m≥2 treatment groups. In this case, we will consider the scenario where only two groups are used (m=2).
The binary decision variables are x={xip∣i=1,⋯,n,p=1,2}, where xip=1 if patient i is assigned to group p, and xip=0 otherwise.
Objective
The objective of the assignment is to minimize the discrepancy between any two groups in the weighted sum of the first and second moments of the covariates.
That is, the discrepancy is calculated as follows:
The parameter ρ regulates the relative weight of the first and the second moments. In this case, we will set ρ=0.5.
Constraints
There are several constraints needed to ensure an appropriate patient stratification:
Number of patients in each group: Groups 1 and 2 need to have the same number of patients, n/2. This constraint can be written as:
i∑xip=n/2,∀p∈{1,2}.
Each patient should be assigned to exactly one group. This constraint can be written as:
xi1+xi2=1∀i∈{1,⋯,n}
Symmetry redundancy: this constraint reduces the redundancy as a result of permutation symmetry in group numbering (changing group 1 by group 2). This constraint can be written as:
x12=0
Problem formulation
Putting it all together, this problem can be formulated as follows:
This corresponds to a mixed-integer optimization problem with 10 continuous variables ({d,Δμ1,Δμ2,Δμ3,Δσ11,Δσ22,Δσ33,Δσ12,Δσ13,Δσ23}) and 2n−1 binary variables ({x11,⋯,xn1,x22,⋯,xn2}).