| Unit | Potential outcomes | |
|---|---|---|
| \(Y^\ast(Aspirin)\) | \(Y^\ast(No Aspirin)\) | |
| I | No Headache | Headache |
| Unit | Potential outcomes | Causal effect | |
|---|---|---|---|
| \(Y^\ast(Aspirin)\) | \(Y^\ast(No Aspirin)\) | ||
| I | No Headache | Headache | Improvement due to Aspirin |
| Unit | Potential outcomes | Causal effect | |
|---|---|---|---|
| \(Y^\ast(Aspirin)\) | \(Y^\ast(No Aspirin)\) | ||
| 1 | No Headache | Headache | Improvement due to Aspirin |
| 2 | No Headache | No Headache | Headache gone regardless of Aspirin |
| 3 | Headache | No Headache | Aspirin caused headache |
| 4 | Headache | Headache | No effect of Aspirin |
The unit-level causal effects: \[ Y_i^\ast(1) - Y_i^\ast(0), i = 1, \cdots, N. \]
The average causal effect: \[ \tau_{fs} = \frac{1}{N} \sum_{i = 1}^N [Y_i^\ast(1) - Y_i^\ast(0)]. \]
\[ \tau_{fs}(f) = \frac{1}{N(f)} \sum_{i: W_i = f} [Y_i^\ast(1) - Y_i^\ast(0)], \] where \(N(f) \equiv \#\{i = 1, \cdots, N: W_i = f\}\).
\[ \tau_{fs, t} = \frac{1}{N_1} \sum_{i: Z_i = 1} [Y_i^\ast(1) - Y_i^\ast(0)], \] where \(N_1 \equiv \sum_{i = 1}^N Z_i\).
| Unit | Potential outcomes | Causal Effect | |
|---|---|---|---|
| \(Y_i^\ast(0)\) | \(Y_i^\ast(1)\) | \(Y_i^\ast(1) - Y_i^\ast(0)\) | |
| Patient 1 | 1 | 7 | 6 |
| Patient 2 | 6 | 5 | -1 |
| Patient 3 | 1 | 5 | 4 |
| Patient 4 | 8 | 7 | -1 |
| Average | 4 | 6 | 2 |
The observed outcome of unit \(i\) is: \[ Y_i^{obs} = Y_i^\ast(Z_i) = \begin{cases} Y_i^\ast(0) & \text{ if } Z_i = 0\\ Y_i^\ast(1) & \text{ if } Z_i = 1. \end{cases} \]
The missing potential outcome of unit \(i\) is: \[ Y_i^{mis} = Y_i^\ast(1 - Z_i) = \begin{cases} Y_i^\ast(1) & \text{ if } Z_i = 0\\ Y_i^\ast(0) & \text{ if } Z_i = 1. \end{cases} \]
| Unit | Treatment | Observed outcome |
|---|---|---|
| Patient 1 | 1 | 7 |
| Patient 2 | 0 | 6 |
| Patient 3 | 1 | 5 |
| Patient 4 | 0 | 8 |
The previous potential outcome model presumes the following:
Assumption: SUTVA (Stable unit treatment value assumption):
The assignment mechanism is a function that assigns probabilities to all \(2^N\) possible values for the \(N\)-vector of assignments \(\mathbf{Z}\), given the \(N\)-vectors of potential outcomes \(\mathbf{Y}^\ast(0)\) and \(\mathbf{Y}^\ast(1)\), and given \(N \times K\) matrix of covariates \(\mathbf{W}\).
Definition: Assignment Mechanism:
To classify the various types of assignment mechanisms, we present three general properties that assignment mechanisms may satisfy.
| \(i\) | \(O_i\) | \(Z_i\) | \(Y_i^\ast(\cdot)\) | |
|---|---|---|---|---|
| 0 | 1 | |||
| 1 | 1 | 0 | 350 | 500 |
| 2 | 1 | 1 | 320 | 700 |
| 3 | 0 | NA | 800 | 900 |
| 4 | 0 | NA | 700 | 900 |
| 5 | 1 | 0 | 650 | 780 |
| 6 | 0 | NA | 320 | 450 |
| 7 | 1 | 1 | 250 | 400 |
| 8 | 0 | NA | 850 | 900 |
| 9 | 1 | 0 | 760 | 820 |
| 10 | 0 | NA | 750 | 560 |
Because the knowledge that the assignment mechanism is unconfounded is included in information \(\phi\), the analyst can show that the above is \[ \begin{split} &\frac{1}{N_1} \sum_{i = 1}^N \mathbb{E}[Z_i] Y_i^\ast(1) - \frac{1}{N_0} \sum_{i = 1}^N (1 - \mathbb{E}[Z_i]) Y_i^\ast(0) \\ &= \frac{1}{N_1} \sum_{i = 1}^N \frac{N_1}{N} Y_i^\ast(1) - \frac{1}{N_0} \sum_{i = 1}^N \frac{N_0}{N} Y_i^\ast(0) \\ &= \frac{1}{N} \sum_{i = 1}^N Y_i^\ast(1) - \frac{1}{N} \sum_{i = 1}^N Y_i^\ast(0) \\ &= \theta \end{split} \]
The information uniquely determines \(\theta\): The parameter \(\theta\) is identified.
| \(i\) | ||
|---|---|---|
| \(Y_i^\ast(0)\) | \(Y_i^\ast(1)\) | |
| 1 | 350 | 500 |
| 2 | 320 | 700 |
| 3 | 800 | 900 |
| 4 | 700 | 900 |
| 5 | 650 | 780 |
| 6 | 320 | 450 |
| 7 | 250 | 400 |
| 8 | 850 | 900 |
| 9 | 760 | 820 |
| 10 | 750 | 560 |
| \(i\) | ||
|---|---|---|
| \(Y_i^\ast(0)\) | \(Y_i^\ast(1)\) | |
| 1 | [340] | 500 |
| 2 | [310] | 700 |
| 3 | 800 | 900 |
| 4 | 700 | 900 |
| 5 | 650 | [790] |
| 6 | 320 | 450 |
| 7 | [240] | 400 |
| 8 | 850 | 900 |
| 9 | 760 | [830] |
| 10 | 750 | 560 |