Experimentation on Endogenous Graphs

Authors

  • Wenshuo Wang Meta
  • Edvard Bakhitov Meta
  • Dominic Coey Meta

DOI:

https://doi.org/10.1609/aaai.v40i31.39857

Abstract

We study experimentation under endogenous network interference. Interference patterns are mediated by an endogenous graph, where edges can be formed or eliminated as a result of treatment. We show that conventional estimators are biased in these circumstances, and present a class of unbiased, consistent and asymptotically normal estimators of total treatment effects in the presence of such interference. We show via simulation that our estimator outperforms existing estimators in the literature. Our results apply both to bipartite experimentation, in which the units of analysis and measurement differ, and the standard network experimentation case, in which they are the same.

Downloads

Published

2026-03-14

How to Cite

Wang, W., Bakhitov, E., & Coey, D. (2026). Experimentation on Endogenous Graphs. Proceedings of the AAAI Conference on Artificial Intelligence, 40(31), 26498-26507. https://doi.org/10.1609/aaai.v40i31.39857

Issue

Section

AAAI Technical Track on Machine Learning VIII