EconBase
← Back to paper

Set-Valued Control Functions

Extracted main text — title through conclusion, appendix excluded. This is what our citation measures are computed over, published so the extraction can be checked by eye.

109,317 characters · 14 sections · 108 citation commands

Rendered from LaTeX for readability, not typeset faithfully. Citation keys are highlighted; maths is left as source; figures, tables and equation environments are summarised rather than reproduced; unrecognised commands are greyed out so nothing is silently dropped. Email addresses are removed.

Set-Valued Control Functions

\onehalfspacing

abstractThe control function approach allows the researcher to identify various causal effects of interest. While powerful, it requires a strong invertibility assumption in the selection process, which limits its applicability. This paper expands the scope of the nonparametric control function approach by allowing the control function to be set-valued and derive sharp bounds on structural parameters. The proposed generalization accommodates a wide range of selection processes involving discrete endogenous variables, random coefficients, treatment selections with interference, and dynamic treatment selections. The framework also applies to partially observed or identified controls that are directly motivated from economic models. \begin{comment} \begin{center} {Preliminary and incomplete -- please do not post or circulate} \end{center} \end{comment} \noindentKeywords: Control Function, Control Variable, Partial Identification, Spillover Effects, Dynamic Treatment Effects.

Introduction

Endogeneity is the main challenge in conducting causal inference with observational data. The control function (CF) approach has been a valuable tool in addressing endogeneity and recovering various causal parameters. Although this approach originated in parametric models (e.g., dhrymes1970econometrics, heckman1979sample), it has been proven to be a powerful tool for identification and estimation in nonparametric models that allow causal effect heterogeneity. The CF approach constructs control variables $V$, which define a latent type conditional on which endogenous explanatory variables $D$ can be viewed as unconfounded. In observational settings, such $V$ is typically constructed by inverting treatment selection processes so that it is written as a function of observables---thus a control function. Many empirical studies build on this insight to construct and utilize control variables olley1996dynamics,levinsohn2003estimating,ackerberg2015identification,Kline:2016aa,Card:2019aa,Abdulkadiroglu:2020aa,Bishop:2022aa. While powerful, this approach relies on the invertibility of selection models. For example, in nonparametric triangular models, invertibility requires $D$ to be continuously distributed and the selection equation for $D$ to be strictly monotone in a scalar unobservable variable. This type of restriction is viewed as the most important limitation of the CF approach Blundell:2003wi. More generally, whether selection models are involved or not, empirical researchers encounter situations where control variables are only partially observed or identified; see below.

This paper allows the control function to be set-valued. Formally, a set-valued control function ${\boldsymbol{V}}$ is a random closed set, constructed from observable variables, that contains the true control variable $V$ inside it. Based on this insight, we build a general framework of sharp-bound characterization and inference that expands the scope of the CF approach to a variety of contexts. When selection processes are involved, this approach allows us to drop invertibility. This adaptation accommodates a wide range of selection processes. Observational data are often generated through complex selection processes. For example, $D$ can be a binary variable generated by a generalized Roy model Eisenhauer:2015aa. One can allow for richer heterogeneity by considering a selection model with binary $D$ that violates the local average treatment effect (LATE) monotonicity Imbens:1994tc or, analogously, a model with continuous $D$ with vector unobservables (e.g., selection with random coefficients). Other examples are the cases where $D$ is determined through interaction of multiple agents Tamer:2003tr,ciliberto2021market,Balat:2022aa (e.g., due to violation of the stable-unit treatment value assumption (SUTVA) in forming outcomes); where $D$ and outcomes are dynamically determined over time Han:2021aa,han2023optimal; and where $D$ results from censoring Manski:2002um or as corner solutions. Such processes typically violate the invertibility assumption, as the mapping from observables to $V$ is only a correspondence. We show that the CF approach can still be used with these selection processes to partially identify structural (i.e., causal) parameters, such as average and quantile structural functions for outcomes. By allowing control functions to be set-valued, we can also incorporate a wider range of examples that use controls without relying on selection models. bertanha2024causal control for a set of true preferences using strategic reports, while auerbach2022identification recovers a control variable from a friendship network. In other examples, controls are simply interval data (e.g., wealth, debt, biometric measures, psychological traits). Our framework can be applied to such scenarios, enabling researchers to conduct sensitivity analyses.

To our knowledge, the general form of sharp identifying restrictions under the control function assumption were unknown without requiring the full observability of the control variable. Our innovation is to construct a random set that contains outcome values consistent with the control function assumption by combining a set-valued control function ${\boldsymbol{V}}$ with an augmented outcome equation. This is a crucial step to formulate the model's incomplete prediction, which is the main contribution of this paper. This step enables us to utilize tools from the theory of random sets Molchanov:2017th, such as the containment functional and Aumann expectation of the set-valued prediction, thereby establishing restrictions that lead to the sharp identified set for the structural parameters. Assuming full independence of treatments conditional on controls (Assumption (ref)), the identifying restrictions result in inequality constraints on the conditional choice probabilities. If we assume a weaker conditional mean independence (Assumption (ref)), these restrictions become conditional moment inequality restrictions. Inference methods based on such restrictions have been extensively studied Canay:2017aa,Molinari:2020un. Hence, practitioners can apply existing methods to our identifying restrictions. To demonstrate this point, we illustrate our approach by studying individuals' HIV preventive behavior under an informational provision intervention studied by Thornton:2008tp. This empirical illustration involves an ordered outcome, an endogenous treatment, multiple instruments, and various observed controls. We examine the effectiveness of the intervention by constructing CIs for policy-relevant parameters such as the counterfactual switching probability of individual choices.

This paper contributes to the vast literature on identification and estimation in nonparametric models with endogenous explanatory variables. In linear models, the two-stage least squared (TSLS) estimator can have two different interpretations: the instrumental variable (IV) approach and the CF approach Blundell:2003wi. The noparametric version of the IV approach is considered in ai2003efficient, newey2003instrumental, hall2005nonparametric, chernozhukov2005iv,blundell2007semi, chen2009efficient, darolles2011nonparametric, chen2012estimation, dhaultfoeuille2015identification, torgovitsky2015identification, vuong2017counterfactual, chen2018optimal. Typically, this approach assumes invertibility in the outcome equation and thus relies on a scalar unobservable, so that the IV assumption can be utilized. The CF approach is generalized to nonparametric models by Newey:1999tu, chesher2003identification, das2003nonparametric, Blundell:2004td, Imbens:2009vs,DHaultfoeuille:2021aa,Newey:2021ab,nagasawa2024treatment, following the adaptation to nonlinear parametric models in Newey:1987aa, RIVERS1988347, smith1986exogeneity, blundell1989estimation. The nonparametric CF literature typically assumes a model for endogenous explanatory variables and its invertibility in a scalar unobservable. Then, this approach generates control variables and combines it with the CF assumption (non-nested to the IV assumption) to identify structural parameters. Although this approach restricts selection behavior and is not applicable to discrete treatments, its advantage is the freedom from restricting heterogeneity directly relevant in generating causal effects. Another important strand of the causal inference literature concerns a binary or discrete treatment with a monotonicity assumption Imbens:1994tc, abadie2002instrumental or equivalently Vytlacil:2002vo a threshold-crossing model that involves a scalar unobservable Heckman:2005aa.

Chesher:2017vu propose a generalized IV (GIV) framework that allows for partial identification of structural parameters in a range of complete and incomplete models (see also Chesher:2012vn, Chesher:2013vo) under stochastic restrictions governing the relationship between the latent variables and instrumental variables. Chesher:2017vu applies their analysis to single-equation IV models, extending the IV approach to partial identification. This paper proposes the CF approach to partial identification, filling the gap in the literature. Sharing the aspect of the CF literature above, we allow for arbitrary causal effect heterogeneity (e.g., multi-dimensional outcome unobservables). Overcoming the aspect of the CF literature, we accommodate discrete treatments along with heterogeneity and complexity in treatment selection (e.g., multi-dimensional selection unobservables, incompleteness of selection models).

An incomplete model can often be formulated using one of the following structures: (a) Given covariates $X\in\mathcal X$, latent variables $U\in\mathcal U$, and parameters $\theta\in\Theta$, the model predicts a set ${\boldsymbol{Y}}(X,U;\theta)\subseteq \mathcal Y$ of values for the outcome $Y\in\mathcal Y$; or (b) Given covariates $X\in\mathcal X$ and observed outcome $Y\in \mathcal Y$ and parameters $\theta\in\Theta$, the model predicts a set ${\boldsymbol{U}}(X,Y;\theta)\subseteq \mathcal U$ for the latent variable $U\in\mathcal U.$ One can choose how to formulate an incomplete model depending on the objects of interest, assumptions, and observability of variables. For example, many discrete choice models that specify a parametric family for $F$ can be formulated using (a) jovanovic1989observable,galichon2011set. beresteanu2011sharp study an extended setting, allowing for solution concepts that involve randomization, e.g., correlated equilibria. Chesher:2017vu employ (b) to define a set of latent variables whose selection satisfies specific stochastic restrictions. A similar approach is used in more recent work by chesher2023iv for IV Tobit models and chesher2023identification in the context of panel data models. Our approach to defining a random set closely relates to the previous work but differs in the following respects. The first step of our approach uses (b) to construct the set-valued CF as a set of unobserved control variables. The second step plugs the set-valued control function into an augmented outcome equation to define a model in structure (a). This hybrid approach allows us to extend the control function approach naturally to the current setting.

Chesher:2005tu also considers partial identification without requiring invertibility in selection processes. He assumes that discrete endogenous variables are generated from ordered structure and focuses on local parameters. This paper in contrast focuses on global parameters, while encompassing a range of selection processes including ordered selection. Recently in a sample selection model, aradillas2024inference considers control variables that are partially observed either as interval data or via economic theory and constructs a confidence set for partially identified parameters. The framework of the current paper is more general and focuses on a different source of set-valued CF (i.e., non-invertibility). Shaikh:2011vk, Jun:2011we, mourifie2015sharp, Mogstad:2018aa, machado2019instrumental, han2024computational consider partial identification in nonparametric models without requiring invertibility in selection processes; they consider either a binary treatment generated from threshold-crossing models (equivalently, under the LATE monotonicity) or a discrete treatment with similar restrictions. These models are nested within the class of models we consider, but our distinct features include the generality in selection processes and the use of the CF approach.

Setup

Let $Y\in \mathcal{Y}\subseteq\mathbb R^{d_Y}$ be the outcome of interest generated according to the following outcome equation:

align[align omitted — 48 chars of source]

where $D\in\mathcal{D}\subseteq\mathbb R^{d_D}$ is a vector of endogenous treatment variables, $X\in \mathcal{X}\subseteq\mathbb R^{d_X}$ is a vector of covariates, and $U\in \mathcal U\subseteq\mathbb R^{d_U}$ is a vector of latent variables. All random variables are defined on a complete probability space $(\Omega,\mathfrak F, P)$. The structural function $\mu$ determines the value of the potential outcome $Y(d)=\mu(d,X,U)$ that would realize when the endogenous variable is set to $ d\in \mathcal{D}$. Many policy-relevant parameters are features of the potential outcome, and hence functionals of $\mu$. Examples are the average structural function and the distributional structural function: $\text{ASF}(d)\equiv E[\mu(d,X,U)]=E[Y(d)]$ and $\text{DSF}(d)\equiv F_{\mu(d,X,U)}=F_{Y(d)}$, respectively. Other examples are the policy-relevant structural function and the mediated structural function, defined later.

A vector of control variables $V\in\mathcal{V}$ ($\subseteq\mathbb R^{d_V}$ for example) is such that, the assignment of $D$ becomes independent of $U$ once we condition on $V$ and the observable covariates $X$:

align[align omitted — 30 chars of source]

Such variables allow the researcher to identify various causal parameters without additional parametric assumptions on $\mu$ or the distribution of unobservables.

For this approach to work, one needs to express $V$ as a function of observable variables. Suppose $D$ is generated from a selection process and $Z$ are the vector of instrumental variables. A commonly used specification for the selection process is the additive model $D=\Pi(Z)+V$, in which one may express $V=D-\Pi(Z)$ Newey:1999tu. Imbens:2009vs consider a nonseparable system, in which a single endogenous variable is modeled as $D=h(Z,\tilde V)$ of a vector of instrumental variables $Z$ and a continuously distributed scalar latent variable $\tilde V$, where $h$ is strictly monotonic in $\tilde V$. They show that, under the independence of $(U,\tilde V)$ and $Z$, one may use the conditional cumulative distribution function $V\equiv F_{D|Z}(D|Z)$ as a control variable. The key assumption is the invertibility of $h$ in the latent variable, which ensures that there is a one-to-one relationship between $\tilde V$ and $V$.\footnote{This approach can be extended to a class of simultaneous equations models that meet a certain separability condition Blundell:2013tg,Blundell:2014wo.}

When $D$ is binary, there are other approaches employed in the literature to use control functions without invertibility. These approaches maintain a scalar unobservable $V$ in the selection and additive separability in the outcome equation and either (i) impose parametric assumptions, such as a parametric distribution of unobservables heckman1979sample, dal2021information; or (ii) introduce the marginal treatment effects (MTE) Heckman:2005aa as a control function, where a parametric restriction is imposed on the MTE function to deal with discrete “forcing” variables brinch2017beyond; see Kline:2019wa for related discussions.

The previous approaches rely on either invertibility in the selection or certain parametric restrictions. The parametric restrictions are subject to misspecification and they are often combined with scalar $V$. The invertibility requirement restricts the form of the selection equation and the dimension of $V$. When $V$ is continuously distributed, the invertibility also requires $D$ to be continuous, which limits the scope of the control function assumption. Moreover, having vector $V$ is important in allowing for rich heterogeneity in the selection process. For example, a multidimensional $V$ can capture individuals' heterogeneous responses to a determinant of the treatment take-up decision by allowing for both compliers and defiers. We, therefore, aim to remove these restrictions.

Another line of research builds control variables $V$ from observables that are not directly related to selection processes. For instance, auerbach2022identification utilizes friendship networks to infer a control for latent student abilities. Our framework can also be employed to construct a set-valued control that relies on less stringent assumptions, thereby enabling the researcher to perform a sensitivity analysis.

Motivating Examples

A set-valued control function ${\boldsymbol{V}}$ is a random closed set that contains the true control $V$ almost surely and is a function of observable variables. We state this as a formal assumption in the next section (Assumption (ref)), together with a precise measurability requirement.

Before proceeding, we introduce motivating examples. The examples share the following features. First, they involve control variables, conditional on which the treatment decisions can be viewed as random. Second, they do not allow the researcher to uniquely recover the control variables. Nonetheless, it is possible to construct a set-valued control function. Finally, the above features are related to the fact that the control variable $V$ may be interpreted as structural unobservables in these examples.

We start with examples involving selection processes (Examples (ref)-(ref)). When the control variable appears as a component in a selection process, the above features can be summarized in the following generalized selection equation:

align[align omitted — 48 chars of source]

Note that $(D,X,Z)\mapsto V$ is, in general, a correspondence because either $\pi(Z,X,\cdot)$ is not necessarily strictly monotonic or $V$ is not scalar. Therefore, the selection process (ref) only restricts $V$ to the following set almost surely: $\{v:D=\pi(Z,X,v)\}\subseteq\mathbb{R}^{d_{V}}$. Motivated by this, we define the set-valued control function as follows in the following two examples:

align[align omitted — 127 chars of source]

We define ${\boldsymbol{V}}$ as a closed set in order to utilize the theory of random sets. In Examples (ref)-(ref), we illustrate specific forms of (ref) and (ref).

example[Binary and Censored Treatment Decisions] Let $D$ be a binary treatment that is determined by the selection equation \begin{align} D=1\{\pi(Z,X)\ge V\}, \end{align} where we normalize $V|X$ to the uniform distribution without loss of generality. The selection equation can be motivated by the generalized Roy model Eisenhauer:2015aa. Suppose $Y=DY(1) + (1-D)Y(0)$ where $Y(d)$ follows \begin{align} Y(d)& =\mu(d,X)+U_{d}\quadfor d=0,1. \end{align} We allow the unobservables $U_d$ to be treatment-specific. This makes $Y$ a function of a vector unobservable, $U\equiv(U_1,U_0)$. The treatment decision is based on the net surplus $S$ from the treatment: \begin{align} D =1\{S\ge0\}\equiv1\{Y(1)-Y(0)-C\ge0\}, \end{align} where $C\equiv\mu_{c}(Z,X)+U_{c}$ be the cost of choosing one alternative over the other, and $Z$ is a vector of variables that shifts the cost but not the outcome.\footnote{The generalized Roy model above nests the classical Roy model where $C$ is degenerate Heckman:1990aa and the extended Roy model where $U_{c}$ is degenerate Heckman:2007aa.} We may write the surplus as $S =\pi(Z,X)-V$, where $\pi(Z,X)\equiv\mu(1,X)-\mu(0,X)-\mu_{c}(Z,X)$ is the observable part of the surplus, and $V\equiv U_{c}-U_{1}+U_{0}$ is the unobserved part of the surplus. Then, we can express the treatment decision as (ref). Clearly, $V$ depends on $(U_0,U_1)$. Suppose we are interested in the causal effect of $D$ on $Y$. Suppose $Z$ is independent of $U$ given $(X,V)$. Then, $(X,V)$ are valid control variables because $D$'s remaining variation is independent of $U$ conditional on them. What prevents us from applying the existing approach is that we cannot recover $V$ by inverting (ref) because $D$ is binary. Nonetheless, the model restricts $V$ to the following set almost surely: \begin{align} {\boldsymbol{V}}(D,Z,X;\pi) & =\begin{cases} [0,\pi(Z,X)] & if D=1\\ [\pi(Z,X),1] & if D=0, \end{cases} \end{align} which is a set-valued analog of the control function we may condition on. The previous specification satisfies the LATE monotonicity, eliminating either compliers or defiers Imbens:1994tc,Vytlacil:2002vo. Next, we consider a selection model that allows richer compliance types, and thus increased heterogeneity in the population. Suppose the value of the instrument is set to $z$. Let the potential treatment be \begin{align} D(z) & =1\{\pi(z,X)\ge V_{z}\}\quadfor z\in\mathcal{Z}, \end{align} where $V_z$ is an unobservable specific to the value of $Z$. The observed treatment is $D=\sum_{z\in \mathcal{Z}}D(z)1\{Z=z\}$. Suppose $Z$ is binary below. Given (ref), both compliers and defiers can have nonzero shares: \begin{align*} \{D(0)=0,D(1)=1\} & =\{V_{0}>\pi(0,X),V_{1}\le\pi(1,X)\},\\ \{D(0)=1,D(1)=0\} & =\{V_{0}\le\pi(0,X),V_{1}>\pi(1,X)\}. \end{align*} The observed treatment $D$ is a function of $(V_0,V_1)$, satisfying \begin{align} D & =1\{D(0) + (D(1)-D(0))Z\ge0\} \equiv1\{\tilde{\pi}(Z,X)+(V_{1}-V_0)Z+V_{0}\ge0\}, \end{align} where $\tilde{\pi}(Z,X)\equiv\pi(0,X)+Z(\pi(1,X)-\pi(0,X))$.\footnote{Note that $D=ZD(1) + (1-Z)D(0)=1\{Z(\pi(1,X)-V_1)+(1-Z)(\pi(0,X)-V_0)\ge0\}$.} One may view the last expression as a random-coefficient model, in which the individuals respond heterogeneously to interventions to $Z$ Gautier:2011va,Kline:2019wa. Our framework allows us to proceed with mild assumptions, which may not be sufficient for point identification as in the previous work. Suppose the outcome $Y$ is generated according to (ref) and $Z$ is independent of $U$ conditional on $(X,V_0,V_1)$. Then, $(X,V_0,V_1)$ are valid control variables. By (ref), $V\equiv(V_0,V_1)$ belongs to the following set almost surely: \begin{align} {\boldsymbol{V}}(D,Z,X;\pi) =\begin{cases} \left\{ (v_0,v_1):\tilde \pi(Z,X)+(1-Z)v_{0}+Zv_{1}\ge0\right\} & if D=1\\ \left\{ (v_0,v_1):\tilde \pi(Z,X)+(1-Z)v_{0}+Zv_{1}\le 0\right\} & \text{if }D=0. \end{cases} \end{align} Similar to the binary case is $D$ being a censored decision as a corner solution in an agent's optimization problem. In this case, the generalized selection equation is not invertible and a corresponding set-valued control function can be constructed; see Section (ref) in the Appendix for details. $\square$
example[Treatment Responses as Vectors] The next example involves a vector of treatments generated by either (i) strategic decisions of multiple individuals Balat:2022aa or (ii) a single agent's dynamic decisions over multiple periods Han:2021aa, han2023optimal, han2023semiparametric. Let $D$ be the vector of binary decisions across individuals or the vector of binary treatments and previous outcomes over periods. We are interested in the effect of the entire profile $D$ on an outcome $Y$. To that end, suppose we have a vector of (individual- or time- specific) IVs, $Z$, and let $\pi(\cdot)$ be the generalized selection function for $D$. Note that $\pi(\cdot)$ is not invertible in the corresponding unobservables due to the discreteness of $D$, as in Example (ref). Moreover, in case (i), decisions across individuals can be generated from multiple equilibria and, in case (ii), decisions across time can involve dynamic endogeneity. These aspect further complicates the CF approach. However, we can construct appropriate control variables $V$ and corresponding ${\boldsymbol{V}}(D,Z;\pi)$ in multi-dimensional spaces. We detail these examples in Sections (ref)-(ref).

The examples above constructed ${\boldsymbol{V}}$ from selection processes. The next example concerns control variables that are not necessarily generated from selection models. Set-valued control functions ${\boldsymbol{V}}(Z,X)$ in such settings are functions of variables other observables $(Z,X)$, where $Z$ is not necessarily an instrument. Often, it contains information on the true control $V$, and some components of $Z$ may be excluded from the outcome equation.

example[Set-Valued Controls Without Selection] We provide three examples using the notation of our paper. First, control variables $V$ may simply be partially observed via interval or censored measurement. In many administrative data, information such as wealth, debt, biometric measures, and psychological traits is observed as an interval due to limitations in data collection or privacy concerns.\footnote{For example, wealth in the Health and Retirement Survey (HRS) and income in the Current Population Survey (CPS) are measured as intervals.} In this case, ${\boldsymbol{V}}$ would be directly obtained from observed intervals and can be expressed as ${\boldsymbol{V}}(Z,X)=[X_{L},X_{U}]$; see Manski:2002um for a related setting. In the context of school matching mechanisms, bertanha2024causal estimate the causal effects of school assignment using students' local preferences as control variables $V\in \mathcal V$ (where $\mathcal V$ is the set of preference relations) to enable regression-discontinuity comparisons. The key feature of their setup is that, under capacity constraints, students have incentives to misreport their preferences. Based on students' reported partial order of preferences, they recover local preference sets ${\boldsymbol{V}}(Z,X)$ (with reported preferences $Z$ and test scores $X$) that contain the true preference $V$ a.s., and subsequently characterize the bounds on the effects of school assignment. In a social network setting, auerbach2022identification considers a partial linear model with a nonparametric function $\lambda(\cdot)$ of social characteristics as an unknown control variable $V$, which is seldom identified to be used as a control function. Instead, he proposes to use the link function $\pi(\cdot)$ in a nonparametric link formation model that is identified from the distribution of social links. Then, under the assumption that individuals with similar link functions have similar values of control $\lambda(V)$ (Assumption 3 therein), he identifies the slope parameters. However, one may want to relax this identifying assumption and allow individuals with similar link functions to have values of $\lambda(V)$ with discrepancy bounded by a sensitivity margin. This can be achieved by constructing a set-valued control ${\boldsymbol{V}}=\{(v,v'):\|\pi_v-\pi_{v'}\|_{L^2}\le \delta\}$ that contains the latent characteristics of a pair of individuals whose link functions are within a certain distance $\delta$. Then, we can recover a set of controls, $\lambda({\boldsymbol{V}})$, and partially identify the slope parameters. $\square$

Model Prediction

As a preparation for the identification analysis, we formulate the model prediction. We show that our limited knowledge of the unobserved control variable $V$ can be formalized as an incomplete model.

Throughout, $V:\Omega\to\mathcal V$ is a random element taking values in a Polish space $\mathcal{V}$. First, we assume that $V$ and observable covariates $X$ form control variables.

assumption$U|D,X,V\sim U|X,V$.

By Assumption (ref), the treatment decision is independent of $U$ once we condition on $(X,V)$. Next, we introduce random closed sets and their measurable selections Molchanov:2018ui.

definition[Random Closed Set] A map ${\boldsymbol{X}}$ from a probability space $(\Omega,\mathfrak F,P)$ to the family $\mathcal F(\mathbb T)$ of closed subsets of a Polish space $\mathbb T$ is called a random closed set if \begin{align} {\boldsymbol{X}}^-(K)\equiv\{\omega\in \Omega:{\boldsymbol{X}}(\omega)\cap K\ne\emptyset\} \end{align} is in $\mathfrak F$ for each compact set $K\subseteq\mathbb T$.
definition[Measurable Selections] For any random set ${\boldsymbol{X}}$, a measurable selection of ${\boldsymbol{X}}$ is a random element $X$ with values in $\mathbb T$ such that $X(\omega)\in{\boldsymbol{X}}(\omega)$ almost surely. We denote by $\operatorname{Sel}({\boldsymbol{X}})$ the set of all selections from ${\boldsymbol{X}}$.

We assume one can construct a set-valued control function as a random closed set.

assumption(i) There is a random closed set ${\boldsymbol{V}}:\Omega\to \mathcal F(\mathcal{V})$ such that $V\in {\boldsymbol{V}}$ with probability 1; (ii) ${\boldsymbol{V}}$ is a measurable function of observable variables and possibly a parameter $\pi$.

The set-valued control function ${\boldsymbol{V}}$ is a random closed-set constructed from the observables.\footnote{A singleton-valued control function in the literature is a special case of Assumption (ref). } A leading case would be ${\boldsymbol{V}}$ generated by a selection equation $D=\pi(Z,X,V)$ where $Z$ is a vector of instrumental variables excluded from $\mu$ (e.g., Examples (ref)-(ref)).\footnote{In each example of Section (ref), observe that we use closed intervals or sets to construct random set ${\boldsymbol{V}}$ that is closed.} However, ${\boldsymbol{V}}$ can also be generated from other sources with corresponding observables and $\pi$ (e.g., Example (ref)). Assumption (ref) is agnostic about the genesis of a set-valued control function. The set can depend on an unknown parameter $\pi$, which can be infinite-dimensional. In some applications, $\pi$ can be point identified from additional restrictions. We incorporate such restrictions into our identification framework below. We write ${\boldsymbol{V}}(D,X,Z;\pi)$ whenever it is useful to show its dependence on $(D,X,Z)$ and $\pi$.

Let us discuss Assumptions (ref)-(ref) further. In the conventional CF approach, we use the control variable $V$ for two main purposes. First, we use $V$ to adjust for the effects of confounding factors as outlined in Assumption (ref). Second, we condition on the subpopulation for which this assumption holds. We may use these properties simultaneously if $V$ is observable or can be recovered from other observable variables. However, in the current scenario, the second property is not available. Therefore, we use ${\boldsymbol{V}}$ (recovered from other observables ensured by Assumption (ref)) to condition on a “coarser” subpopulation. Failing to condition on $V$ can result in a loss of identifying power. Nevertheless, our framework enables the researcher to use all information available under the stated assumptions and establish sharp bounds on the parameters of interest.

We represent $U$ as $U=Q(\eta;D,X,V)$ for a measurable function $Q:[0,1]^{d_U}\times\mathcal{D}\times\mathcal{X}\times\mathcal{V}\to \mathcal{U}\subseteq\mathbb R^{d_U}$ determined by the conditional distribution of $U$ given $(D,X,V)$ and a random vector $\eta\in\mathbb R^{d_U}$, which is independent of $(D,X,V)$ and is uniformly distributed over $[0,1]^{d_U}$. This representation holds generally. To see this, consider an example in which $U\equiv(U_0,U_1)$ is two dimensional as in Example (ref). Let $(\eta_0,\eta_1)\sim U[0,1]^2.$ One can represent $(U_0,U_1)\sim F_{U|D,X,V}$ sequentially by letting

align[align omitted — 190 chars of source]

where for any cumulative distribution function $F$, $F^{-1}(c)\equiv \inf \{u: F(u)> c\}$, which is the quantile function when $F$ is a continuous distribution.\footnote{This sequential transformation is known as the Knothe-Rosenblatt transform Villani:2008aa,Carlier:2010aa,Joe:2014wy.}

By Assumption (ref), we may drop $D$ from the right-hand side of (ref)-(ref)

align*[align* omitted — 135 chars of source]

This argument can be generalized to settings with any finite $d_U$. In general, under Assumption (ref), we may drop $D$ from $Q$'s argument and represent $U$ by

align[align omitted — 54 chars of source]

The map $Q:[0,1]^{d_U}\times\mathcal{X}\times\mathcal{V}\to \mathcal{U}\subseteq\mathbb R^{d_U}$ is determined by the conditional distribution of $U|X,V$, which we denote as

align*[align* omitted — 36 chars of source]

In (ref), we may view $\eta$ as the remaining source of randomness in the potential outcome after controlling for $(X,V)$.

The observed outcome is determined by

align[align omitted — 69 chars of source]

One can view the right-hand side of (ref) as an outcome equation augmented by an adjustment term, $Q(\eta;X,V)$, which involves the control variable $V$ and a “clean” error term $\eta$ that is independent of $D$.\footnote{This is analogous to an additive model, in which the error term can be decomposed into a control function and an error term that is independent of the treatment.}

Using the fact that $V$ is a measurable selection of ${\boldsymbol{V}}$, we define the following random closed set:\footnote{Lemma (ref) in the appendix establishes ${\boldsymbol{Y}}$ is a well-defined random closed set.}

align[align omitted — 194 chars of source]

This set collects all outcome values (and their closure) compatible with the model structure for some unknown control variable $V$ taking values in the set-valued control function ${\boldsymbol{V}}$. This formulation allows us to capture (i) the role of $V$ as a control variable entering the augmented outcome equation through $Q$ and (ii) model incompleteness due to the coarse information provided by ${\boldsymbol{V}}$. To our knowledge, summarizing the model prediction by a random set in (ref) is new.

Representing the model's prediction in this way has several advantages. First, ${\boldsymbol{Y}}$ collects all outcome values given all observable exogenous variables $(D,X,{\boldsymbol{V}})$ and latent variables $\eta$. It represents the prediction of an incomplete model in the sense of jovanovic1989observable.\footnote{jovanovic1989observable characterizes an incomplete model by observed endogenous variables $y$, latent variables $\eta$, and a structure $(\nu,\phi)$, where $\nu$ is the distribution of $\eta$, and $\phi$ is a relation such that $(y,\eta)\in\phi$. The observable exogenous variables are allowed to shift $\phi$. In our setting, $\phi$ corresponds to $gr({\boldsymbol{Y}})=\{(y,\eta):y\in {\boldsymbol{Y}}(\eta,d,x,\mathbf v ;\mu,F)\}$. The representation of $U$ in (ref) allows us to incorporate the structural parameter $(\mu,F)$ into the model's incomplete prediction ($\phi$ in jovanovic1989observable), whereas the remaining randomness is captured by $\eta\sim U[0,1]^{d_U}$.} Following the partial identification literature, we systematically obtain sharp identifying restrictions in such models in the next section. Second, ${\boldsymbol{Y}}$ builds on an augmented outcome equation, which often helps derive closed-form bounds; e.g., see the discussion of the next paragraph. Finally, the framework can accommodate both continuous and discrete outcomes. We provide further details in Section (ref).

remarkAssumption (ref) plays an important role in obtaining identifying restrictions for structural parameters via ${\boldsymbol{Y}}$. Each measurable selection of ${\boldsymbol{Y}}$ is represented by $Y=\mu(D,X,Q(\eta;X,V)),$ which separates the model into two components with distinct roles. The structural function $\mu$ captures the effect of the treatment $D$, while the adjustment term $Q$ depends only on $(X,V)$ and unobserved heterogeneity $\eta$, but not on $D$. This separation, made possible by Assumption (ref) and the representation of $U$ via $Q$, clarifies that variation in $D$ affects $Y$ solely through $\mu$ once $(X,V)$ are held fixed. In this sense, $Q$ acts as a control that isolates the structural effect of $D$. Since $Q$ does not depend on $D$, it also facilitates recovering structural parameters. For example, we may express structural quantities such as the average conditional response $E[Y(d)|X=x,V=v]$ by integrating out $\eta$ \begin{align} E[Y(d)|X=x,V=v]= \int_{[0,1]^{d_U}} \mu(d,x,Q(\eta;x,v))d\eta. \end{align} After characterizing the sharp identification region for $\theta$, we use this property to obtain bounds on various structural functions of interest (see Section (ref)).

Identification

Let $P_0$ be the joint distribution of the observable variables $(Y,D,X,Z)$. Let $\theta\equiv(\mu,F,\pi)$ collect the structural parameters. Let $\Theta\equiv\mathsf M\times\mathsf F\times \mathsf \Pi$ be the parameter space for $\theta$, which embodies a priori restrictions on the parameter. As discussed earlier, some models provide additional restrictions on $\pi$.\footnote{Consider Example (ref). Under an additional independence assumption $Z\perp V|X$, $\Pi_r(P_0)=\{\pi\in\Pi:\pi(z,x)=P_0(D=1|Z=z,X=x)\}$.} We let $\mathsf \Pi_r(P_0)\subset \mathsf \Pi$ be the set of selection parameters satisfying them.

We define the sharp identification region for $\theta$ as follows.

definition[Sharp Identification Region under Full Independence] The sharp identification region $\Theta_I(P_0)\subset \mathsf M\times\mathsf F\times \mathsf \Pi_r(P_0)$ is a subset of $\Theta$ such that each of its elements $\theta=(\mu,F,\pi)$ satisfies the following statements: (i) For any $Y\sim P_0(\cdot|D,X,Z)$, one can represent the outcome as $Y=\mu(D,X,U)$ for some $U$ whose conditional law $F$ satisfies Assumption (ref) for some $V:\Omega\to\mathcal{V}$. (ii) The control variable $V$ is a measurable selection of a set-valued control function ${\boldsymbol{V}}$ satisfying Assumption (ref).

The main result (Theorem (ref)) of this section characterizes $\Theta_I(P_0)$ through inequality restrictions on $\theta$. For this, we introduce the containment functional $\mathbb C_\theta$ of the random set ${\boldsymbol{Y}}$. For any closed set $A\subset \mathcal{Y}$ and $(d,x,z)\in\mathcal{D}\times\mathcal{X}\times\mathcal{Z}$, let

equation[equation omitted — 183 chars of source]

This functional uniquely determines the distribution of ${\boldsymbol{Y}}$ Molchanov:2017th. Since $\eta$ is uniformly distributed over $[0,1]^{d_U}$, the right-hand side of (ref) can be computed analytically or by simulation (see Section (ref)).

The containment functional $\mathbb C_\theta$ characterizes the distribution of all measurable selections of ${\boldsymbol{Y}}$ in the following sense:\footnote{This equivalence holds up to an ordered coupling Molchanov:2018ui.}

multline[multline omitted — 223 chars of source]

This inequality restriction is known as Artstein's inequality Molchanov:2018ui, which is the central device to derive sharp identifying restrictions in incomplete models.

Under Assumption (ref)(i), the observed outcome $Y$ is a measurable selection of ${\boldsymbol{Y}}$, and Artstein's inequality relates the distribution of $Y$ with the distribution of ${\boldsymbol{Y}}$. The left-hand side $P_0(Y\in A|D,X,Z)$ of the inequality can be recovered from a large sample of the observable variables $(Y,D,X,Z)$. The right-hand side $\mathbb C_\theta(A|D,X,Z)$ can be computed from model primitives. Taken together, they provide identifying restrictions. We illustrate them through examples (see Sections (ref) and (ref)).

By the definition of ${\boldsymbol{Y}}$, Artstein's inequality is equivalent to the existence of $Y$ such that

align[align omitted — 42 chars of source]

for some $(U,V)$ satisfying Assumptions (ref)-(ref), ensuring the sharpness of the restriction.

The following theorem characterizes the sharp identification region.

theoremSuppose Assumptions (ref)-(ref) hold. Then, the sharp identification region for the structural parameter $\theta=(\mu,F,\pi)$ is \begin{align} \Theta_I(P_0)=\{\theta\in\Theta:P_0(Y\in A|D,X,Z)\ge \mathbb C_\theta(A|D,X,Z), a.s. \forall A\in \mathcal{F}(\mathcal{Y}), \pi\in \mathsf \Pi_r(P_0)\}. \end{align}

Artstein's inequality is introduced to the identification literature in econometrics by galichon2011set and has been extensively used. As in other work, we use this result to convert the model's set-valued prediction into a system of inequality restrictions that do not involve the unobserved control variable $V$, making the resulting restrictions amenable to estimation. Practitioners can use (ref) to make inference for the elements of $\Theta_I(P_0)$ or their functions. For example, one may use inference methods for conditional moment inequalities Andrews:2013aa,Chernozhukov:2013aa or likelihood-based inference methods Chen_2018,Kaido:2022aa. We provide an empirical illustration utilizing a likelihood-based inference method in Section (ref).

remarkFor a given $(d,x,z)$, the number of the inequalities in (ref) is finite as long as $\mathcal{Y}$ is a finite set. Furthermore, it often suffices to impose a subset of inequalities to characterize $\Theta_I(P_0)$. Such a subset $\mathcal{A}\subseteq\mathcal{F}(\mathcal{Y})$ is called the core determining class galichon2011set. The smallest core determining class only depends on support of ${\boldsymbol{Y}}(\cdot,D,X,Z;\mu,F)$ and does not depend on $P_0$ Luo:2017ab,Ponomarev22thesis.\footnote{Ponomarev22thesis provides an algorithm based on the connectedness of suitable subgraphs to determine the smallest core determining class. See also Chesher:2017vu,BONTEMPS2020373.} If $Y$ is continuous, (ref) involves infinitely many inequalities.\footnote{While we do not pursue this here, an alternative approach to deal with continuous variables would be to characterize the sharp identification region through an optimal transport problem instead of Artstein's inequalities li2024finitesampleinferenceincomplete.} Nevertheless, under a weaker conditional mean independence assumption, a commonly used empirical specification admits a sharp characterization with finitely many inequalities; see Section (ref).

Conditional Mean Restrictions

So far, we worked with the control function assumption in the form of conditional independence assumption (Assumption (ref)). A weaker conditional mean independence assumption is also considered in the literature Newey:1999tu,Pinkse:2000vg. This section explores identifying restrictions that can be obtained from this assumption.

We focus on a scalar outcome $Y$. Let $U\equiv(U_d,d\in\mathcal{D})$ and $U_D=\sum_{d\in \mathcal{D}}U_d1\{D=d\}$.\footnote{For continuous $D$, we may define $U_D$ by $U_D=\int_{\mathcal{D}} U_{s} d\delta_{D}(s)$, where $\delta_D$ is a Dirac measure at $D$.} Consider the following additive model:

align[align omitted — 52 chars of source]

This way, $Y$ is a function of vector $U$, making this model a special case of (ref). It nests the linear model $\mu(d,x)=\alpha d+x'\beta$ with scalar unobservable $U$ as a special case.\footnote{A similar argument can be applied to a nonadditive model $Y=\mu(D,X,U)$ for which $U$ is a scalar and $\mu$ is invertible with respect to $U$. We focus on the additive model only for notational simplicity.}

Suppose the following mean independence analog of Assumption (ref) holds.

assumptionFor each $d\in\mathcal{D}$, $E[|U_d|]<\infty$, and $E[U_d|D,X,V]= E[U_d|X,V], ~a.s.$

For each $d\in\mathcal{D}$, let $\lambda_d(X,V)\equiv E[U_d|X,V]$ and $\eta_d\equiv U_d-E[U_d|X,V].$ Under Assumption (ref), we may write

align[align omitted — 56 chars of source]

and $Y=\mu(D,X)+\lambda_d(X,V)+\eta_d$. We note that $\lambda_d$ is a known function of $F$ and plays the role of the adjustment term similarly to $Q$.

We also assume that $U$ is continuously distributed, which helps us derive tractable identifying restrictions. This assumption can be dropped when ${\boldsymbol{Y}}$ defined below is interval-valued almost surely.

assumption$U|D,X,V$ has a strictly positive density with respect to Lebesgue measure on $\mathbb R^{d_U}$ almost surely.

We now define the sharp identification region as follows.

definition[Sharp Identification Region under Mean Independence] The sharp identification region under mean independence $\Theta_I(P_0)\subset \mathsf M\times\mathsf F\times \mathsf \Pi_r(P_0)$ is a set such that each $\theta=(\mu,F,\pi)\in \Theta_I(P_0)$ satisfies the following statement: (i) For any $Y$ whose conditional mean is $E_{P_0}[Y|D,X,Z]$, one can represent the outcome as in (ref), where $U$'s conditional law $F$ satisfies Assumptions (ref) and (ref) for some $V:\Omega\to\mathcal{V}$. (ii) The control variable $V$ is a measurable selection of a set-valued control function ${\boldsymbol{V}}$ satisfying Assumption (ref).

Let $\eta\equiv(\eta_d,d\in\mathcal{D})$. Define

align[align omitted — 194 chars of source]

Since $Y\in \operatorname{Sel} {\boldsymbol{Y}}$ by Assumption (ref), the observed conditional mean $E_{P_0}[Y|D,X,Z]$ belongs to the set of the conditional mean of measurable selections of ${\boldsymbol{Y}}(\eta,D,X,Z;\mu,F)$ for some $\theta\in\Theta_I(P_0)$. To use this observation, we introduce the conditional Aumann expectation of a random set.

A random closed set ${\boldsymbol{X}}$ is said to be integrable if ${\boldsymbol{X}}$ has at least one integrable selection. We define the Aumann (or selection) expectation of an integrable random closed set following beresteanu2011sharp and Molinari:2020un. For this, we let $\operatorname{Sel}^1({\boldsymbol{X}})$ denote the set of integrable selections of ${\boldsymbol{X}}$.

definitionThe Aumann expectation of an integrable random closed set ${\boldsymbol{X}}$ is given by \begin{align} \mathbb E[{\boldsymbol{X}}]\equiv\operatorname{cl}\Big\{E[X]:,X\in \operatorname{Sel}^1({\boldsymbol{X}})\Big\}. \end{align} For each sub $\sigma$-algebra $\mathfrak B\subset \mathfrak F$, the conditional Aumann expectation of $X$ given $\mathfrak B$ is the $\mathfrak B$-measurable random closed set $\boldsymbol{R} \equiv \mathbb E({\boldsymbol{X}}|\mathfrak B)$ such that the family of $\mathfrak B$-measurable integrable selections of $\boldsymbol{R}$, denoted $\operatorname{Sel}^1_{\mathfrak B}(\boldsymbol{R})$, satisfies \begin{align} \operatorname{Sel}^1_{\mathfrak B}(\boldsymbol{R})\equiv\operatorname{cl}\Big\{E[X|\mathfrak B]:,X\in \operatorname{Sel}^1({\boldsymbol{X}})\Big\}, \end{align} where the closure in the right-hand side is taken in $L^1$.

Under the maintained assumptions, the model's prediction is summarized by

align[align omitted — 90 chars of source]

This condition is equivalent to

align[align omitted — 138 chars of source]

where $s(b,K)=\sup_{k\in K}bk$ is the support function of $K$. As pointed out in the literature, directly working with the conditional Aumann expectation operator can be computationally demanding. We therefore use Assumption (ref) to ensure the convexification property Molinari:2020un of $\mathbb E[{\boldsymbol{Y}}(\eta,D,X,Z;\mu,F)|D,X,Z]$. The convexification property allows us to interchange the expectation and support function operations and obtain the tractable restriction in the following theorem.

theoremSuppose Assumptions (ref)-(ref) hold. Suppose $E_{P_0}[|Y|]<\infty$. Then, the sharp identification region is \begin{multline} \Theta_I(P_0)=\big\{\theta\in\Theta:\mu(d,x)+\lambda_L(d,x,z)\le E_{P_0}[Y|D=d,X=x,Z=z]\\ \le \mu(d,x)+\lambda_U(d,x,z), \pi\in \mathsf \Pi_r(P_0)\big\}, \end{multline} where \begin{align} \lambda_L(d,x,z)\equiv\inf_{v\in {\boldsymbol{V}}(d,x,z;\pi)}\lambda_d(x,v), \lambda_U(d,x,z)\equiv\sup_{v\in {\boldsymbol{V}}(d,x,z;\pi)}\lambda_d(x,v). \end{align}

Causal and Counterfactual Objects

Based on Theorems (ref) or (ref), one can construct bounds on functionals of $\theta$. Let $W\equiv (X,V)$ and let $F_W$ be its distribution. Given $\varphi:\mathbb R\to\mathbb R$, let

align[align omitted — 113 chars of source]

The average and distributional structural functions are special cases of $\kappa$.

For the average structural function $\text{ASF}(d)\equiv E[\mu(d,X,U)]=E[Y(d)]$ considered by Blundell:2003wi, we may set $ \varphi(Y(d))=Y(d)$, which yields

align[align omitted — 111 chars of source]

The average treatment effect (ATE) is then $\text{ATE}(d,d')=\text{ASF}(d)-\text{ASF}(d')$. For the distributional structural function Chernozhukov:2020aa, we may set $\varphi(Y(d))=1\{Y(d)\le y\}$, which gives

multline[multline omitted — 140 chars of source]

The quantile structural function (QSF), the $\tau$-th quantile of $Y(d)$, can be obtained using $\text{QSF}(d)\equiv\text{DSF}^{-1}(\tau,d)$ Imbens:2002vs.

The following proposition characterizes the identification region for $\kappa$.

theoremSuppose the conditions of Theorem (ref) or (ref) hold. Suppose $\varphi$ is bounded, and the underlying probability space is non-atomic. Then, the sharp identification region for $\kappa$ is \begin{align} \mathfrak K_I(d)=\bigcup_{\theta\in\Theta_I(P_0)}[\kappa(d;\theta), \overline{\kappa}(d;\theta)], \end{align} where \begin{align} \overline{\kappa}(d;\theta)&\equiv E[\sup_{v\in {\boldsymbol{V}}(D,X,Z;\pi)}\int\varphi(\mu(d,X,Q(\eta;X,v)))d\eta],\\ \kappa(d;\theta)&\equiv E[\inf_{v\in {\boldsymbol{V}}(D,X,Z;\pi)}\int\varphi(\mu(d,X,Q(\eta;X,v)))d\eta], \end{align} and the expectation above is taken with respect to the distribution of $(D,X,Z)$.

The identification region for $\kappa$ is expressed as a union of intervals. Practically, one may only be interested in the upper and lower endpoints of $\mathfrak K_I(d)$. They are given by the following corollary.

corollarySuppose the conditions of Theorem (ref) hold. Then, the tight upper and lower bounds of $\mathfrak K_I(d)$ are \begin{align} \overline{\kappa}(d)&\equiv\sup_{\theta\in \Theta_I(P)}E[\sup_{v\in {\boldsymbol{V}}(D,X,Z;\pi)}\int\varphi(\mu(d,X,Q(\eta;X,v)))d\eta],\\ \kappa(d)&\equiv \inf_{\theta\in \Theta_I(P)}E[\inf_{v\in {\boldsymbol{V}}(D,X,Z;\pi)}\int\varphi(\mu(d,X,Q(\eta;X,v)))d\eta]. \end{align} If $F_W$ is point identified, the tight upper and lower bounds are \begin{align} \overline{\kappa}(d)&\equiv\sup_{\theta\in\Theta_I(P)}E_{\eta,W}[\varphi(\mu(d,X,Q(\eta;W)))]\\ \kappa(d)&\equiv\inf_{\theta\in\Theta_I(P)}E_{\eta,W}[\varphi(\mu(d,X,Q(\eta;W)))]. \end{align}

Theorem (ref) does not presume point identification of $F_W$ because $V$ is unobservable, which leads to general bounds in (ref)-(ref). In some examples, $F_W$ is point identified even if $V$ itself is not uniquely recovered.\footnote{In Example (ref), the distribution of $V$ is normalized to $U[0,1]$.} If so, for each $\theta\in\Theta_I(P_0)$, $\overline{\kappa}(d;\theta)=\underline{\kappa}(d;\theta).$ This allows us to simplify the bounds as in (ref)-(ref).

In addition to the structural parameter (ref), one can consider a policy that only changes the selection behavior. Suppose a policy sets $Z$ (e.g., a tuition subsidy) to $z$, and the treatment selection under this policy is $D(z)=\pi(z,X,V)$. The policy-relevant structural function (PRSF) would be

align[align omitted — 108 chars of source]

The PRSF is related to the policy-relevant treatment effect (PRTE) and marginal PRTE introduced in Heckman:2005aa and carneiro2010evaluating.

One can consider another related structural function. Suppose $D=(D_1,D_2)$, and let $Y(d_1,d_2)$ denote the counterfactual outcome given $(d_1,d_2)$ and $D_{2}(d_1)$ denote the counterfactual treatment of $D_2$ given $d_1$. Then the mediated structural function (MSF) would be

align[align omitted — 144 chars of source]

where we allow $d_1\neq d_1'$. The MSF can be used to define the direct causal effect of one treatment and the indirect causal effect mediated by another treatment. This scenario is relevant in Example (ref) on strategic interaction (e.g., a player's decision being mediated by the opponent's decision) and on dynamic treatment effects (e.g., a previous treatment being mediated by the previous outcome; han2023semiparametric). One can derive bounds on these objects in a similar manner.

Applications of the Identification Results

We illustrate the use of Theorems (ref) and (ref) through examples.\footnote{In the illustrations, we pair continuous outcome variables with the generalized Roy model and strategic treatment decisions. We pair discrete outcomes with other examples. These choices are arbitrary. Theorems (ref) and (ref) allow the researcher to combine various outcome variable types, selection models, and other sources of controls.} We present examples with various selection processes (Sections (ref)-(ref)) and an example with an incomplete control (Section (ref)). Appendix (ref) provides further examples.

Generalized Roy Model with a Continuous Outcome

We revisit Example (ref). Let $U\equiv (U_{1},U_{0})$, and recall that

align*[align* omitted — 36 chars of source]

hence $U$'s conditional mean independence from $D$ holds as long as $U$ is mean independent of the instrument $Z$. Suppose $Y$ satisfies (ref). Let $\lambda_d(X,V)\equiv E[U_d|X,V]$ for $d\in\mathcal{D}$, and let

align[align omitted — 168 chars of source]

The model's prediction is

align[align omitted — 197 chars of source]

By Theorem (ref), we obtain the following inequalities:

align[align omitted — 157 chars of source]

Rearranging them and taking their intersections across $z$ give the following result.

corollarySuppose $E_{P_0}[|Y|]<\infty$. Suppose $U_0,U_1|X,Z$ have a density with respect to Lebesgue measure, and $E[U_d|Z,X,V]=E[U_d|X,V],d=0,1$. Then, $\Theta_I(P_0)$ is the set of parameter values $\theta \equiv (\mu,F,\pi)$ such that, for almost all $(d,x,z)$, \begin{multline} \sup_{z\in\mathcal{Z}}\Big\{E_{P_0}[Y|D=d,X=x,Z=z]-\lambda_U(d,x,z)\Big\} \\ \le \mu(d,x)\le \\ \inf_{z\in\mathcal{Z}}\Big\{E_{P_0}[Y|D=d,X=x,Z=z]-\lambda_L(d,x,z)\Big\}. \end{multline}

The identifying restrictions (ref) take the form of intersection bounds on $\mu$. For each $z$, $E_{P_0}[Y|D=d,X=x,Z=z]-\lambda_U(d,x,z)$ defines a lower bound on $\mu(d,x)$. Since $z$ is excluded from $\mu$, we can intersect the lower bounds across all values of $z$. The upper bound is formed similarly.

It is worth noting that (ref) restricts the parameter vector $\theta \equiv(\mu,F,\pi)$ jointly because $\lambda_L,\lambda_U$ are functions of $(F,\pi)$. Therefore, they are also useful for bounding $(F,\pi)$. Furthermore, if $Z\perp V|X$, $\pi$ is point identified as the propensity score $\pi(z,x)=P_0(D=1|Z=z,X=x)$. Hence, in this case, (ref) gives joint restrictions on $(\mu,F)$.

remarkThe terms $\lambda_U,\lambda_L$ can be seen as adjustment terms to account for the effects of $V$. To see this, suppose ${\boldsymbol{V}}$ is a singleton $\{V(D,X,Z;\pi)\}$ (e.g., because $D=\pi(Z,X)+V$). Then, \begin{align} \lambda_L(d,x,z)=\lambda_U(d,x,z)=\lambda_d(x,z)= E[U_d|X=x,V=v], \end{align} In this case, (ref)-(ref) reduce to \begin{align} E[Y|D=d,X=x,Z=z]=\mu(d,x)+E[U_d|X=x,V=v]. \end{align} Hence, it justifies regressing $Y$ on $(D,X)$ with an additive correction term Newey:1999tu. This argument works only when ${\boldsymbol{V}}$ is singleton-valued. In the general setting with a set-valued control function, one can work with the intersection bounds in (ref).

Dynamic Treatment Effects

We consider a model of dynamic treatment decisions with imperfect compliance Robins:1997aa,Han:2021aa. In the initial period, binary treatment $D_1$ (e.g., a medical treatment) and binary outcome $Y_1$ (e.g., the presence of symptoms) are generated according to

align[align omitted — 141 chars of source]

In the next period, the observed treatment status is determined based on the initial treatment and outcome:

align[align omitted — 87 chars of source]

Finally, the outcome in period 2 is determined by

align[align omitted — 87 chars of source]

For each $t$, $U_{t}$ and $V_{t}$ are normalized to $U[0,1]$ conditional on $X=x$.

Consider the effect of the initial outcome and treatment history $D=(Y_1,D_1,D_2)$ on $Y_2$. One may be concerned about endogeneity because $U_2$ may depend on $(U_1,V_1,V_2)$. For example, $U_1$ and $U_2$ may share a time invariant component. Another possibility is that $U_2$ may be related to $(V_1,V_2)$ through the agent's dynamic treatment take-up decisions.

Below, we let $Y\equiv Y_2$, $U\equiv U_2$ and let $V\equiv(U_1,V_1,V_2)$ be unobserved control variables; also let $Z\equiv(Z_1,Z_2)$, and let $\pi\equiv(\mu_1(\cdot),\pi_1(\cdot),\pi_2(\cdot))$. Inspecting the system of selection equations, the assignment of $D=(Y_1,D_1,D_2)$ is independent of $U_2$ conditional on $(X,V)$ as long as the instrumental variables $Z$ are independent of $U_2$.

For notational simplicity, we rewrite (ref) as

align[align omitted — 35 chars of source]

and derive the model prediction ${\boldsymbol{Y}}$ as follows. First, let $U=Q(\eta|X,V)=F^{-1}(\eta|X,V)$. Then,

align[align omitted — 143 chars of source]

where $H(d,x,v)\equiv F(\mu(d,x)|x,v)$ is the average response conditional on $(x,v)$.

Next, the dynamic selection and outcome equations allow us to restrict $V$ to the following set:

align[align omitted — 185 chars of source]

where

align*[align* omitted — 483 chars of source]

By the augmented outcome equation (ref) and (ref), we obtain the following model prediction:

align[align omitted — 392 chars of source]

This expression exhibits an incomplete threshold-crossing structure shown in Figure (ref).\footnote{The incomplete threshold-crossing structure also appears in semiparametric binary choice models with interval-valued covariates Manski:2002um. Manski:2002um's Manski:2002um model is considerably different from ours; they consider $Y=1\{W'\theta+\delta X^{*}+\epsilon>0\}$, where $W$ is exogenous, $X^{*}$ is observed as an interval (i.e. $X^{*}\in [X_L,X_U]$), $\delta>0$ and $\epsilon$ satisfies a quantile independence condition. See also Molinari:2020un (Section 3.1.1) for an extensive discussion of their model.} If $\eta$ is below the lower threshold, the model predicts ${\boldsymbol{Y}}=\{1\}$, whereas ${\boldsymbol{Y}}=\{0\}$ if $\eta$ is above the upper threshold. The model predicts ${\boldsymbol{Y}}=\{0,1\}$ if $\eta$ is between the two thresholds.

figure[figure omitted — 827 chars of source]

The containment functional of ${\boldsymbol{Y}}$ in (ref) satisfies

align*[align* omitted — 369 chars of source]

Theorem (ref) then implies simple identifying restrictions:

align[align omitted — 157 chars of source]

We may apply this argument sequentially to (ref)--(ref). The next step is to take $Y=D_2$ as an outcome, $D=(Y_1,D_1)$ as a treatment, $U=V_2$ as a latent variable in the outcome equation, and $V=(V_1,U_1)$ as control variables, which generates inequalities of the form (ref). Finally, we may apply the same argument to the outcome and selection equations in period 1. Corollary (ref) in the Appendix characterizes the sharp identification region for $\theta$.

Treatment Responses with Social Interactions

We consider settings where other individuals' treatment status affects one's outcome through spillover or equilibrium effects. Let individuals be indexed by $j=1,\dots,J$. Let $D=(D_{1},\dots,D_{J})$ be a vector of treatment decisions across individuals and let $D_{-j}$ be the vector $D$ without the element $D_{j}$. Consider the effect of the entire profile $D$ on some outcome $Y$. For example, $D$ indicates entries of potential market participants (e.g., airlines) and $Y$ is a market-level outcome (e.g., pollution). Suppose the observed treatments $D$ satisfy

align[align omitted — 103 chars of source]

where $V_{j}|X=x$ is normalized to $U[0,1]$.\footnote{The joint distribution of $V=(V_1,\dots,V_J)$ is unrestricted.}

Many empirical settings require relaxing the Stable Unit Treatment Value Assumption (SUTVA) Rubin1973 (or, equivalently, the Individualistic Treatment Response (ITR) of Manski:2013aa), particularly when outcomes are shaped by interactions across individuals. One way to motivate (ref) is to allow for such interdependence through strategic selection. Let $Y_{j}(d_{1},\dots,d_{J})$ be the potential outcome of individual $j$ when $D$ is set to $(d_{1},\dots,d_{J})$. Previous examples assume an individual's outcome only depended on their own treatment (i.e., SUTVA or ITR) that $Y_{j}(d_{1},\dots,d_{J})=Y_{j}(d_{j})$. We istead allow each individual's outcome to depend on the entire vector of treatments received by the individuals, capturing spillover effects that are central in many empirical applications Graham:2011aa,Aronow:2017aa.

For simplicity, consider two individuals. Each faces a binary action $d_j$. For individual $j$ and $(d_1,d_2)\in \mathcal{D}=\{0,1\}^2$, let

align[align omitted — 107 chars of source]

The observed outcome is generated according to $Y_{j}=\sum_{(d_{1},d_{2})\in\mathcal{D}}1\{D_{1}=d_{1},D_{2}=d_{2}\}Y_{j}(d_{1},d_{2}).$ Suppose the individuals are involved in Roy-type decisions:

align*[align* omitted — 159 chars of source]

Namely, each individual chooses 1 if the payoff of choosing 1 over 0 weakly exceeds its cost, given the other individual's action. A key difference from the previous examples is the presence of externalities in the selection process. This selection process is compatible with (ref) with

align*[align* omitted — 158 chars of source]

The individuals' social/strategic interaction is captured by the impact of the other individual's treatment status on player $j$'s payoff, which corresponds to $\pi_{j}(1,z_{j},x)-\pi_{j}(0,z_{j},x)$.

Multiple solutions to the simultaneous equation system (ref) may exist, which makes the selection process set-valued Tamer:2003tr,ciliberto2021market,Balat:2022aa. For example, suppose the selection process involves strategic substitution, i.e., $\pi_j(1,z_j,x)-\pi_{j}(0,z_j,x)\le 0$ for $j=1,2$.\footnote{A similar argument can be applied to games of strategic complementarity and even to models with incoherent predictions.} The model's prediction is $D\in G(V_1,V_2|Z,X,;\pi)$ with

align[align omitted — 340 chars of source]

Figure (ref) summarizes the subsets $S_{\pi,(0,0)}(z,x),\dots, S_{\pi,\{(1,0),(0,1)\}}(z,x)$. This model differs from other examples because the selection process itself is incomplete.

We construct a generalized selection equation as in (ref) by introducing a random variable $V_s:\Omega\to\{0,1\}$ representing an unknown selection mechanism. Without loss of generality, suppose that the treatment status $D=(1,0)$ ($D=(0,1)$) is selected when $V_s=1$ ($V_s=0$) and multiple values of $D$ are predicted.\footnote{One may represent the selection mechanism by a latent random variable defining a mixture without loss of generality. See Tamer:2010aa, Ponomareva:2011aa, Molchanov:2018ui and Molinari:2020un.} We do not impose any restrictions on the distribution of $V_s$, reflecting the researcher's agnosticism against the selection. We then let $V\equiv(V_1,V_2,V_s)$ be a vector of controls.

Suppoose that $Z$ is independent of $U\equiv(U_{j,d_1,d_2}, U_{c_j})_{(d_1,d_2)\in \mathcal{D},j=1,2}$ given the control variables $(X, V_1, V_2, V_s)$. The set-valued control function can be constructed as follows:

align[align omitted — 448 chars of source]

In words, if $D=(0,0)$ is realized, it implies that $(V_1,V_2)\in S_{\pi,(0,0)}(Z,X)$, regardless of the value of $V_s$. Therefore, $V$ belongs to $S_{\pi,(0,0)}(Z,X)\times\{0,1\}$. Similarly, if $D=(0,1)$ realizes, then either $(0,1)$ is uniquely predicted due to $(V_1,V_2)\in S_{\pi,(0,1)}(Z,X)$ (and $V_s$ unrestricted) or $(0,1)$ is selected from the set of treatment statuses due to $(V_1,V_2)\in S_{\pi,\{(1,0),(0,1)\}}(Z,X)$ and $V_s=0$. The other cases can be analyzed similarly.

figure[figure omitted — 1,633 chars of source]

We work with the conditional mean-independence assumption. Recall $D\equiv(D_1,D_2)$. Define the model prediction

align[align omitted — 180 chars of source]

where $\lambda_{d}(x,v)$ is the conditional mean function of $U_{d}|X,V$. Let us rewrite the set-valued control function in (ref) as a union of two random sets.

align[align omitted — 183 chars of source]

where

align[align omitted — 217 chars of source]

and

align[align omitted — 217 chars of source]

As in the previous examples, the sharp identification region for $\theta \equiv(\mu,\pi,F)$ involves the supremum and infimum of a function $f$ over $v\in {\boldsymbol{V}}(d,x,z;\pi)$. Eq. (ref) suggests that the supremum, for example, can be written as

align[align omitted — 234 chars of source]

We use (ref) from Theorem (ref) and argue as in Example (ref) to characterize the sharp identification region.

corollarySuppose $E_{P_0}[|Y|]<\infty.$ Suppose $U\equiv(U_{00},U_{10},U_{01},U_{11})$ has a strictly positive conditional density given $(X,V)$. Suppose, for each $(d_1,d_2)\in\mathcal{D}$, $E[U_{d_1,d_2}|Z,X,V]=E[U_{d_1,d_2}|X,V],~a.s.$ Then, $\Theta_I(P_0)$ is the set of parameter values $\theta \equiv(\mu,\pi,F)$ such that, for almost all $(d,x)$, \begin{multline} \sup_{z\in\mathcal{Z}}\Big\{E_{P_0}[Y|D=d,X=x,Z=z]-\lambda_U(d,x,z)\Big\} \\ \le \mu(d,x)\le \\ \inf_{z\in\mathcal{Z}}\Big\{E_{P_0}[Y|D=d,X=x,Z=z]-\lambda_L(d,x,z)\Big\}, \end{multline} where \begin{align} \lambda_U(d,x,z)&\equiv\max\big\{\sup_{(v_1,v_2)\in\tilde{\boldsymbol{V}}_0(d,x,z;\pi)}{\lambda_d(x,v_1,v_2,0)},\sup_{(v_1,v_2)\in\tilde{\boldsymbol{V}}_1(d,x,z;\pi)}{\lambda_d(x,v_1,v_2,1)}\big\},\\ \lambda_L(d,x,z)&\equiv\min\big\{\inf_{(v_1,v_2)\in\tilde{\boldsymbol{V}}_0(d,x,z;\pi)}{\lambda_d(x,v_1,v_2,0)},\inf_{(v_1,v_2)\in\tilde{\boldsymbol{V}}_1(d,x,z;\pi)}{\lambda_d(x,v_1,v_2,1)}\big\}. \end{align}
remarkOne may impose further restrictions on the relationship between $U$ and $V_s$ via a priori restrictions on $F$. An example is to assume $U$ is independent (or mean independent) of the selection mechanism conditional on other control variables. This assumption is plausible if $V_s$ is viewed as a signal that is only relevant for the treatment decision (e.g., firms' profitability), but irrelevant for the outcome (e.g., pollution level). Imposing this assumption allows us to exclude $v_s$ from $\lambda_d$: $\lambda_d(x,v_1,v_2,1)=\lambda_d(x,v_1,v_2,0)\equiv\lambda_d(x,v_1,v_2)$.
remarkWith additional assumptions, it is possible to point identify $\pi$. Specifically, suppose $(V_{1},V_{2})\perp(Z_{1},Z_{2})|X$, and for each $j$, $Z_j=(Z_{j,k},Z_{j,-k})$ contains a continuous component $Z_{jk}$ supported on $\mathbb R$. Furthermore, $supp(Z_j,X|Z_{-j})=supp(Z_j,X)$, $a.s.$ Tamer:2003tr shows, if one can vary the continuous component to push the choice probabilities toward extreme values, i.e., $\pi_j$ is such that $\lim_{z_{j,k}\to-\infty}\pi_j(0,z_{j,k},z_{j,-k},x)=0$, and $\lim_{z_{j,k}\to\infty}\pi_j(1,z_{j,k},z_{j,-k},x)=1$, then, $\pi$ is point identified. This argument, however, requires a variable with a large support (for each player).
remarkThe recent work by ciliberto2021market simultaneously estimates the parameters of the incomplete entry model and an outcome model (demand and supply). Their approach can be viewed as a generalization of the simultaneous estimation of a triangular system. In contrast, we use the incomplete entry model to construct a set-valued control function, which is a generalization of the control function approach to a triangular system. Moreover, we are interested in identifying treatment effects, while their focus is recovering market primitives.

Effects of School Assignment under Capacity Constraints

To illustrate how the framework applies to causal inference on institutional assignment problems with preferences and constraints, we consider the effect of school choice on educational outcomes. Following bertanha2024causal, consider a continuum population of students and a set of four schools, $\mathcal{J}\equiv\{1,\ldots,4\}$ with an exam school (school 4), a magnet school (school 2), other exam or magnet schools (schools 1 and 3). Assume all schools are acceptable to students (i.e., preferred to outside options). Let $Q$ denote the true preference relation of a student over the set of options $\mathcal{J}$.\footnote{Within this section, we use $Q$ and $P$ to denote preferences, maintaining notational consistency with bertanha2024causal. We also use $\boldsymbol{Q}$ for a set-valued control function.} For example, if $Q=(4,2,3,1)$, then 4 is preferred to 2 (i.e., $4Q2$), 2 is preferred to 3 (i.e., $2Q3$), and so on.

Let $Y(d)$ be the potential outcome (e.g., GPA) of a student being assigned to option $d\in\mathcal{J}$. Let $S\equiv\left(S_{1},\ldots,S_{4}\right)\subseteq\mathbb{R}^{4}$ be a vector of placement scores of a student and, for scores $S$ of a student and admission cutoffs $c\equiv\left(c_{1},\ldots,c_{4}\right)$ of schools, the set of feasible options of the student is $B(S)\equiv\left\{ j\in\mathcal{J}:S_{j}\geq c_{j}\right\}$.\footnote{For simplicity, assume that placement scores and cutoffs do not have ties. bertanha2024causal consider a more general framework.} Finally, for a given preference $Q$ and a focal school $j\in\mathcal{J}$, define a local preference $Q_{j}\equiv(k,l)\in\mathcal{J}\times\mathcal{J}$ where $k$ is the most preferred school in the set of feasible options plus $j$ (i.e., $B(S)\cup\{j\}$) and $l$ is the most preferred school in the set of feasible options minus $j$ (i.e., $B(S)\setminus\{j\}$). Continuing the example with $Q=(4,2,3,1)$, if the student passes all exams except that for school 3 (i.e., $B(S)=\{1,2,4\}$), then the local preference at exam cutoff $c_4$ of focal school 4 is $Q_4=(4,2)$.

Based on students' reported preferences, a centralized assignment mechanism (e.g., a deferred acceptance algorithm) can be employed to match students to schools. If students' reported preferences $P$ are equal to their true preferences $Q$, then the local preference $P_{4}=Q_{4}$ serves as a control variable, and conditioning on it suffices to apply a regression discontinuity design (RDD). Let $Y(l)$ be the counterfactual GPA after being assigned to school $l\in \{2,4\}$. Conditional on the local preference and under the continuity of the distribution of $Y(l)$ ($l\in \{2,4\}$) with respect to the placement score for school 4, $S_4$, one can identify the effect on GPA of assigning the magnet school (school $4$) relative to the exam school (school $2$) at the cutoff kirkeboen2016field, Abdulkadiroglu:2019aa:

align*[align* omitted — 227 chars of source]

In reality, school assignment mechanisms face various constraints (e.g., capacity constraints, application costs), in which case, students have incentives to strategically misreport their preferences Agarwal:2018aa,Fack:2019aa. This case is the main focus of bertanha2024causal. Suppose students submit a partial order $P$ of their true preferences $Q$, subject to a cap of three on the number of schools they can apply to. Then, we do not observe the full preference ordering $Q$, but only a partial order $P$ of $Q$ with $|P|\leq 3$. This introduces ambiguity in using true (local) preferences as controls, which nonetheless can be accommodated by a set-valued control function.

Fix school $4$ with cutoff $c_{4}$. Consider students who report preferences over three schools, $P=(4,2,3)$, and have placement scores $S=\left(S_{4},S_{-4}\right)$. Their best feasible options above and below $c_4$ are $B(S)\cup\{4\}=\{1,2,4\}$ and $B(S)\setminus\{4\}=\{1,2\}$, respectively. Assuming that students are matched to their best feasible options according to $P$, those with $S_4\ge c_4$ are matched to school 4 and those with $S_4 < c_4$ are matched to school 2. In both cases, the reported local preference at $c_4$ is $P_{4}=(4,2)$, which is no longer necessarily equal to true local preference $Q_{4}$.

Upon observing $P$ and $S$, we can only infer that the true local preference $Q_{4}$ belongs to

align[align omitted — 177 chars of source]

The intuition is simple: when $S_4\ge c_4$, assignment to school 4 is consistent with multiple underlying preferences (i.e., $Q_4=(4,1)$ or $(4,2)$), whereas when $S_4<c_4$, assignment to school 2 rules out $(4,1)$.

Hence, unlike in the truth-telling benchmark where $P_{4}=Q_{4}=(4,2)$, we can only recover a set of $Q_{4}$'s that is consistent with reported $P=(4,2,3)$. Under the assumption that $Q_{4}\in\boldsymbol{Q}_{4}$ with probability 1 conditional on $S_{4}$ (cf. Assumption 6(i) in bertanha2024causal), the set-valued control $\boldsymbol{Q}_{4}$ can be used to construct sharp bounds on the effect of school assignment, $E\left[Y(4)-Y(2)\mid Q_{4}=(4,2),S_{4}=c_{4}\right]$.

Assume $Y(l)=\mu(l,S_{4})+U$ for $l\in \{2,4\}$ and let $\lambda(Q_{4},S_{4})\equiv E[U|Q_{4},S_{4}]$.\footnote{We can allow for a more general specification $Y(l)=\mu(l,Q_{4},S_{4})+U_l$ for $l\in\{2,4\}$ where $\mu$ is also a function of $Q_4$ and $U_l$ replaces $U$, following Section (ref). With the vector unobservables, $(U_2,U_4)$, one can define $\lambda_l(Q_{4},S_{4})\equiv E[U_l|Q_{4},S_{4}]$ for $l\in\{2,4\}$. Then, the RDD approach will require assuming $\lambda_4(Q_{4},c_{4})=\lambda_2(Q_{4},c_{4})$, while our partial identification approach do not rely on such an assumption.} Then, the parameter of interest can be expressed as $$E\left[Y(4)-Y(2)\mid Q_{4}=(4,2),S_{4}=c_{4}\right]= \mu(4,c_{4})-\mu(2,c_{4}).$$ Conditional on $Q_{4}=(4,2)$ and $S_{4}\geq c_{4}$, we may write $$Y=\mu(4,S_{4})+\lambda(Q_{4},S_{4})+\eta,$$ where $\eta\equiv U-\lambda(Q_{4},S_{4})$ satisfies $E[\eta|Q_{4},S_{4}]=0$. Therefore, conditional on $P_{4}=(4,2)$ and $S_{4}\ge c_{4}$, the observed outcome belongs to

align*[align* omitted — 180 chars of source]

Note that we can evaluate $\mu(l,S_4)$ at $l=4$ because, according to the definition (ref), school $4$ is unambiguously determeined as the first element of $Q_4$ when $P_{4}=(4,2)$ and $S_{4}\ge c_{4}$.\footnote{In fact, this is true in the general formulation of $\boldsymbol{Q}_{j}$ in Proposition 2 of bertanha2024causal.} That is, school $4$ is the only school truthfully preferred; otherwise, the true preference would not be consistent with the earlier implication that students with $S_4\ge c_4$ are matched to school $4$.

Fix $P_{4}=(4,2)$ and $s_{4}\ge c_{4}$ below. Since $Y \in \boldsymbol{Y}(\eta,P,S;\mu,\lambda)$, using the Aumann expectation, we have $E[Y|P,S] \in\mathbb{E}[\boldsymbol{Y}(\eta,P,S;\mu,\lambda)|P,S]$, which yields a moment inequality via support function (with $b=1$):

align*[align* omitted — 123 chars of source]

where the right hand side uses $E[\sup_{Y\in\text{Sel}(\boldsymbol{Y}(\eta,P,S;\mu,\lambda))}Y|P=p,S_{4}=s_4,S_{-4}=s_{-4}] =\sup_{q\in\boldsymbol{Q}_{4}(p,s_4,s_{-4})}\{\mu(4,s_4)+\lambda(q,s_4)\}$.

Assume that $\mu(l,\cdot)$ and $\lambda(Q_{4},\cdot)$ are continuous, which implies the usual continuity of $E[Y(l)|Q_4,\cdot]$ for $l\in\{2,4\}$. Taking the limit, we have

multline[multline omitted — 260 chars of source]

A similar argument can be made with $b=-1$ and $s_4\ge c_{4}$, as well as $b\in\{1,-1\}$ and $s_4<c_{4}$.

Consequently, we obtain in total four inequalities for each conditioning value. Note that $\lambda(q,c_{4})$ enters all four inequalities. When $\boldsymbol{Q}_4$ is a singleton, $\lambda(q,c_{4})$ would cancel out when differencing the inequalities to recover the treatment effect. The researcher can further assume separability, such as $\mu(l,S_{4})=\mu_{l} + \tilde\mu(S_{4})$, and derive intersection bounds on $\mu_{l}$. Such a separability assumption would become more plausible once additional covariates $(X,S_{-4})$ are incorporated: $\mu(l,S,X)=\mu_{l}(S,X) + \tilde\mu(S,X)$.

remarkThe bounds resulting from our approach are sharp relative to the maintained assumption. They need not coincide with the analytical bounds (that may not be sharp) and the additional sharp bounds derived in bertanha2024causal, reflecting differences in both the bounding strategies and the underlying assumptions.

Empirical Illustration

We illustrate the framework by revisiting Thornton:2008tp, who studies whether completing voluntary counseling and testing and learning one’s HIV test result affects health preventive behavior in Malawi. We use the application to show how the framework maps a real empirical design into a structural model and delivers inference for policy-relevant objects.

This exercise is intended as a methodological illustration. The main value of our approach in this setting is that it yields interpretable causal objects even when the linear-IV coefficient is difficult to map to a single local average treatment effect (LATE), and it makes transparent how the empirical conclusions depend on maintained assumptions about selection and treatment response.\footnote{Thornton:2008tp studied this problem using a linear IV model with interaction terms and found a modest difference between the effects of learning an HIV-positive diagnosis and those of learning an HIV-negative diagnosis. The study also reported that the TSLS estimate for the HIV-negative group was small. The conventional interpretation of the TSLS estimand as a LATE should be treated with caution in this setting, because the empirical design involves multiple continuous instruments and continuous covariates. In such environments, the TSLS estimand can be interpreted as a positively weighted average of LATEs only under fairly restrictive assumptions MogstadTorgovitskyWalters2021aer,blandholetal2022nber,sloczynski2022notinterpretlineariv.}

The original study was based on the Malawi Diffusion and Ideational Change Project (MDICP), which provided randomized monetary incentives (vouchers) to individuals. These incentives encouraged individuals to visit voluntary counseling and testing (VCT) centers to learn about their HIV status and redeem the vouchers. During a follow-up survey conducted at the respondents’ homes, they were offered to purchase condoms at a discounted price.

The treatment indicator $D_i$ equals one if respondent $i$ completed VCT and learned their HIV test result. The outcome variable $Y_i$ represents the number of condom purchases. We focus on individuals who were sexually active at the time of the survey and purchased either 0, 3, or 6 condoms, which corresponds to 0, 1, or 2 packs of condoms.\footnote{This subsample accounts for 94% of the sample of sexually active individuals. Those outside this sample either purchased condoms at a premium (not by packs) or purchased more than 2 packs, which was rare.} The instrumental variables are $Z_{amt}$, the amount of the monetary voucher, and $Z_{dist}$, the distance to the VCT center, the location of which was randomized. We used the same set of observable controls as in the original study, a dummy variable for the HIV diagnosis ($X_{HIV}=1$ if positive) and additional controls ($\tilde X$): a dummy for male, age, simulated average distance to the VCT center, and a district dummy variable. Let $X\equiv(X_{HIV},\tilde X)$.

Consider a simple ordered choice model of condom purchases:\footnote{We treat $Y$ as an ordered discrete variable, which differs from Thornton:2008tp who treated $Y$ as a continuous variable.}

align[align omitted — 156 chars of source]

Here $U$ captures latent demand for prevention. Selection into learning one’s HIV status is described by

align[align omitted — 61 chars of source]

The unobservable $V$ summarizes latent resistance to learning one’s status. Allowing $U$ and $V$ to be dependent accommodates self-selection, since individuals with stronger latent demand for prevention may also be more or less likely to obtain their test results.

We assume that the conditional distribution of $U$ given $V$ can be written as

align[align omitted — 55 chars of source]

for a measurable function $g$ and an invertible function $Q$.\footnote{Equivalently, $U\mid V$ belongs to a location family with location parameter $g(V)$.} Because $Y$ takes only three ordered values, identification reduces to bounding the conditional probabilities of the lowest and highest outcomes, $Y=0$ and $Y=6$. Proposition (ref) in Appendix (ref) provides the formal sharp characterization.

To make inference computationally tractable, we add further structure to functions $\mu$ and $\pi$. The systematic component of condom demand as

align[align omitted — 80 chars of source]

where the interaction term allows the effect of learning one’s status to differ between HIV-positive and HIV-negative individuals.

For treatment selection, our baseline specification is the single-index model

align[align omitted — 43 chars of source]

where $\tilde{\pi}(z,x)$ is nonparametrically identified from the propensity score and is estimated by a series Logit estimator. This specification imposes a common latent ranking of individuals’ propensity to learn their status across instrument values.

We then relax this common-ranking restriction with a random-coefficient specification,

align[align omitted — 72 chars of source]

where $v=(v_0,v_1)$ is a realization of $(V_0,V_1)$ and we assume $V_1\le 0$ almost surely.\footnote{The coefficient on $Z_{\text{amt}}$ is assumed to be positive and normalized to one.} This model allows individuals to trade off voucher amount and travel distance differently, and therefore admits richer selection patterns than the baseline single-index specification. Appendix (ref) provides further details on how we model the dependence between $U$ and $V$ in each selection model.

We conduct inference for structural objects: the average structural function (ASF), the average treatment effect (ATE), and the counterfactual switching probability. Let $Y(d,x_{HIV})$ denote the counterfactual outcome under treatment status $d$ and HIV status $x_{HIV}$. Then the (structural) switching probability is defined as the share of switchers: $P(Y(0,x_{HIV})=0,\;Y(1,x_{HIV})>0).$ These structural objects can be expressed as functions of $\theta$.

For each object, we construct a confidence interval (CI) $CI_n$ using the universal inference method by KaidoZhang:2024aay. For any $\varphi:\Theta\to\mathbb R$, this interval covers each value of $\varphi(\theta)$ in its sharp identification region (see $\mathfrak K_I(d)$ in Theorem (ref)) with at least a prescribed confidence level in any finite samples. This method is suitable for our setting because it is designed for functions of $\theta$, robust to incompleteness, and computationally feasible in settings with a moderate number of discrete and continuous covariates. We provide details of the implementation in Appendix (ref).

Tables (ref) and (ref) address two policy-relevant questions under the baseline single-index selection model: how learning one’s HIV status changes expected condom demand (the ATE), and what fraction of respondents would switch from buying no condoms to buying some condoms because of the intervention (the counterfactual switching probability). Two patterns emerge. First, the data are only weakly informative about effects for HIV-positive respondents. Second, for the HIV-negative majority, both the sign and the magnitude of the estimated effect depend importantly on the maintained restrictions. Panel A of Table (ref) illustrates this point. For HIV-negative individuals, the ASF under learning ($d=1$) is tightly bounded around 0.5, whereas the counterfactual ASF without learning ($d=0$) is substantially higher, $[1.327,2.141]$. The resulting ATE is therefore strictly negative, $[-1.598,-0.874]$. Under the baseline model, learning one’s HIV-negative status is thus associated with a reduction in condom demand.

Because HIV-negative individuals constitute the main prevention-relevant group, we next examine how this conclusion changes as additional restrictions are imposed on treatment response and selection. We illustrate that imposing additional identifying restrictions is straightforward within our framework without needing to prove sharpness for each case. We begin with monotone treatment selection (MTS) manski_pepper00, which requires that for each $d=0,1$, \[ E[Y(d)\mid D=1]\ge E[Y(d)\mid D=0]. \] A natural interpretation is that individuals who choose to learn their HIV status are, holding treatment fixed, more health-conscious and therefore more likely to purchase condoms. Under our specification, this restriction corresponds to $\rho\le 0$. Panel B of Table (ref) shows that imposing MTS has little effect: the ASF and ATE intervals remain close to those in the baseline specification, suggesting that MTS adds little identifying content in this application.

We next impose monotone treatment response (MTR) manski1990nonparametric,manski1997monotone for the HIV-negative group: \[ Y(1)\ge Y(0)\mid X_{HIV}=0,\quad a.s. \] This restriction encodes the view that, all else equal, learning that one is HIV-negative cannot reduce preventive behavior. In our specification, this corresponds to $\mu_1\ge 0$. Panel C of Table (ref) shows that MTR substantially tightens and shifts the estimates. For HIV-negative individuals, the ATE becomes strictly positive and tightly bounded, $[0.633,0.814]$. This sign reversal is driven by the maintained assumption rather than by the data alone. Finally, Panel D combines MTS and MTR. Under both restrictions, the HIV-negative ATE remains positive but is much smaller, with CI $[0.03,0.09]$. Taken together, the results from Table (ref) show that, under the baseline selection model, the effect for HIV-negative individuals is highly assumption-sensitive. Even when monotonicity restrictions force the effect to be positive, the implied increase in condom purchases is modest. By contrast, the effects for HIV-positive individuals remain much less precisely estimated throughout, possibly due to the limited sample size.

Table (ref) tells a similar story for extensive-margin responses. Without additional restrictions (Panel A), the structural switching probability is bounded above by 0.191 for HIV-positive individuals but is degenerate at zero for HIV-negative individuals, so the baseline model provides no evidence of upward switching for the latter group. Imposing MTS (Panel B) leaves the bounds essentially unchanged, again indicating that MTS contributes little additional identifying power.

Under MTR for HIV-negative individuals (Panel C), the switching probability becomes strictly positive for both groups. For HIV-negative individuals, the interval tightens to $[0.156,0.216]$. This occurs because once learning is restricted from lowering preventive behavior, the model necessarily assigns positive mass to individuals who move from no purchase to some purchase. When MTS and MTR are imposed jointly (Panel D), the HIV-negative interval shrinks to $[0,0.03]$, so zero is no longer ruled out and any extensive-margin response is small at most. For HIV-positive individuals, the bounds remain wide, $[0,0.352]$, and continue to include zero.

Overall, the switching results reinforce the main message from the ASF and ATE estimates: under the baseline selection model, evidence of behavioral change is highly sensitive to the maintained monotonicity restrictions, and for HIV-negative individuals the implied mass of switchers remains limited.

table[table omitted — 1,174 chars of source]
table[table omitted — 738 chars of source]
table[table omitted — 1,180 chars of source]
table[table omitted — 753 chars of source]

The results above are obtained under the parsimonious baseline single-index selection model. We now assess how sensitive these conclusions are to relaxing that structure.

Table (ref) reports the corresponding results under the random-coefficient (RC) selection model, which allows individuals to differ in how they trade off voucher amount and distance to the VCT center. The main message is that the negative effect for HIV-negative individuals is not robust to this more flexible specification. In Panel A, the ASF under treatment for HIV-negative individuals is no longer tightly concentrated around 0.5; instead, it ranges from $[0.784,1.266]$, while the ASF under no treatment is of similar magnitude, $[0.814,1.477]$. As a result, the ATE is no longer sign-identified, with CI $[-0.573,0.392]$. This suggests that the sharp negative effect under the baseline model is driven in substantial part by its restrictive common-ranking structure.

This pattern persists across Panels A--D. For HIV-negative individuals, the ATE intervals remain wider than under the baseline model and either include zero or become only modestly positive under the MTR restriction. For HIV-positive individuals, the data remain weakly informative throughout: the ATE intervals are wide in every specification and consistently include zero.

Table (ref) shows a similar pattern for the switching probability. For HIV-negative individuals, the share of switchers remains small across all specifications, with upper bounds between 0.085 and 0.126 in Panels A--D. Relative to the baseline model, these bounds are looser and, in particular, the strictly positive lower bound obtained under MTR in Panel C disappears. Thus, once the selection model is made more flexible, the data no longer support a robustly positive mass of HIV-negative individuals who switch from buying no condoms to buying some condoms in response to the intervention.

Taken together, the RC results imply that the intervention is unlikely to induce large changes in condom demand among the policy-relevant HIV-negative population despite its nontrivial implementation cost Thornton:2008tp. More broadly, the comparison between Tables (ref) and (ref) highlights that conclusions that appear tight under a parsimonious selection model can become substantially weaker once richer forms of selection heterogeneity are allowed.

Concluding remarks

Observational data are often generated through complex decision processes. Allowing control functions to be set-valued, this paper expands the scope of the control function approach. The proposed framework accommodates, for example, selection processes that involve rich heterogeneity, dynamic optimizing behavior, or social interaction. Our identifying restrictions are inequalities on the conditional choice probabilities. One can conduct inference using moment-based methods or likelihood-based inference methods. Practitioners can use the results of this paper for various purposes. First, they can evaluate social programs nonparametrically, while taking into account potentially complex treatment selection processes. Second, the bounds in our main identification results can easily be combined with a range of shape restrictions and parametric assumptions, allowing practitioners to conduct a sensitivity analysis to assess the additional identifying power of specific assumptions. The tools from random set theory enable us to guarantee sharpness of bounds one obtains in such a sensitivity analysis, without needing to prove sharpness case after case.