The reviewed record of science sign in
Pith

arxiv: 1906.10258 · v14 · pith:ZYSR26WU · submitted 2019-06-24 · econ.EM · cs.SI· stat.ME· stat.ML

Policy Targeting under Network Interference

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ZYSR26WUrecord.jsonopen to challenge →

classification econ.EM cs.SIstat.MEstat.ML
keywords welfareinformationmethodpolicytargetingeffectsnetworkproblem
0
0 comments X
read the original abstract

This paper studies the problem of optimally allocating treatments in the presence of spillover effects, using information from a (quasi-)experiment. I introduce a method that maximizes the sample analog of average social welfare when spillovers occur. I construct semi-parametric welfare estimators with known and unknown propensity scores and cast the optimization problem into a mixed-integer linear program, which can be solved using off-the-shelf algorithms. I derive a strong set of guarantees on regret, i.e., the difference between the maximum attainable welfare and the welfare evaluated at the estimated policy. The proposed method presents attractive features for applications: (i) it does not require network information of the target population; (ii) it exploits heterogeneity in treatment effects for targeting individuals; (iii) it does not rely on the correct specification of a particular structural model; and (iv) it accommodates constraints on the policy function. An application for targeting information on social networks illustrates the advantages of the method.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Treatment Effect Estimation with Differentiated Networked Effect on Graph Data

    cs.LG 2026-05 unverdicted novelty 5.0

    A new interference modeling approach with partial attentions and message amplification captures varying neighbor importance and scale to improve ITE estimation on graphs.