Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.32735

Optimal Treatment Assignment Rules on Networked Populations

Abhishek Ananth
View original source ↗Read source document ↗Export metadata ↓

Abstract

I analyze decision problems where a planner must choose, based on data from an experiment in a pilot population, how to simultaneously distribute a limited number of treatments that generate network spillovers across individuals in a target population. A global treatment rule maps the target population's observed covariates and network features into a jointly feasible allocation. Under local-response, stability, support, and policy-relevant overlap conditions, I identify the resulting welfare using a transported inverse propensity weighted criterion and construct an empirical welfare maximizer. I derive a finite-sample regret bound under restrictions on the complexity of network spillovers and the complexity of the global rule class, measured by its Natarajan dimension. The upper bound uses independent node-level variation, dyadic network formation without imposing a bounded maximum degree. A minimax lower bound establishes a corresponding rate comparison under additional welfare-relevant richness. Finally, I compare oracle optimal global and local rules (which allocate treatments on an individual-by-individual basis) and bound the welfare gap between them. An empirically calibrated oracle comparison illustrates the magnitude of this welfare gap.

Explore related subjects

econ.EM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Abhishek Ananth. 2026-10-23. Optimal Treatment Assignment Rules on Networked Populations. https://arxiv.org/abs/2610.32735

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Dynamic Mortality Forecasting via Mixed-Frequency State-Space Models

High-frequency death counts are now widely available and contain timely information about intra-year mortality dynamics, but most stochastic mortality models are still estimated on annual data and therefore update only when annual totals are released. We propose a mixed-frequency state-space (MF--SS) extension of the Lee--Carter framework that jointly uses annual mortality rates and monthly death counts. The two series are linked through a shared latent monthly mortality factor, with the annual period factor defined as the intra-year average of the monthly factors. The latent monthly factor follows a seasonal ARIMA process, and parameters are estimated by maximum likelihood using an EM algorithm with Kalman filtering and smoothing. This setup enables real-time intra-year updates of the latent state and forecasts as new monthly observations arrive without re-estimating model parameters. Using U.S. data for ages 20--90 over 1999--2019, we evaluate intra-year annual nowcasts and one- to five-year-ahead forecasts. The MF--SS model produces both a direct annual forecast and an annual forecast implied by aggregating monthly projections. In our application, the aggregated monthly forecast is typically more accurate. Incorporating monthly information substantially improves intra-year annual nowcasts, especially after the first few months of the year. As a benchmark, we also fit separate annual and monthly Lee--Carter models and combine their forecasts using temporal reconciliation. Reconciliation improves these independent forecasts but adds little to MF--SS forecasts, consistent with MF--SS pooling information across frequencies during estimation. The MF--SS aggregated monthly forecasts generally outperform both unreconciled and temporally reconciled Lee--Carter forecasts and produce more cautious predictive intervals than the reconciled Lee--Carter approach.

econ.EM↗
arXiv2026

Estimation of BLP models with high-dimensional controls

This paper develops a framework for estimating demand in differentiated product markets with high-dimensional product characteristics, building on the Berry, Levinsohn, and Pakes (1995) model with market-level data; the number of characteristics may exceed the number of markets. First, we propose a Neyman orthogonal estimator in which high-dimensional nuisance parameters are estimated by machine-learning methods such as LASSO, and show that it is $\sqrt{T}$-asymptotically normal for the parameters of interest, such as the price coefficient and price heterogeneity, even when the nuisance parameters converge at slower rates. Second, under approximate sparsity, we provide LASSO-based nuisance estimators that attain the required rates, although mean utility is recovered from market shares only when the nonlinear parameters are known. Monte Carlo simulations show good finite-sample performance. We illustrate the method with Dominick's Finer Foods data on tuna and Kantar Worldpanel Take Home data on juice.

econ.EM↗
arXiv2026

Local Polynomial Estimation in Irregular Correlated Random Coefficient Panel Data Models

We study estimation of the average partial effect (APE) in an irregular correlated random coefficients panel data model in which the time dimension equals the number of random coefficients, $T=p$, and the density function is degenerate. We extend Graham and Powell (2012) in two directions. First, we allow the density of $d_i=\det(X_i)$ to vanish or diverge at the origin at the polynomial rate $|d|^{a}$ with $a>-1$, and show that the aggregate time effects and the APE remain identified for every such $a$, extending earlier work studying the case $a = 0$. Second, we propose a three-step estimator: an $m$th-order local polynomial regression over the stayers for the time effects; a local polynomial fit of the conditional mean coefficient just outside the trimming threshold; and an imputation step that extrapolates the latter into the stayer region rather than discarding stayers. We establish joint asymptotic normality in three regimes determined by the sign of $a$, and obtain a convergence rate approaching $n^{-(m+1)/(2m+3)}$ when $a=0$, against $n^{-1/3}$ for Graham and Powell (2012), whose estimator is the special case $m=0$, $a=0$. The results show that smoothness of the underlying conditional expectations can be traded for a faster convergence rate in irregularly identified models. Simulations confirm lower bias and root mean squared error across designs. We redo the overidentification analysis of a markup model in Raval (2023), allowing for correlated random elasticities.

econ.EM↗