Name
Abstract | ||
|---|---|---|
We propose a matching method that recovers direct treatment effects from randomized experiments where units are connected in an observed network, and units that share edges can potentially influence each others' outcomes. Traditional treatment effect estimators for randomized experiments are biased and error prone in this setting. Our method matches units almost exactly on counts of unique subgraphs within their neighborhood graphs. The matches that we construct are interpretable and high-quality. Our method can be extended easily to accommodate additional unit-level covariate information. We show empirically that our method performs better than other existing methodologies for this problem, while producing meaningful, interpretable results. |
Year | Venue | DocType |
|---|---|---|
2020 | AISTATS | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Awan M. Usaid | 1 | 0 | 0.34 |
| Morucci Marco | 2 | 0 | 0.34 |
| Orlandi Vittorio | 3 | 0 | 0.68 |
| Sudeepa Roy | 4 | 268 | 30.95 |
| Cynthia Rudin | 5 | 720 | 61.51 |
| Alex Volfovsky | 6 | 5 | 2.13 |