Identification and estimation of
dynamic random coefficient models


Abstract

I study linear panel data models with predetermined regressors (such as lagged dependent variables) where coefficients are individual-specific, allowing for heterogeneity in the effects of the regressors on the dependent variable. I show that the model is not point-identified in a short panel context but rather partially identified, and I characterize the identified sets for the mean, variance, and CDF of the coefficient distribution. This characterization is general, accommodating discrete, continuous, and unbounded data, and it leads to computationally tractable estimation and inference procedures. I apply the method to study lifecycle earnings dynamics among U.S. households using the Panel Study of Income Dynamics (PSID) dataset. The results suggest the presence of unobserved heterogeneity in earnings persistence, implying that households face varying levels of earnings risk which, in turn, contribute to heterogeneity in their consumption and savings behaviors.

Keywords: panel data regression, lagged dependent variable, heterogeneous coefficients, partial identification.

1 Introduction↩︎

Linear panel data models with predetermined regressors (e.g., lagged dependent variables) are widely used in empirical research [1], [2]. Many of these models incorporate fixed effects, which are individual-specific intercepts that account for unobserved heterogeneity in the levels of the dependent variable. Fixed effects provide a flexible means of controlling for such heterogeneity, facilitating empirical research such as evaluation of a public policy. Fixed effects models are well understood in the context of short panel data (i.e., panel data with a small number of periods).

In addition to heterogeneity in the levels of dependent variables, there is ample evidence that individuals exhibit unobserved heterogeneity in the effects of regressors on dependent variables. For example, firms have varying degrees of labor efficiency in production; individuals experience different returns on education; and households differ in the persistence of earnings with respect to their past earnings. Such heterogeneous effects are crucial mechanisms for generating heterogeneous responses to exogenous shocks and policies, such as employment subsidies, tuition assistance, and income tax reforms. Moreover, these heterogeneous effects play a first-order role in determining outcomes in various economic models. For instance, heterogeneity in earnings persistence drives differences in the earnings risk faced by households, which, in turn, influences their heterogeneous motives for precautionary savings within lifecycle consumption models.

This paper examines a linear panel data model with predetermined regressors that permits unobserved heterogeneity in both the effects of regressors and the levels (i.e., a dynamic random coefficient model) in a short panel context. Consider a stylized example: \[Y_{it} = \beta_{i0} + \beta_{i1}Y_{i, t-1} + \varepsilon_{it},\] where all variables are scalars and \(\varepsilon_{it}\) is uncorrelated with the current history of \(Y_{it}\) (up to time \(t-1\)) but may be correlated with its future values. In this model, both the coefficient \(\beta_{i1}\) and the intercept \(\beta_{i0}\) are individual-specific, capturing heterogeneity in the effects of regressors and the levels. Moreover, the inclusion of the lagged dependent variable \(Y_{i,t-1}\) as a regressor makes it a dynamic model.

Analysis of this model is challenging in short panels, as it is impossible to learn about individual values of the \(\beta_i\) parameters with a small number of periods. An influential study by [3], [4] showed that the mean of the \(\beta_i\)s in dynamic random coefficient models is not point-identified, implying that it cannot be consistently estimated. Since this negative result in the 1990s, progress in the literature has been limited. [5] showed that, for binary regressors, the mean of the \(\beta_i\)s for certain subpopulations is identifiable and thus consistently estimable, but they did not establish a general identification result applicable to non-binary regressors. Most research on random coefficient models in short panels has focused on non-dynamic contexts [5][8], which exclude important dynamic mechanisms, such as the feedback from the current dependent variable to future regressors. For instance, a firm’s labor purchase decision in the following period may depend on its current output, as the firm might learn about its own labor efficiency from that output. Moreover, understanding these dynamic mechanisms is of independent interest. For example, a household’s earnings persistence with respect to its past earnings is an important parameter, since high persistence increases the duration of earnings shocks, diminishing the household’s ability to smooth consumption and, ultimately, impacting welfare.

This paper is, to the best of my knowledge, the first to present a general identification result for dynamic random coefficient models in a short panel context. Identification results are presented for various features of the coefficients, including their mean, variance, and cumulative distribution function (CDF). In addition, this paper proposes a computationally feasible estimation and inference procedure for these features. The procedure is then applied to investigate unobserved heterogeneity in lifecycle earnings dynamics among U.S. households using the Panel Study of Income Dynamics (PSID) dataset. These are presented in three steps.

First, I show that dynamic random coefficient models are partially identified, and I characterize finite lower and upper bounds for a class of parameters including the mean, variance, and CDF of the coefficient distribution. While these characterizations yield bounds that are not necessarily sharp, they are sufficiently general to accommodate discrete, continuous, or unbounded data. Moreover, for the mean of the coefficient distribution, the characterization yields a simple closed-form expression for its bounds, which clearly demonstrates that the bounds remain finite even when the data are unbounded, provided that certain moments of the data are finite. These results are obtained by recasting the identification problem as a linear programming problem [9][12], which becomes infinite-dimensional when the data or the coefficients are continuous. I then employ the dual representation of infinite-dimensional linear programming [13], [14] to derive the bounds for the parameters of interest.

Second, I propose computationally efficient estimation and inference procedures for the bounds. For the mean of the coefficient distribution, the closed-form expressions for its lower and upper bounds yield a simple and easy-to-implement estimation and inference procedure. In particular, I adopt the approach of [15] and develop a simple procedure for constructing confidence intervals that are not only valid but also robust to overidentification and model misspecification. For other features of the coefficient distribution, such as the variance and the CDF, I use the approach of [16], which performs inference on a continuum of moment inequalities and includes countably many moment inequalities as a special case. Although this procedure is computationally more demanding than that for the mean parameters, it remains computationally feasible for inference on various features of the coefficients.

Third, I estimate a reduced-form lifecycle model of earnings dynamics. Lifecycle earnings processes are key inputs in various economic models, including those of lifecycle consumption dynamics [17][20]. Specifying an earnings process that captures features of real data is important for calibrating and drawing conclusions from these models. I investigate unobserved heterogeneity in the earnings of U.S. households using the Panel Study of Income Dynamics (PSID) dataset. [21], [22] pointed out that, when allowing for unobserved heterogeneity in the time trend of earnings (known as a heterogeneous income profile, HIP), the estimated persistence of the income process is significantly below 1, with the latter being the estimate from the model that assumes no heterogeneity in the time trend (known as a restricted income profile, RIP). I extend this analysis by estimating a more general model that also permits unobserved heterogeneity in earnings persistence itself. I find that both the HIP and RIP specifications yield similar estimates of the average earnings persistence, with values significantly below 1. This suggests that misspecifying HIP as RIP (or vice versa) may not lead to serious model misspecification when earnings persistence is allowed to vary across households. Moreover, I find evidence of unobserved heterogeneity in earnings persistence itself, implying that households face different levels of earnings risk, which in turn contributes to heterogeneity in their consumption and savings behavior.

The identification results in this paper can be extended to other structural models to accommodate heterogeneous effects. For example, these results can be applied to models with individual-specific coefficients and intercepts in probit and logit regressions2. They can also be extended to vector-valued regressions, such as panel data vector autoregressive (VAR) models and systems of panel data regressions.

The remainder of this paper is structured as follows. 2 introduces the dynamic random coefficient model. [sec.mean,sec.general] present the identification results for the model, focusing on the mean in 3 and on more general features in 4. 5 discusses the estimation and inference procedures, and 6 applies these methods to lifecycle earnings dynamics. 7 concludes the paper. All proofs are provided in Online Appendix 9.

2 Model and motivating examples↩︎

The dynamic random coefficient model is specified as follows: \[Y_{it} = Z_{it}'\gamma_i + X_{it}'\beta_{i} + \varepsilon_{it}, \qquad t=1, \ldots, T,\] where \(i\) is an index of individuals, \(T\) is the length of panel data, \((Y_{it}, Z_{it}, X_{it}) \in \mathbb{R} \times \mathbb{R}^q \times \mathbb{R}^p\) are observed real vectors at time \(t \in \{1, \ldots, T\}\), and \(\varepsilon_{it} \in \mathbb{R}\) is the idiosyncratic error at time \(t\). I assume \[\mathbb{E}(\varepsilon_{it}|\gamma_i, \beta_i, Z_{i1}, \ldots, Z_{iT}, X_{i1}, \ldots, X_{it}) = 0,\] which states that \(\varepsilon_{it}\) is mean-independent of the full history of \(\{Z_{it}\}\) (i.e., strict exogeneity) and of the current history of \(\{X_{it}\}\) (i.e., sequential exogeneity). The inclusion of a sequentially exogenous regressor \(\{X_{it}\}\) makes it a dynamic model. For example, the lagged dependent variable \(Y_{i,t-1}\) can be included in \(X_{it}\).

Let \(R_{it} = (Z_{it}', X_{it}')'\) be the vector of regressors at time \(t\), and let \(B_i = (\gamma_i', \beta_i')'\) be the vector of random coefficients. In addition, let \(Y_i = (Y_{i1}, \ldots, Y_{iT})\) be the full history of \(\{Y_{it}\}\), and let \(Y_i^t = (Y_{i1}, \ldots, Y_{it})\) be the history of \(\{Y_{it}\}\) up to time \(t\). Define \(X_i\), \(X_i^t\), \(Z_i\), \(Z_i^t\) similarly. With these definitions, I concisely write the model as: \[Y_{it} = R_{it}'B_i + \varepsilon_{it}, \quad t=1, \ldots, T, \label{eq46crc}\tag{1}\] and \[\mathbb{E}(\varepsilon_{it}|B_i, Z_i, X_i^t) = 0. \label{eq46meanindep}\tag{2}\]

The model is studied in a short panel context, which corresponds to the asymptotics that the number of individuals \(N \rightarrow \infty\) while the number of time periods \(T\) remains fixed. The random coefficients \(\gamma_i\) and \(\beta_i\) are unobserved random variables that follow nonparametric distributions, and they may be arbitrarily correlated with each other as well as with \((Z_i, X_{i1})\). This is how the random coefficient model extends a fixed effects model.

I summarize the variables of the model as two random vectors: the observable data \(W_i = (Y_i', Z_i', X_i')' \in \mathcal{W}\) and the unobservable random coefficients \(B_i \in \mathcal{B}\). Note that \((W_i, B_i)\) also summarizes \(\varepsilon_{it}\) by the relationship \(\varepsilon_{it} = Y_{it} - R_{it}'B_i\).

Given this model, I consider a parameter \(\theta\) of the form \[\theta = \mathbb{E}(m(Y_i, Z_i, X_i, \gamma_i, \beta_i)) = \mathbb{E}(m(W_i, B_i))\] for some known function \(m\). I present identification results for a generic function \(m\), but I focus on the case in which \(m\) is either a polynomial or an indicator function of \(B_i\), which allows for computationally feasible estimation and inference. This choice of \(m\) includes many important parameters of interest. For example, \(\theta\) can be an element of the mean of the random coefficients \(\mathbb{E}(B_i)\) or an element of the second moments \(\mathbb{E}(B_iB_i')\). It can also represent the error variance \(\mathbb{E}(\varepsilon_{it}^2)\) because \(\varepsilon_{it}^2 = (Y_{it} - R_{it}'B_i)^2\) is a quadratic polynomial in \(B_i\). Another example is the CDF of \(B_i\) evaluated at \(b\), in which case one sets \(m = \mathbf{1}(B_i \leq b)\) so that \(\theta = \mathbb{E}(\mathbf{1}(B_i \leq b)) = \mathbb{P}(B_i \leq b)\).

Example 1 (Household earnings).

One of the simplest examples of (1 ) is the AR(1) model with heterogeneous coefficients: \[Y_{it} = \gamma_i + \beta_i Y_{i,t-1} + \varepsilon_{it}, \label{eq46income}\tag{3}\] where all variables are scalars. This is a special case of (1 ), with \(Z_{it} = 1\) and \(X_{it} = Y_{i,t-1}\).

The AR(1) model is a popular choice for empirical specification of the lifecycle earnings process, with \(Y_{it}\) representing log-earnings, an important input in models of consumption and savings behavior3. The earnings persistence parameter, \(\beta_i\), governs the earnings risk experienced by households, which is a fundamental motive for precautionary savings. Specifying an earnings process that highlights features of real data is important for drawing conclusions from models of consumption and savings behavior. In the literature, the earnings process is often modeled as an AR(1) process with homogeneous coefficients [25][27], or as a unit root process, i.e., an AR(1) model with \(\gamma_i=0\) and \(\beta_i=1\) [17], [28], [29].

Example 2 (Household consumption behavior).

Consider a model of lifecycle consumption behavior: \[C_{it} = \gamma_{i0} + \gamma_{i1} Y_{it} + \beta_{i} A_{it} + \nu_{it}, \label{eq46consumption}\tag{4}\] where all variables are scalars. In this equation, \(C_{it}\) is non-durable consumption, \(Y_{it}\) is earnings, and \(A_{it}\) is asset holdings at time \(t\), all measured in logs. In this specification, \(Y_{it}\) can be regarded as strictly exogenous, implying that future earnings are unaffected by the current consumption choice. In contrast, \(A_{it}\) must be taken as sequentially exogenous, as assets and consumption are interrelated through the intertemporal budget constraint.

The model in (4 ) can be viewed as an approximation of the consumption rule derived from a structural model [19]. One parameter of interest is \(\gamma_{i1}\), the elasticity of consumption with respect to earnings. This elasticity measures a household’s ability to smooth consumption in response to exogenous changes in earnings, such as earnings shocks, thereby mitigating adverse impacts on household welfare. Another parameter of interest is \(\beta_i\), the elasticity of consumption with respect to asset holdings, which measures the household’s capacity to smooth consumption in response to exogenous asset changes. Note that the model in (4 ) remains agnostic about the evolution of assets over time, i.e., it allows for a nonparametric evolution of the asset process.

Example 3 (Production function).

An influential paper by [30] considered the estimation of the production function for firms operating with Cobb-Douglas technology. In their work, the following model was analyzed: \[Y_{it} = \gamma_0 + \gamma_a A_{it} + \gamma_k K_{it} + \gamma_l L_{it} + \omega_{it} + \varepsilon_{it}\] where \(Y_{it}\) is the log-output of firm \(i\) at time \(t\), \(A_{it}\) is the firm’s age, and \(K_{it}\) and \(L_{it}\) are the logs of capital and labor inputs, respectively. In this model, \(\omega_{it}\) and \(\varepsilon_{it}\) are productivity shocks that are unobservable to the econometrician, while the firm observes \(\omega_{it}\).

[30] assume that firm \(i\)’s investment, \(I_{it}\), is a strictly increasing function of \(\omega_{it}\), so that \(I_{it} = g_t(\omega_{it}, A_{it}, K_{it})\). They then invert this function to obtain \(\omega_{it} = h_t(I_{it}, A_{it}, K_{it})\), where \(h_t = g_t^{-1}(\cdot, A_{it}, K_{it})\). When \(h_t\) is specified as a series function of its arguments, for example, a linear function \(h_t = h_I I_{it} + h_A A_{it} + h_K K_{it}\) (for simplicity, the coefficients do not vary with \(t\)), the production function becomes \[Y_{it} = \gamma_0 + \tilde{\gamma}_a A_{it} + \tilde{\gamma}_k K_{it} + \gamma_L L_{it} + h_I I_{it} + \varepsilon_{it},\] where \(\tilde{\gamma}_a = \gamma_a + h_A\) and \(\tilde{\gamma}_k = \gamma_k + h_K\). [30] then exploit additional moment restrictions implied by the model to separately identify \((\gamma_a, \gamma_k)\) and \((h_A, h_K)\). This approach has been extended and generalized by [31] and [32].

In a recent contribution, [33] estimated a version of this model using a finite mixture specification for \((\gamma_0, \gamma_a, \gamma_k, \gamma_L)\), where they found an evidence of heterogeneity in these coefficients.

This paper also considers an extension of (1 ) that also involves regressors with homogeneous coefficients. Let \(M_{it} = ({Z_{it}^{homo}}', {X_{it}^{homo}}')' \in \mathbb{R}^{q_m+p_m}\) be another vector of regressors, where \(Z_{it}^{homo}\) is a vector of strictly exogenous regressors and \(X_{it}^{homo}\) is a vector of sequentially exogenous regressors. Consider the model \[Y_{it} = R_{it}'B_i + M_{it}'\delta + \varepsilon_{it}, \qquad t=1, \ldots, T, \label{eq46crc46constant}\tag{5}\] where \(\delta \in \mathbb{R}^{q_m+p_m}\) is an unknown parameter, and assume that \[\mathbb{E}(\varepsilon_{it}|B_i, Z_i, X_i^t, Z_i^{homo}, (X_i^{homo})^t) = 0, \label{eq46meanindep46constant}\tag{6}\] where \(Z_i^{homo} = ({Z_{i1}^{homo}}', \ldots, {Z_{iT}^{homo}}')'\) is the full history and \((X_i^{homo})^t = ({X_{i1}^{homo}}', \ldots, {X_{it}^{homo}}')'\) is the history up to time \(t\). While I consider (1 ) as the main model of interest, I will also discuss how the results extend to the model in (5 ) in the context of the mean parameters.

The results of this paper also extend to a multivariate version of (1 ), namely, a system of random coefficient models. For example, one can combine the models in (3 ) and (4 ) to develop a joint lifecycle model of earnings and consumption behavior. This multivariate model permits the coefficients from the two processes to freely correlate among themselves and with \((Y_{i0}, A_{i1})\), allowing for potential correlation between the earnings and consumption processes. A full description of the multivariate model is provided in Online Appendix 10.1.

3 Identification of the mean parameters↩︎

This section and the next section present identification results for the dynamic random coefficient model defined in (1 ) and (2 ). This section focuses on the identification of the mean parameters, and the next section extends the results to a more general class of parameters. Consider the mean of the random coefficient distribution: \[\mu_e = \mathbb{E}(e_\gamma'\gamma_i + e_\beta' \beta_i) = \mathbb{E}(e'B_i)\] where \(e_\gamma\) and \(e_\beta\) are real-valued vectors chosen by the econometrician and \(e = (e_\gamma', e_\beta')'\). For example, if \(e_\gamma = 0\) and \(e_\beta = (1,0,\ldots,0)'\), then \(\mu_e\) is the mean of the first entry of \(\beta_i\).

This section is organized into four subsections. In the first, I show that \(\mu_e\) is generally not point-identified. In the second, I show that \(\mu_e\) is partially identified, for which I derive closed-form expressions for the finite lower and upper bounds of \(\mu_e\). The third subsection then derives the closed-form bounds of \(\mu_e\) when the model also includes regressors with homogeneous coefficients. Lastly, the fourth subsection provides a numerical illustration on the size of the closed-form bounds presented in this section. The results presented in this section are special cases of the more general results discussed in the next section and in Online Appendix 10.3.

3.1 Failure of point identification↩︎

This subsection shows that \(\mu_e\) is generally not point-identified, by considering a specific example of (1 ) and showing that \(\mu_e\) is not point-identified in that example.

The example considered is the AR(1) model with heterogeneous coefficients in which two waves are observed: \[Y_{it} = \gamma_i + \beta_iY_{i,t-1} + \varepsilon_{it}, \qquad \mathbb{E}(\varepsilon_{it}|\gamma_i, \beta_i, Y_i^{t-1})=0, \qquad t=1,2. \label{eq46ar1}\tag{7}\]

The following proposition states that \(\mathbb{E}(\beta_i)\) is not point-identified in this model, which implies that there exists no consistent estimator for \(\mathbb{E}(\beta_i)\).

Proposition 1.

Consider the model defined in (7 ). Assume that \((Y_{i0}, Y_{i1}, Y_{i2}, \gamma_i, \beta_i) \in \mathcal{C}\), where \(\mathcal{C}\) is a compact subset of \(\mathbb{R}^5\). Also assume that \((Y_{i0}, Y_{i1}, Y_{i2}, \gamma_i, \beta_i)\) is absolutely continuous with respect to the Lebesgue measure and that its joint density is strictly positive on \(\mathcal{C}\). Then, \(\mathbb{E}(\beta_i)\) is not point-identified.

[3], [4] showed that \(\mathbb{E}(\beta_i)\) is not point-identified in a version of (7 ) where the regressor is discrete and \(\varepsilon_{it}\) is mean-independent of the regressor. 1 complements this result by showing that point identification also fails under stronger assumptions and with the continuous regressor. The failure of point identification in both the discrete and continuous cases in (7 ) suggests that this is a general feature of dynamic random coefficient models.

An intuition for 1 is as follows. Taking the first difference of (7 ) gives \[Y_{i2}-Y_{i1} = \beta_i (Y_{i1}-Y_{i0}) + \varepsilon_{i2}-\varepsilon_{i1}.\] Since \(\varepsilon_{i2}-\varepsilon_{i1}\) has zero mean conditional on \((\gamma_i,\beta_i,Y_{i0})\), I obtain \[\mathbb{E}(Y_{i2}-Y_{i1}|\gamma_i,\beta_i,Y_{i0}) = \mathbb{E}(\beta_i (Y_{i1}-Y_{i0})|\gamma_i,\beta_i,Y_{i0}),\] which can be rewritten as \[\mathbb{E}(Y_{i2}-Y_{i1} - \beta_i (Y_{i1}-Y_{i0})|\gamma_i,\beta_i,Y_{i0}) = 0. \label{eq46ar146diff}\tag{8}\] Now, consider a function \(k(\gamma_i,\beta_i,Y_{i0},Y_{i1})\) that is orthogonal to \(Y_{i1}-Y_{i0}\) conditional on \((\gamma_i,\beta_i,Y_{i0})\), i.e., \[\mathbb{E}(k(\gamma_i,\beta_i,Y_{i0},Y_{i1})(Y_{i1}-Y_{i0})|\gamma_i,\beta_i,Y_{i0}) = 0.\] For example, in the proof of 1, I choose such a function \(k\) to be \[k(\gamma_i, \beta_i, Y_{i0},Y_{i1}) = 1 - \frac{\mathbb{E}(Y_{i1}-Y_{i0}|\gamma_i, \beta_i, Y_{i0})}{\mathbb{E}((Y_{i1}-Y_{i0})^2|\gamma_i, \beta_i, Y_{i0})}(Y_{i1}-Y_{i0}).\] Then, it follows that (8 ) holds true even if the original random coefficients \((\gamma_i, \beta_i)\) are replaced with the following modified random coefficients: \[\begin{align} \tilde{\gamma}_i &= \gamma_i - Y_{i1}k(\gamma_i,\beta_i,Y_{i0},Y_{i1}), \\ \tilde{\beta}_i &= \beta_i + k(\gamma_i,\beta_i,Y_{i0},Y_{i1}). \end{align}\] To see this, note first that \[\begin{align} &\mathbb{E}(\tilde{\beta}_i (Y_{i1}-Y_{i0})|\gamma_i,\beta_i,Y_{i0}) \\ &= \mathbb{E}(\beta_i (Y_{i1}-Y_{i0})|\gamma_i,\beta_i,Y_{i0}) + \mathbb{E}(k(\gamma_i,\beta_i,Y_{i0},Y_{i1})(Y_{i1}-Y_{i0})|\gamma_i,\beta_i,Y_{i0}) \\ &= \mathbb{E}(\beta_i (Y_{i1}-Y_{i0})|\gamma_i,\beta_i,Y_{i0}) \end{align}\] by the orthogonality property of \(k\). Note also that conditioning on \((\gamma_i, \beta_i, \tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1})\) is equivalent to conditioning on \((\gamma_i, \beta_i, Y_{i0}, Y_{i1})\) since \((\tilde{\gamma}_i, \tilde{\beta}_i)\) is a deterministic function of \((\gamma_i, \beta_i, Y_{i0}, Y_{i1})\). Then, by the law of iterated expectations and by (8 ), it follows that (8 ) holds true for the modified random coefficients \((\tilde{\gamma}_i, \tilde{\beta}_i)\): \[\begin{align} &\mathbb{E}(Y_{i2}-Y_{i1} - \tilde{\beta}_i (Y_{i1}-Y_{i0})|\tilde{\gamma}_i,\tilde{\beta}_i,Y_{i0}) \\ &= \mathbb{E}(\mathbb{E}(Y_{i2}-Y_{i1} - \tilde{\beta}_i (Y_{i1}-Y_{i0})|\tilde{\gamma}_i,\tilde{\beta}_i, \gamma_i, \beta_i, Y_{i0},Y_{i1})|\tilde{\gamma}_i,\tilde{\beta}_i,Y_{i0}) \\ &= \mathbb{E}(\mathbb{E}(Y_{i2}-Y_{i1} - \tilde{\beta}_i (Y_{i1}-Y_{i0})|\gamma_i, \beta_i, Y_{i0},Y_{i1})|\tilde{\gamma}_i,\tilde{\beta}_i,Y_{i0}) \\ &= \mathbb{E}(\mathbb{E}(Y_{i2}-Y_{i1} - \tilde{\beta}_i (Y_{i1}-Y_{i0})|\gamma_i, \beta_i, Y_{i0})|\tilde{\gamma}_i,\tilde{\beta}_i,Y_{i0}) \\ &= \mathbb{E}(\mathbb{E}(Y_{i2}-Y_{i1} - \beta_i (Y_{i1}-Y_{i0})|\gamma_i, \beta_i, Y_{i0})|\tilde{\gamma}_i,\tilde{\beta}_i,Y_{i0}) = \mathbb{E}(0|\tilde{\gamma}_i,\tilde{\beta}_i,Y_{i0}) = 0. \end{align}\] However, if the function \(k\) is chosen such that \(\mathbb{E}(k(\gamma_i,\beta_i,Y_{i0},Y_{i1})) \neq 0\), which is true for the choice of \(k\) above, it follows that \(\mathbb{E}(\tilde{\beta}) \neq \mathbb{E}(\beta)\).

Another intuition for 1 follows from an alternative proof of 1, which uses that \(\mathbb{E}(\beta_i)\) is point-identified if and only if there exists an unbiased estimator of \(\beta_i\) in the individual time series. I state this result as a separate lemma below, which follows as a corollary of the general result in Online Appendix 10.3.

Lemma 1.

Suppose that the assumptions of 1 hold, and that the regularity conditions stated as 13 in Online Appendix 10.3 hold. Then \(\mathbb{E}(\beta_i)\) is point-identified if and only if there exists a function \(S^*(Y_{i0}, Y_{i1}, Y_{i2})\), which is a linear functional on the space of finite and countably additive signed Borel measures that are absolutely continuous with respect to the Lebesgue measure, such that \[\mathbb{E}(S^*(Y_{i0}, Y_{i1}, Y_{i2})|\beta_i) = \beta_i\] almost surely. When such \(S^*\) exists, \(\mathbb{E}(\beta_i)\) is identified by \(\mathbb{E}(\beta_i) = \mathbb{E}(S^*(Y_{i0}, Y_{i1}, Y_{i2}))\).

1 can then be proved by showing that there is no unbiased estimator of \(\beta_i\) (see Online Appendix 10.2). The intuition for 1 is as follows. Since the distribution of \(\beta_i\) is unrestricted, information about individual \(\beta_i\) can only be obtained from its own time series. In a long panel context, a time series estimator of \(\beta_i\) that is consistent as \(T \rightarrow \infty\) would reliably provide such information. In a short panel context, however, such an estimator is not reliable because \(T\) is finite. 1 shows that a time series estimator that is unbiased for finite \(T\) is the only reliable source of information on \(\beta_i\) when it comes to point identification in short panels.

3.2 Partial identification↩︎

A natural question following the last subsection is whether the data are at all informative about \(\mu_e = \mathbb{E}(e'B_i)\), or whether they provide no information. This subsection shows that the data are indeed informative about \(\mu_e\). I show that there exist finite bounds \(L\) and \(U\) such that \[L \leq \mu_e \leq U\] where \(L\) and \(U\) are estimable from the observed data.

To identify \(\mu_e\), I use unconditional moment restrictions that are implications of (2 ). It is known that the set of unconditional moment restrictions of the form \[\mathbb{E}(g(B_i, Z_i, X_i^t)\varepsilon_{it}) = 0, \label{eq46orthogonal}\tag{9}\] indexed by a suitable class of functions \(g\), is equivalent to the conditional moment restriction in (2 ) [34], [35]. I choose the class of \(g\) to be the set of polynomial functions and select a finite subset of these functions. This yields a finite number of unconditional moment restrictions that are fixed in the asymptotics that \(N \rightarrow \infty\). This finite set of unconditional moment restrictions contains less information than the full conditional moment restriction in (2 ), yielding an outer bound rather than the sharp bound, but it leads to estimation and inference procedures that are computationally tractable. In addition, the empirical application in 6 shows that this finite set is sufficiently restrictive to provide informative bounds. Partial identification results based on the full conditional moment restriction in (2 ) are presented in Online Appendix 10.3.

I now study the identification of \(\mu_e\). Recall the dynamic random coefficient model defined in (1 ) and (2 ): \[Y_{it} = R_{it}'B_i + \varepsilon_{it}, \qquad \mathbb{E}(\varepsilon_{it}|B_i, Z_i, X_i^t) = 0, \qquad t=1, \ldots, T,\] where \(R_{it} = (Z_{it}', X_{it}')'\). For brevity of notation, define \[Y_i \equiv \left(\begin{array}{c} Y_{i1} \\ \vdots \\ Y_{iT} \end{array}\right) \quad\text{and}\quad R_i \equiv \left(\begin{array}{c} R_{i1}' \\ \vdots \\ R_{iT}' \end{array}\right)\] as a random vector and a random matrix stacking \(Y_{it}\) and \(R_{it}'\) rowwise across \(t\), respectively. Consider the following assumptions:

Assumption 1. \((Y_i, Z_i, X_i, B_i)\) satisfies (1 ) and (2 ).

Assumption 2. \(R_i'R_i\) is positive definite with probability 1.

1 states that the dynamic random coefficient model is correctly specified. 2 is a no-multicollinearity assumption imposed on the individual time series. This is stronger than the assumption that \(\mathbb{E}(R_i'R_i)\) is positive definite, a common assumption in standard dynamic fixed effect models. A stronger assumption is required because \(B_i\) is individual-specific with an unrestricted distribution, and each \(B_i\) can only be learned from its own individual data4 5.

I now state a theorem showing that \(\mu_e\) is partially identified under [ass.crc,ass.mean.nomulticollinearity]. This theorem is a special case of 2 presented in the next section. For brevity of notation, define \[\widehat{B}_i = (R_i'R_i)^{-1}R_i'Y_i, \quad\text{and}\quad B_0 = \mathbb{E}(R_i'R_i)^{-1}\mathbb{E}(R_i'Y_i).\]

Theorem 1.

Suppose that [ass.crc,ass.mean.nomulticollinearity] hold. Then \(L \leq \mu_e \leq U\) where \[[L, U] = \left[\mathcal{B}_R - \frac{1}{2}\sqrt{\mathcal{E}_R\mathcal{D}_R}, ~~\mathcal{B}_R + \frac{1}{2}\sqrt{\mathcal{E}_R\mathcal{D}_R}\right],\] and \[\begin{align} \mathcal{B}_R &= \frac{1}{2}e'\mathbb{E}(\widehat B_i) + \frac{1}{2}e'B_0, \\ \mathcal{E}_R &= e'\mathbb{E}((R_i'R_i)^{-1})e - e'\mathbb{E}(R_i'R_i)^{-1}e, \\ \mathcal{D}_R &= \mathbb{E}(Y_iR_i(R_i'R_i)^{-1}R_i'Y_i) - \mathbb{E}(Y_iR_i)\mathbb{E}(R_i'R_i)^{-1}\mathbb{E}(R_i'Y_i). \end{align}\] In addition, \(\mathcal{E}_R \geq 0\) and \(\mathcal{D}_R \geq 0\), and each is equal to zero if and only if \((R_i'R_i)^{-1}e\) and \((R_i'R_i)^{-1}R_i'Y_i\) are degenerate across individuals, respectively.

Note that \(\widehat B_i\) is the individual-specific OLS estimator of \(B_i\) from its individual time series, \(B_0\) is the pooled OLS estimator obtained by considering \(B_i\) as constant across individuals, and \(R_i'R_i\) is the squared design matrix of the individual time series.

The closed-form expressions in 1 provide intuition on when \(L\) and \(U\) are finite. In particular, \(L\) and \(U\) are finite even if \((Y_i, R_i, B_i)\) are unbounded, as long as the moments involved in the expression for \([L,U]\) are finite — that is, \(\mathbb{E}(R_i'R_i)\), \(\mathbb{E}((R_i'R_i)^{-1})\), \(\mathbb{E}(R_i'Y_i)\), \(\mathbb{E}((R_i'R_i)^{-1}R_i'Y_i)\), and \(\mathbb{E}(Y_iR_i(R_i'R_i)^{-1}R_i'Y_i)\) are finite.

The general result in 2 presented in the next section provides insights on what type of information is used to construct the bounds in 1. It can be shown that, under the additional regularity conditions stated as 8 in the next section, the bounds in 1 are the sharp bounds of \(\mu_e\) when the conditional moment restriction (2 ) is replaced by the following unconditional moment restrictions: \[\mathbb{E}\left(\sum_{t=1}^T (R_{it}'B_i)\varepsilon_{it}\right) = 0, \quad\text{and}\quad\mathbb{E}\left(\sum_{t=1}^T R_{it}\varepsilon_{it}\right) = 0, \label{eq46orthogonal46closedform}\tag{10}\] where the first restriction is interpreted as that the “error term” (\(\varepsilon_{it}\)) is orthogonal to the “explained term” (\(R_{it}'B_i\)), and the second is interpreted as that \(\varepsilon_{it}\) is orthogonal to the current-period regressors \(R_{it}\), on average across \(t\). For empirical applications, the amount of information contained in (10 ) is small relative to that in (2 ), and its refinement will be discussed later in this subsection. From a theoretical perspective, 1 suggests that the two moment conditions in (10 ) are the key identifying restrictions that yield finite \(L\) and \(U\), out of the infinite number of unconditional moment restrictions in (9 ) that is equivalent to (2 ).

I now explain the intuition behind 1, focusing on the upper bound \(U\). Consider a Lagrangian where the objective function is the parameter of interest \(e'B_i\) and the constraints are the moment functions in (10 ): \[Q(\lambda, \mu, W_i, B_i) = e'B_i + \lambda \sum_{t=1}^T (R_{it}'B_i)\varepsilon_{it} + \mu' \sum_{t=1}^TR_{it}\varepsilon_{it},\] where \(\lambda \in \mathbb{R}\) and \(\mu\) has the same dimension as \(R_{it}\). Note that \(\mathbb{E}(Q) = \mathbb{E}(e'B_i) = \mu_e\) because the constraints have zero expectations by (10 ).

If I substitute \(\varepsilon_{it} = Y_{it} - R_{it}'B_i\) into \(Q\) and use the matrix notations \(R_i\) and \(Y_i\), I obtain the expression: \[Q(\lambda, \mu, W_i, B_i) = e'B_i + \lambda Y_i'R_iB_i - \lambda B_i'(R_i'R_i)B_i + \mu'R_i'Y_i - \mu'R_i'R_iB_i.\] This is a quadratic polynomial in \(B_i\) whose second-order derivative is \[\frac{d^2Q}{dB_idB_i'} = - 2\lambda (R_i'R_i).\] If \(\lambda>0\), then this second-order derivative is a negative definite matrix, in which case \(Q\) attains a global maximum at the solution to the first-order condition \(dQ/dB_i = 0\). Let \(P = \max_{b \in \mathbb{R}^{q+p}}Q(\lambda, \mu, W_i, b)\) be the resulting maximum, which is only a function of \((\lambda, \mu, W_i)\) since \(B_i\) is “maximized out.” Then, by construction: \[P(\lambda, \mu, W_i) = \max_{b \in \mathbb{R}^{q+p}}Q(\lambda, \mu, W_i, b) \geq Q(\lambda, \mu, W_i, B_i),\] which implies \[\mathbb{E}(P(\lambda, \mu, W_i)) \geq \mathbb{E}(Q(\lambda, \mu, W_i, B_i)) = \mu_e.\] This shows that \(\mathbb{E}(P)\) is an upper bound of \(\mu_e\) for any choice of \(\lambda > 0\) and \(\mu\). I then obtain a smallest upper bound for \(\mu_e\) by minimizing \(\mathbb{E}(P)\) with respect to \(\lambda > 0\) and \(\mu\): \[\min_{\lambda > 0, ~ \mu}\mathbb{E}(P(\lambda, \mu, W_i)) \geq \mu_e.\] This coincides with \(U\) in 1. The lower bound can be obtained by repeating the same process with \(\lambda < 0\).

As discussed earlier, the amount of information used to construct the bounds in 1, namely the moment restrictions in (10 ), is small relative to that in (2 ). I now develop a refinement of 1.

For each \(t\), choose a vector of observable random variables \(S_{it}\) such that \(\mathbb{E}(S_{it}\varepsilon_{it}) = 0\) under (2 ). For example, one may choose \(S_{it}\) to be \(S_{it} = R_{it}\) (the vector of current regressors) or \(S_{it} = (Z_i', {X_i^t}')'\) (the vector of the full history of \(Z_{it}\) and the current history of \(X_{it}\)). One may also choose \(S_{it}\) to include the square terms such as \(X_{it}^2\) and \(Z_{it}^2\). The dimension of \(S_{it}\) is allowed to vary across \(t\). Consider the following assumption:

Assumption 3. For every nonzero vector \(a = (a_1', \ldots, a_T')'\), \(\mathbb{P}(\sum_{t=1}^T R_{it} S_{it}' a_t \neq 0) > 0\).

Recall that one chooses \(S_{it}\). Assumption 3 is a regularity condition requiring that each entry of \(\mathbb{E}(S_{it}\varepsilon_{it}) = 0\), for \(t = 1, \ldots, T\), contains distinct information. It is implied by 2 if \(S_{it} = R_{it}\) and \(R_{it}\) consists of an intercept and a continuous regressor. 3 is trivially violated if \(S_{it}\) includes duplicate variables, for example, if \(S_{it} = (X_{it}', X_{it}', Z_{it}')'\). However, it is not necessarily violated if \(S_{it}\) and \(S_{iv}\) for \(t \neq v\) have duplicate variables. In the empirical application, I estimate the model with \(R_{it} = (1, Y_{i,t-1})'\) using \(S_{it} = (1, Y_{i,t-1}, \ldots, Y_{i,\max\{0,t-5\}})'\). If Assumption 3 fails to hold for a particular vector \(a\), its nonzero entries indicate which entry of \(S_{it}\) is redundant, and one can drop the corresponding entry.

I now state a refinement of 1 under [ass.crc,ass.mean.nomulticollinearity,ass.mean.nomulticollinearity.s]. For brevity of notation, define a block diagonal matrix \[S_i \equiv \left(\begin{array}{cccc} S_{i1} & 0 & \cdots & 0 \\ 0 & S_{i2} & \cdots & 0 \\ \vdots & \vdots & & \vdots \\ 0 & 0 & \cdots & S_{iT} \end{array}\right)\] where \(S_{it}\) appears in the diagonal as a column vector, so that \(S_i\) has \(T\) columns. In addition, define \[\begin{align} \mathcal{V}_S &= \mathbb{E}(S_iR_i(R_i'R_i)^{-1}R_i'S_i'), \\ \mathcal{Y}_S &= \mathbb{E}(S_iR_i(R_i'R_i)^{-1}R_i'Y_i), \\ \mathcal{P}_S &= \mathbb{E}(S_iR_i(R_i'R_i)^{-1}), \\ Y_S &= \mathbb{E}(S_iY_i), \\ m_0 &= \mathbb{E}(Y_i'R_i(R_i'R_i)^{-1}R_i'Y_i). \end{align}\]

Proposition 2. Suppose that [ass.crc,ass.mean.nomulticollinearity,ass.mean.nomulticollinearity.s] hold. Then \(\mathcal{V}_S\) is invertible, and \(L_S \leq \mu_e \leq U_S\) where \[[L_S, U_S] = \left[\mathcal{B}_S - \frac{1}{2}\sqrt{\mathcal{E}_S\mathcal{D}_S}, ~~\mathcal{B}_S + \frac{1}{2}\sqrt{\mathcal{E}_S\mathcal{D}_S}\right]\] and \[\begin{align} \mathcal{B}_S &= \frac{1}{2}e'\mathbb{E}(\widehat{B}_i) + \frac{1}{2}e'\mathcal{P}_S'\mathcal{V}_S^{-1}(2Y_S - \mathcal{Y}_S), \\ \mathcal{E}_S &= e'\mathbb{E}((R_i'R_i)^{-1})e-e'\mathcal{P}_S'\mathcal{V}_S^{-1}\mathcal{P}_Se, \\ \mathcal{D}_S &= m_0-(2Y_S-\mathcal{Y}_S)'\mathcal{V}_S^{-1}(2Y_S-\mathcal{Y}_S). \end{align}\]

Similarly to 1, under the additional regularity conditions stated as 8 in the next section, it can be shown that the bounds in 2 are the sharp bounds of \(\mu_e\) if (2 ) is replaced by the following unconditional moments: \[\mathbb{E}\left(\sum_{t=1}^T (R_{it}'B_i)\varepsilon_{it}\right) = 0, \quad\text{and}\quad\mathbb{E}\left(S_{it}\varepsilon_{it}\right) = 0 \quad\text{for}\quad t=1, \ldots, T, \label{eq46orthogonal46closedform46refined}\tag{11}\] where the first expression gives one unconditional moment restriction, and the second expression gives \(\text{dim}(S_{it})\) unconditional moment restrictions for each \(t\).

While (11 ) still contains less information than (2 ), it is found to be sufficiently informative in practice. The empirical application in 6 shows that 2 can produce informative bounds. In addition, the closed-form expressions in 2 lead to a simple estimation and inference procedure that is robust to overidentification and model misspecification, which are generally not simple to deal with in partially identified models.

3.3 Extension to models with homogeneous coefficients↩︎

In this subsection, I extend the partial identification results of the previous subsection to the model that also involves homogeneous coefficients. Recall the model introduced in (5 ) and (6 ): \[Y_{it} = R_{it}'B_i + M_{it}'\delta + \varepsilon_{it}, \qquad \mathbb{E}(\varepsilon_{it}|B_i, Z_i, X_i^t, Z_i^{homo}, (X_i^{homo})^t) = 0, \qquad t=1, \ldots, T,\] where \(M_{it} = ({Z_{it}^{homo}}', {X_{it}^{homo}}')'\) denotes the regressors with homogeneous coefficients. Let \(U_{it} = (R_{it}', M_{it}')'\) be the vector of all regressors, and let \(M_i\) and \(U_i\) be random matrices stacking \(M_{it}'\) and \(U_{it}'\) rowwise across \(t\), hence having \(T\) rows, respectively.

Similarly to the last subsection, choose a vector of observable random variables \(S_{it}\) such that \(\mathbb{E}(S_{it}\varepsilon_{it}) = 0\) under (6 ). Consider the following modifications to [ass.crc,ass.mean.nomulticollinearity] and the restatement of 3.

Assumption 4. \((Y_i, R_i, M_i, B_i)\) and \(\delta\) satisfy (5 ) and (6 ).

Assumption 5. \(R_i'R_i\) is positive definite with probability 1. In addition, for every nonzero vector \(a \in \mathbb{R}^{q_m+p_m}\), \(\mathbb{P}(M_ia \notin \text{col}(R_i)) > 0\).

Assumption 6. For every nonzero vector \(a = (a_1', \ldots, a_T')'\), \(\mathbb{P}(\sum_{t=1}^T R_{it} S_{it}' a_t \neq 0) > 0\).

5 requires that, for every nonzero linear combination of \(M_i\), it is not multicollinear with \(R_i\) with positive probability, that is, at least for some individuals. Note that a necessary condition for 5 is that \(\mathbb{E}(M_i'M_i)\) is positive definite, rather than \(M_i'M_i\) itself. Therefore, the no-multicollinearity requirement for \(M_{it}\) is the same as those for the regressors in standard fixed effect models.

Under these assumptions, the following proposition extends the bounds in 2 to the model defined in (5 ) and (6 ). For brevity of notation, define \[\begin{align} \mathcal{V}_M &= \mathbb{E}(M_i'R_i(R_i'R_i)^{-1}R_i'M_i), & \mathcal{C} &= \mathbb{E}(S_iR_i(R_i'R_i)^{-1}R_i'M_i), \\ \mathcal{Y}_M &= \mathbb{E}(M_i'R_i(R_i'R_i)^{-1}R_i'Y_i), & C &= \mathbb{E}(S_iM_i), \\ \mathcal{P}_M &= \mathbb{E}(M_i'R_i(R_i'R_i)^{-1}), & M_0 &= \mathbb{E}(M_i'M_i).\\ Y_M &= \mathbb{E}(M_i'Y_i), \\ \end{align}\]

Proposition 3. Suppose that [ass.crc.constant,ass.mean.nomulticollinearity.constant,ass.mean.nomulticollinearity.s.constant] hold. Then both the matrix \(\mathcal{V}_M-M_0\) and the matrix \[\mathcal{V} = \mathcal{V}_S - (C - \mathcal{C})(\mathcal{V}_M-M_0)^{-1}(C - \mathcal{C})'\] are invertible, and \(L_M \leq \mu_e \leq U_M\) where \[[L_M, U_M] = \left[\mathcal{B}_M - \frac{1}{2}\sqrt{\mathcal{E}_M\mathcal{D}_M}, ~~\mathcal{B}_M + \frac{1}{2}\sqrt{\mathcal{E}_M\mathcal{D}_M}\right]\] and \[\begin{align} \mathcal{B}_M &= \frac{1}{2}e'\mathbb{E}(\widehat{B}_i) + \frac{1}{2}e'\mathcal{P}_M'(\mathcal{V}_M-M_0)^{-1}(Y_M - \mathcal{Y}_M) + \\ &\frac{1}{2}(\mathcal{P}_Se + (C - \mathcal{C})(\mathcal{V}_M-M_0)^{-1}\mathcal{P}_Me)'\mathcal{V}^{-1} (2Y_S - \mathcal{Y}_S + (C - \mathcal{C})(\mathcal{V}_M-M_0)^{-1}(Y_M - \mathcal{Y}_M)), \\ \mathcal{E}_M &= e'\mathbb{E}((R_i'R_i)^{-1})e - e'\mathcal{P}_M'(\mathcal{V}_M-M_0)^{-1}\mathcal{P}_Me - \\ &(\mathcal{P}_Se + (C - \mathcal{C})(\mathcal{V}_M-M_0)^{-1}\mathcal{P}_Me)'\mathcal{V}^{-1}(\mathcal{P}_Se + (C - \mathcal{C})(\mathcal{V}_M-M_0)^{-1}\mathcal{P}_Me), \\ \mathcal{D}_M &= m_0 - (Y_M - \mathcal{Y}_M)'(\mathcal{V}_M-M_0)^{-1}(Y_M - \mathcal{Y}_M) - \\ (2Y_S &- \mathcal{Y}_S + (C - \mathcal{C})(\mathcal{V}_M-M_0)^{-1}(Y_M - \mathcal{Y}_M))'\mathcal{V}^{-1} (2Y_S - \mathcal{Y}_S + (C - \mathcal{C})(\mathcal{V}_M-M_0)^{-1}(Y_M - \mathcal{Y}_M)). \end{align}\]

The empirical application in 6 shows that 3 can produce highly informative bounds. The empirical application involves a total of 59 regressors in \(M_{it}\) (and 58 in an alternative specification), demonstrating the practicality of 3 even when the number of regressors with homogeneous coefficients is large.

3.4 Numerical illustration↩︎

This subsection provides a numerical illustration of the sizes of the identified sets presented in the previous sections in a simple panel data model. This highlights the practical implications of considering unconditional moment restrictions instead of the conditional ones. Specifically, consider the model \[Y_{it} = \gamma_i + \beta_i X_{it} + \varepsilon_{it}, \qquad t=1, \ldots, T,\] where \[\mathbb{E}(\varepsilon_{it}|\gamma_i, \beta_i, X_i^{t}) = 0, \qquad t=1, \ldots, T. \label{eq46illustration46meanindep}\tag{12}\] For this model, I numerically compute the sharp identified set of \(\mathbb{E}(\beta_i)\) under the conditional moment restriction in (12 ), and compare it to the outer identified set in 2, which are based on the unconditional moment restrictions in (11 ). Computation of the sharp identified set of \(\mathbb{E}(\beta_i)\) is generally prohibitively expensive (see the discussion in 4), but it becomes relatively tractable when \((\gamma_i, \beta_i, X_i)\) has a small number of discrete support points, where the sharp characterization reduces to solving optimization problems over a large but finite-dimensional Euclidean spaces.

Let \(\gamma_i\) and \(\beta_i\) be independent discrete random variables such that \(\gamma_i \in \{-1, 0, 1\}\) with equal probabilities and \(\beta_i \in \{0, 0.5, 1\}\) with equal probabilities. In addition, let \(\varepsilon_{it}\) be independent of \((\gamma_i, \beta_i)\) and \(\varepsilon_{it} \in \{-1, 0, 1\}\) with equal probabilities. Lastly, let \(X_{i1} = 1\), and define for \(t \geq 2\): \[\begin{align} X_{it} = \left\{\begin{array}{ll} -1 & \text{ if } Y_{i,t-1} < -1, \\ 0 & \text{ if } -1 \leq Y_{i,t-1} < 1, \\ 1 & \text{ if } Y_{i,t-1} \geq 1, \\ \end{array}\right. \end{align}\] so that \(X_{it}\) depends on \(Y_{i,t-1}\).

Under this data generating process, I compute both the sharp and the outer bounds of \(\mathbb{E}(\beta_i)\) for \(T \in \{3, 4, 5\}\). I also calculate the outer bounds for \(T \in \{6, 8\}\) to illustrate how the outer bound tightens as \(T\) increases. I choose \(S_{it} = (1, X_{i1}, \ldots, X_{it})'\) to compute the outer bounds in 2. The calculated sharp and outer bounds are presented in 1. Although the outer bounds are wider than the sharp bounds, I will show in 6 that the outer bounds remain sufficiently informative in empirical applications.

Table 1: Numerical illustration of the sharp and the outer identified sets. Sharp refers to the sharp identified set of \(\mathbb{E}(\beta_i)\) under (12 ), and Outer refers to the outer bounds of \(\mathbb{E}(\beta_i)\) under (11 ). The sharp identified sets for \(T=6\) and \(T=8\) are not computed because they are computationally prohibitive. Note that the data generating process implies \(\mathbb{E}(\beta_i) = 0.5\).
\(T=3\) \(T=4\) \(T=5\) \(T=6\) \(T=8\)
Sharp [0.401, 0.593] [0.452, 0.552] [0.473, 0.532] - -
Outer [0.216, 0.617] [0.267, 0.613] [0.306, 0.613] [0.330, 0.613] [0.368, 0.598]

4 Identification of the general parameters↩︎

This section presents a general partial identification result for dynamic random coefficient models. This section is structured into two subsections. First, I present a general partial identification result for a generic parameter. Second, I apply this general result to derive the bounds for the variance and the CDF of the random coefficient distribution.

4.1 Identification of the general parameters↩︎

Recall that \(W_i \in \mathcal{W}\) is the vector of observable variables and \(B_i \in \mathcal{B}\) is the vector of unobservable random coefficients. I consider parameters of the form \[\theta = \mathbb{E}(m(W_i, B_i))\] where the function \(m:\mathcal{W} \times \mathcal{B} \mapsto \mathbb{R}\) is known. I consider a generic set of unconditional moment restrictions:

Assumption 7. The random vectors \((W_i, B_i)\) satisfy: \[\begin{align} \mathbb{E}(\phi_k(W_i, B_i)) &= 0, \quad k=1, \ldots, K, \end{align}\] where \(\phi_k:\mathcal{W} \times \mathcal{B} \mapsto \mathbb{R}\) are known moment functions and \(K \in \mathbb{N}\) is the number of moment restrictions.

Note that, in the asymptotics, \(K\) is fixed when \(N \rightarrow \infty\). Note also that \(\varepsilon_{it}\) does not appear in 7 because \((W_i, B_i)\) summarizes \(\varepsilon_{it}\) by the relationship \(\varepsilon_{it} = Y_{it} - R_{it}'B_i\). More generally, without connection to random coefficient models, 7 imposes generic unconditional moment restrictions that involve both observed and unobserved random vectors. A more general formulation that also involves conditional moment restrictions is studied in Online Appendix 10.3.

I characterize the sharp identified set of \(\theta\) under 7 and the regularity conditions that are introduced below. To do so, I first recast the identification problem as a linear programming problem. I then show that its dual representation yields a tractable characterization of the identified set.

Let \(P \in \mathcal{M}_{W \times B}\), where \(\mathcal{M}_{W \times B}\) is the linear space of finite and countably additive signed Borel measures on \(\mathcal{W} \times \mathcal{B}\), equipped with the total variation norm. Let \(P_W \in \mathcal{M}_{W}\) be the observed marginal distribution of \(W_i\). The sharp identified set \(I\) of \(\theta\) is defined by: \[\begin{align} I \equiv \left\{ \int m(w, b) dP ~\right|~ P \in \mathcal{M}_{W \times B}, \quad P \geq 0, \quad & \int dP = 1, \\ & \int \phi_k(w, b) dP = 0, \quad k=1, \ldots, K, \\ & \left. \int P(w, db) = P_W(w) ~\text{ for all } w \in \mathcal{W} \right\}. \end{align}\] The set \(I\) is the collection of all \(\int m(W_i, B_i) dP\) values over \(P\) such that (i) \(P\) is a probability distribution of \((W_i, B_i)\), (ii) \(P\) satisfies the moment restrictions, and (iii) the marginal distribution of \(W_i\) implied from \(P\) equals the observed distribution \(P_W\). Dependence of \(I\) on \(m\), \(P_W\), and the \(\phi_k\)s are suppressed in the notation.

All defining properties of \(I\) are linear in \(P\), which means that \(I\) is a convex set in \(\mathbb{R}\) (i.e., an interval). Therefore, \(I\) can be characterized by its lower and upper bounds. The sharp lower bound \(L\) of \(I\) is defined by: \[\begin{align} \min_{P \in \mathcal{M}_{W \times B}, ~P \geq 0} \int m(w, b) dP \qquad\text{subject to}\qquad & \int \phi_k(w, b) dP = 0, \quad k=1, \ldots, K, \\ & \int P(w, db) = P_W(w) ~\text{ for all } w \in \mathcal{W}. \end{align} \label{eq46primal}\tag{13}\] Note that the constraint \(\int dP = 1\) is omitted in (13 ), because it is implied by the constraint \(\int P(w, db) = P_W(w)\) where \(P_W\) is a probability distribution.

Equation (13 ) is a linear program in \(P\), with the caveat that \(P\) is an infinite-dimensional object. It is not a tractable characterization of \(L\) for dynamic random coefficient models, in the sense that the estimation methods it imply are computationally infeasible. For example, discretizing the space of \((W_i, B_i)\) and solving the discretized problem [9], [36] is computationally infeasible because the dimension of \((W_i, B_i)\) is large. Recall that \(W_i\) contains the full history of regressors and dependent variables and \(B_i\) contains all random coefficients. For the random coefficient model with \(R\) regressors and \(T\) waves, \(P\) is a distribution on an \((RT+T+R)\)-dimensional space.

My approach is to use the dual representation of (13 ) obtained by the duality theorem for infinite-dimensional linear programming [13], [14]. I consider the following regularity conditions:

Assumption 8. The following conditions hold.

  • \(\mathcal{W} \times \mathcal{B}\) is a compact set in a Euclidean space.

  • \((m, \phi_1, \ldots, \phi_K)\) are bounded Borel measurable functions on \(\mathcal{W} \times \mathcal{B}\).

Under these conditions, the following theorem characterizes the sharp identified set of \(\theta\) using the dual representation of (13 ) and the corresponding problem for the upper bound.

Theorem 2. Suppose [ass.gmm,ass.proof.regularity] hold. Let \(\lambda = (\lambda_1, \ldots, \lambda_K)' \in \mathbb{R}^K\). Then \(I = [L, U]\) where \[L = \max_{\lambda \in \mathbb{R}^K} \mathbb{E}\left[ \min_{b \in \mathcal{B}} \left\{ m(W_i, b) + \sum_{k=1}^{K}\lambda_k \phi_k(W_i, b) \right\} \right] \label{eq46lb}\tag{14}\] and \[U = \min_{\lambda \in \mathbb{R}^K} \mathbb{E}\left[ \max_{b \in \mathcal{B}} \left\{ m(W_i, b) + \sum_{k=1}^{K}\lambda_k \phi_k(W_i, b) \right\} \right] \label{eq46ub}\tag{15}\] provided that the optimization problems in (14 ) and (15 ) possess finite solutions.

Note that the result in 2 is not specific to dynamic random coefficient models. It is a general duality result for moment equality models where the moment functions involve both observables and unobservables [14], [37].

The characterization that also involves conditional moment restrictions is developed in Online Appendix 10.3. To illustrate, consider the following conditional moment restrictions:\[\mathbb{E}(\psi_k(W_i, B_i)|\mathsf{W}_{ik}, \mathsf{B}_{ik}) = 0, \qquad k=1, \ldots, K,\] where \(\mathsf{W}_{ik}\) and \(\mathsf{B}_{ik}\) are subvectors of \(W_i\) and \(B_i\). Note that (2 ) has \(T\) moment restrictions of this type, one for each \(t=1, \ldots, T\). Assume that \(W_i\) and \(B_i\) are absolutely continuous with respect to the Lebesgue measure, and that the regularity conditions stated as 13 (i)-(iii) in Online Appendix 10.3 hold. Then, under these assumptions, 3 in Online Appendix 10.3 implies that the sharp lower bound of \(\theta\) is given by \[L = \max_{\{\mu_k(\textsf{w}_k,\textsf{b}_k) \in L^2(\mathsf{W}_{ik}, \mathsf{B}_{ik})\}_{k=1}^K} \mathbb{E}\left[ \min_{b \in \mathcal{B}} \left\{ m(W_i, b) + \sum_{k=1}^K \mu_k(\mathsf{W}_{ik}, \textsf{b}_k) \psi_k(W_i, b) \right\} \right], \label{eq46lb46conditional}\tag{16}\] where \(\textsf{b}_k\) is the subvector of \(b\) corresponding to \(\textsf{B}_{ik}\) and \(\mu_k(\textsf{w}_k,\textsf{b}_k)\) is a square integrable function of \((\mathsf{W}_{ik}, \mathsf{B}_{ik})\), denoted by \(L^2(\mathsf{W}_{ik}, \mathsf{B}_{ik})\). Therefore, for conditional moment restrictions, the dual representation involves optimization over the functional choice variables \(\{\mu_k(\textsf{w}_k,\textsf{b}_k)\}_{k=1}^K\). In general, such functional optimization is not computationally tractable because the inner optimization problem over \(b\) is potentially highly nonconvex and \((W_i,B_i)\) is potentially high-dimensional. For the random coefficient model with \(R\) regressors and \(T\) waves, each \(\mu_k\) is a function on a space of dimension at most \((RT+R)\), and one must optimize over \(K\) such functions in (16 ). In contrast, (14 ) involves optimization over the finite-dimensional Euclidean space \(\mathbb{R}^K\). In the previous subsection, I used a parsimonious set of moment restrictions in (11 ) to derive closed-form bounds for the mean parameters that are computationally efficient. In the next subsection, using the same parsimonious set, I derive computationally efficient bounds of the variance and the CDF parameters. While these bounds are the outer bounds relative to the sharp bounds in (16 ), I demonstrate in the empirical application in 6 that they produce informative bounds in practice.

The condition that (14 ) and (15 ) possess finite solutions is mild due to the following key property. Define the value functions of the inner optimization problems in (14 ) and (15 ) as \(G_L\) and \(G_U\), respectively: \[\begin{align} G_L(\lambda, w) &= \min_{b \in \mathcal{B}} \left\{ m(w, b) + \sum_{k=1}^{K}\lambda_k \phi_k(w, b) \right\}, \\ G_U(\lambda, w) &= \max_{b \in \mathcal{B}} \left\{ m(w, b) + \sum_{k=1}^{K}\lambda_k \phi_k(w, b) \right\}. \end{align}\] Note that, given the model ingredients \(m\) and \(\phi_1, \ldots, \phi_K\), these are deterministic functions of \((\lambda,w)\). They have the following key property.

Proposition 4. \(G_L(\lambda, w)\) is globally concave in \(\lambda\) for every \(w\), and \(G_U(\lambda, w)\) is globally convex in \(\lambda\) for every \(w\).

Since concave and convex functions on \(\mathbb{R}^K\) are continuous, (14 ) and (15 ) possess finite solutions whenever the optimizers in \(\lambda\) lie in the interior of \(\mathbb{R}^K\). For dynamic random coefficient models in (1 ) and (2 ), this can be achieved by a suitable choice of the moment functions \((\phi_1, \ldots, \phi_K)\) derived from (2 ), which I illustrate in the next subsection for the variance and the CDF parameters.

Using the definitions of \(G_L\) and \(G_U\), the bounds in 2 can be written as \[L = \max_{\lambda \in \mathbb{R}^K} \mathbb{E}\left[ G_L(\lambda, W_i) \right], \quad\text{and}\quad U = \min_{\lambda \in \mathbb{R}^K} \mathbb{E}\left[ G_U(\lambda, W_i) \right].\] Under suitable conditions, \(G_L\) and \(G_U\) are differentiable when \(K=1\) [38], which can be extended to show that \(G_L\) and \(G_U\) are directionally differentiable for \(K > 1\). 4 then implies that the optimization problems over \(\lambda\) can be solved using fast convex optimization algorithms such as gradient descent, provided that the inner optimization problems over \(b\) can be solved efficiently. In the next subsection, I illustrate the choice of the moment functions for the variance and the CDF parameters that admits computationally efficient solutions to the inner optimization problems.

A direct consequence of 2 is that \(\theta\) is point-identified if and only if \(L = U\). Proof of 2 then implies a necessary and sufficient condition for point identification of \(\theta\), which I state as a separate lemma below.

Lemma 2. Suppose that the assumptions of 2 hold. Suppose also that \((W_i, B_i)\) are absolutely continuous with respect to the Lebesgue measure, and that their joint density is strictly positive on \(\mathcal{W} \times \mathcal{B}\). Then \(\theta\) is point-identified if and only if there exists a function \(S^*\), which is a linear functional on \(\mathcal{M}_{W}\), and real numbers \(\lambda_1^*, \ldots, \lambda_{K}^* \in \mathbb{R}\) such that: \[m(W_i, B_i) + \sum_{k=1}^{K}\lambda_k^* \phi_k(W_i, B_i) = S^*(W_i)\] almost surely on \(\mathcal{W} \times \mathcal{B}\). When such \(S^*\) exists, \(\theta\) is identified by \(\theta = \mathbb{E}(S^*(W_i))\).

2 states that \(\theta\) is point-identified if and only if the Lagrangian reduces to a function of data only. Note that \(S^*\) can be considered as an unbiased estimator because the term \(\sum_{k=1}^{K}\lambda_k^* \phi_k(W_i, B_i)\) has zero expectation6.

Lastly, I highlight the connection between 2 and the support function approach of [40]. Let \(\delta\) be a structural parameter and consider the moment conditions \[\mathbb{E}(\phi_k(W_i, B_i, \delta)) = 0, \quad k=1, \ldots, K.\] In what follows, I fix the value of \(\delta\) and consider each \(\phi_k(\cdot,\cdot,\delta)\) as a function of \((W_i, B_i)\) only. In addition, I set \(m(W_i, B_i) = 0\), so that \(\theta = \mathbb{E}(m(W_i, B_i)) = 0\). In this case, the sharp lower bound of \(\theta = 0\) is obtained by specializing (13 ) with \(m = 0\): \[\begin{align} L_{primal}(\delta) = \min_{P \in \mathcal{M}_{W \times B}, ~P \geq 0} 0 \qquad\text{subject to}\qquad & \int \phi_k(w, b, \delta) dP = 0, \quad k=1, \ldots, K, \\ & \int P(w, db) = P_W(w) ~\text{ for all } w \in \mathcal{W}. \end{align}\] The solution of this problem is trivially \(0\), but only if there exists a probability distribution \(P\) that satisfies the moment conditions. If no such \(P\) exists, the problem is infeasible, and I set \(L_{primal}(\delta) = \infty\). This characterization is similar in spirit to those in [9], [10] and [41], extended here to allow \(P\) to be a continuous distribution. I can then write the identified set of \(\delta\) as \[\{\delta ~|~ L_{primal}(\delta) = 0\}.\] 2 then implies that the dual representation of \(L_{primal}(\delta)\) is \[L_{dual}(\delta) = \max_{\lambda \in \mathbb{R}^K} \mathbb{E}\left[ \min_{b \in \mathcal{B}} \left\{ \sum_{k=1}^{K}\lambda_k \phi_k(W_i, b, \delta) \right\} \right]. \label{eq46lb46support}\tag{17}\] Using this, the identified set of \(\delta\) can also be written as \(\{\delta ~|~ L_{dual}(\delta) = 0\}\). This characterization coincides with the support function characterization in [40] given for regression coefficients with interval data. In particular, in their Theorem 4.1, the negative of their support function coincides with the inner objective function \(\sum_{k=1}^{K}\lambda_k \phi_k(W_i, b, \delta)\) in (17 ), and their variable \(u\) coincides with the Lagrange multiplier \(\lambda\) in (17 ).

4.2 Examples: the variance and the CDF of random coefficients↩︎

In this subsection, I apply 2 to derive the bounds for the variance and the CDF parameters. Recall the dynamic random coefficient model defined in (1 ) and (2 ): \[Y_{it} = R_{it}'B_i + \varepsilon_{it}, \qquad \mathbb{E}(\varepsilon_{it}|B_i, Z_i, X_i^t) = 0, \qquad t=1, \ldots, T,\] where \(R_{it} = (Z_{it}', X_{it}')'\). I first consider the second moments of the random coefficients: \[V_e = \mathbb{E}(e_1'B_iB_i'e_2) = \mathbb{E}(B_i'e_1e_2'B_i),\] where \(e_1\) and \(e_2\) are real-valued constant vectors chosen by the econometrician. A full characterization of the bounds of \(V_e\) for generic choices of \(e_1\) and \(e_2\) is discussed in Online Appendix 10.4. Here, I focus on the special case where \(e_1 = e_2\) and this common vector has a single entry equal to \(1\) and zeros elsewhere. In this case, \(V_e\) is the second moment of a particular coefficient — a key ingredient of the variance parameter. This particular case deserves separate discussion because its bounds can be computed more efficiently than those in the general case.

In the case where \(e_1 = e_2\) and this common vector has a single entry equal to \(1\) and zeros elsewhere, define \(e_0 = e_1e_1'\). Then \(e_0\) is a diagonal matrix which has \(1\) in only one entry and zeros elsewhere. For example, if \(B_i = (\beta_{i1}, \beta_{i2})'\) and \(e_1 = e_2 = (0,1)'\), then \[e_0 = \left(\begin{array}{cc} 0 & 0 \\ 0 & 1 \end{array}\right), \quad\text{and}\quad V_e = \mathbb{E}(B_i'e_0B_i) = \mathbb{E}(\beta_{i2}^2).\] Recall the moment restrictions used for the bounds in 2, namely those in (11 ): \[\mathbb{E}\left(\sum_{t=1}^T (R_{it}'B_i)\varepsilon_{it}\right) = 0, \quad\text{and}\quad\mathbb{E}\left(S_{it}\varepsilon_{it}\right) = 0 \quad\text{for}\quad t=1, \ldots, T.\] Let \(L = \sum_{t=1}^T \text{dim}(S_{it})\). Applying 2 with these restrictions yields the following lower bound for \(V_e\), denoted by \(L_V\): \[\begin{align} L_V &= \max_{\lambda \in \mathbb{R}, ~\mu \in \mathbb{R}^L} \mathbb{E}\left[ \min_{b \in \mathcal{B}} \left\{ b'e_0b + \lambda b'R_i'(Y_i-R_ib) + \mu'S_i(Y_i - R_ib) \right\} \right] \\ &= \max_{\lambda \in \mathbb{R}, ~\mu \in \mathbb{R}^L} \mathbb{E}\left[ \min_{b \in \mathcal{B}} \left\{ \mu'S_iY_i + (\lambda R_i'Y_i - R_i'S_i'\mu)'b - b'(\lambda R_i'R_i - e_0)b \right\} \right], \\ \end{align}\]

Suppose that [ass.crc,ass.mean.nomulticollinearity,ass.mean.nomulticollinearity.s] hold. Note that, in \(L_V\), the objective function of the inner minimization problem is a quadratic polynomial in \(b\), where the leading coefficient matrix is \(-(\lambda R_i'R_i - e_0) = e_0 - \lambda R_i'R_i\). Since \(e_0\) is positive semidefinite, and since \(R_i'R_i\) is positive definite by 2, a finite lower bound is obtained only when \(\lambda < 0\). I then obtain the following expression for the lower bound, which is a direct application of 2 and is stated without proof.

Proposition 5. Suppose that [ass.crc,ass.mean.nomulticollinearity,ass.mean.nomulticollinearity.s,ass.proof.regularity] hold. Then \(L_V \leq V_e\) where \[\begin{align} L_V &= \max_{\lambda <0, ~\mu \in \mathbb{R}^L} \mathbb{E}\left[ \min_{b \in \mathcal{B}} \left\{ \mu'S_iY_i + (\lambda R_i'Y_i - R_i'S_i'\mu)'b - b'(\lambda R_i'R_i - e_0)b \right\} \right]. \\ \end{align}\]

Note that the objective function in 5 is concave in \((\lambda, \mu)\) by 4. Therefore, the maximization over \((\lambda,\mu)\) can be performed efficiently using standard convex optimization methods. The inner minimization over \(b\) can also be solved efficiently using quadratic optimization softwares.

An upper bound of \(V_e\) can be obtained similarly, but with a stronger assumption. Specifically, by applying 2, I obtain the following upper bound of \(V_e\): \[\begin{align} U_V &= \min_{\lambda \in \mathbb{R}, ~\mu \in \mathbb{R}^L} \mathbb{E}\left[ \max_{b \in \mathcal{B}} \left\{ \mu'S_iY_i + (\lambda R_i'Y_i - R_i'S_i'\mu)'b - b'(\lambda R_i'R_i - e_0)b \right\} \right]. \\ \end{align}\] The inner objective function is a quadratic polynomial in \(b\), where the leading coefficient matrix is \(-(\lambda R_i'R_i - e_0) = e_0 - \lambda R_i'R_i\). A finite upper bound is obtained only in the region where \(e_0 - \lambda R_i'R_i\) is negative definite, i.e., all of its eigenvalues are negative. Then Weyl’s inequality implies that the largest eigenvalue of \(e_0 - \lambda R_i'R_i\) is bounded above by \(1 - \lambda \nu\), where \(\nu>0\) is the smallest eigenvalue of \(R_i'R_i\). Therefore, all eigenvalues of \(e_0 - \lambda R_i'R_i\) are negative if \(\lambda > 1/\nu\). Under this additional condition, I obtain the following upper bound of \(V_e\), which is a direct application of 2 and is stated without proof.

Assumption 9. There exists \(\lambda_{min} > 0\) such that the smallest eigenvalue of \(R_i'R_i\) is strictly larger than \(1/\lambda_{min}\) almost surely.

Proposition 6. Suppose that [ass.crc,ass.mean.nomulticollinearity,ass.mean.nomulticollinearity.s,ass.proof.regularity,ass.var.nomulticollinearity] hold. Then \(V_e \leq U_V\) where \[\begin{align} U_V &= \min_{\lambda \geq \lambda_{min}, ~\mu \in \mathbb{R}^L} \mathbb{E}\left[ \max_{b \in \mathcal{B}} \left\{ \mu'S_iY_i + (\lambda R_i'Y_i - R_i'S_i'\mu)'b - b'(\lambda R_i'R_i - e_0)b \right\} \right]. \end{align}\]

Note that 9 is stronger than 2. While 2 requires the smallest eigenvalue of \(R_i'R_i\) to be positive almost surely, 9 further requires that it is strictly bounded away from zero7. I also derive the bounds for \(V_e\) that do not require 9 in Online Appendix 10.4, but their estimation will involve computationally more intensive methods.

Next, I consider the CDF of the random coefficients. Consider the parameter of the form \[F_{e,c} = \mathbb{P}(e'B_i \leq c) = \mathbb{E}(\boldsymbol{1}(e'B_i \leq c))\] where \(e\) is a real-valued constant vector and \(c\) is a scalar. To derive the identified set of \(F_{e,c}\), I consider the moment restrictions used for the bounds in 2, namely those in (11 ). Applying 2 with (11 ) yields the bounds with the inner objective function \[\mathcal{L} = \boldsymbol{1}(e'B_i \leq c) + \lambda B_i'R_i'(Y_i-R_iB_i) + \mu'S_i(Y_i-R_iB_i)\] that must be optimized over \(B_i\) for fixed \((\lambda,\mu)\). Note that the indicator \(\boldsymbol{1}(e'B_i \leq c)\) partitions the support of \(B_i\) into two disjoint sets, where it equals to \(1\) on the set \(\{B_i | e'B_i \leq c\}\) and \(0\) on the set \(\{e'B_i > c\}\). Moreover, within each set, \(\mathcal{L}\) reduces to a standard quadratic polynomial in \(B_i\), which can be solved efficiently. Therefore, the optimization of \(\mathcal{L}\) over \(B_i\) for fixed \((\lambda,\mu)\) can be carried out in two steps: (i) solve for the quadratic polynomial within each set, and then (ii) take the optimum between the two. I then obtain the following characterization for the identified set of \(F_{e,c}\), which is a direct application of 2 and is stated without proof.

Proposition 7. Suppose that [ass.crc,ass.mean.nomulticollinearity,ass.mean.nomulticollinearity.s,ass.proof.regularity] hold. Then \(L_F \leq F_{e,b} \leq U_F\) where \[L_F = \max_{\lambda < 0, ~\mu \in \mathbb{R}^L} \mathbb{E}\left[ G_{L,F}(W_i, \lambda, \mu) \right], \quad\text{and}\quad U_F = \min_{\lambda > 0, ~\mu \in \mathbb{R}^L} \mathbb{E}\left[ G_{U,F}(W_i, \lambda, \mu) \right],\] where \[\begin{align} G_{L,F}(W_i, \lambda, \mu) = \min\Big\{ & \min_{b ~\in~ \{b \in \mathcal{B}~|~e'b \leq c\}} \Big[1 + \lambda b'R_i'(Y_i-R_ib) + \mu'S_i(Y_i-R_ib)\Big], \\ & \min_{b ~\in~ \{b \in \mathcal{B}~|~e'b > c\}} \Big[\lambda b'R_i'(Y_i-R_ib) + \mu'S_i(Y_i-R_ib)\Big] \Big\}, \end{align}\] and \[\begin{align} G_{U,F}(W_i, \lambda, \mu) = \max\Big\{ & \max_{b ~\in~ \{b \in \mathcal{B}~|~e'b \leq c\}} 1 + \lambda b'R_i'(Y_i-R_ib) + \mu'S_i(Y_i-R_ib), \\ & \max_{b ~\in~ \{b \in \mathcal{B}~|~e'b > c\}} \Big[\lambda b'R_i'(Y_i-R_ib) + \mu'S_i(Y_i-R_ib)\Big] \Big\}. \end{align}\]

If \(B_i\) is continuous, then one may replace the set \(\{b \in \mathcal{B}~|~e'b > c\}\) with its closure \(\{b \in \mathcal{B}~|~e'b \geq c\}\), which facilitates estimation and inference.

5 Estimation and inference↩︎

This section discusses estimation and inference for the identified sets derived in [sec.mean,sec.general]. This section is structured into two subsections. In the first, I consider inference for the mean parameters discussed in 3. I exploit their simple closed-form expressions to present a procedure that is both straightforward to implement and robust to overidentification and model misspecification. In the second, I consider inference for the general parameters discussed in 4, presenting a procedure under the assumption of correct model specification.

5.1 Estimation and inference for the mean parameters↩︎

In this subsection, I discuss estimation and inference for the mean parameters, focusing on the refined bounds in [prop.mean.closedform.refined,prop.mean.closedform.refined.constant]. In what follows, I present a procedure for the bounds in 2. The same procedure applies to the bounds in 3.

Note that the bounds \([L_S, U_S]\) in 2 are deterministic functions of the following moments: \[\begin{align} V_0 &= \mathcal{V}_S = \mathbb{E}(S_iR_i(R_i'R_i)^{-1}R_i'S_i'), \\ Y_0 &= 2Y_S - \mathcal{Y}_S = \mathbb{E}(2S_iY_i - S_iR_i(R_i'R_i)^{-1}R_i'Y_i), \\ P_0 &= \mathcal{P}_Se = \mathbb{E}(S_iR_i(R_i'R_i)^{-1}e), \\ m_0 &= \mathbb{E}(Y_i'R_i(R_i'R_i)^{-1}R_i'Y_i), \\ b_0 &= \mathbb{E}(e'\widehat{B}_i) = \mathbb{E}(e'(R_i'R_i)^{-1}R_i'Y_i), \\ R_0 &= \mathbb{E}((R_i'R_i)^{-1}). \end{align}\] Let \(D_i\) be the vector that collects all of the entries inside these expectations. In other words, \(D_i\) is defined as \[\begin{align} D_i = \Big( &\text{vech}(S_iR_i(R_i'R_i)^{-1}R_i'S_i')', ~(2S_iY_i - S_iR_i(R_i'R_i)^{-1}R_i'Y_i)', ~(S_iR_i(R_i'R_i)^{-1}e)', \\ &\qquad Y_i'R_i(R_i'R_i)^{-1}R_i'Y_i, ~e'(R_i'R_i)^{-1}R_i'Y_i, ~\text{vech}((R_i'R_i)^{-1})'\Big)'. \end{align}\] Note that \(\mathbb{E}(D_i) = (\text{vech}(V_0)', Y_0', P_0', m_0, b_0, \text{vech}(R_0)')'\). Now, given an independent and identically distributed (i.i.d.) sample \(\{D_i\}_{i=1}^N\) of size \(N\), define \[\overline{D}_N = \frac{1}{N}\sum_{i=1}^N D_i.\] I assume that \(\overline{D}_N\) is asymptotically normal with rate \(\sqrt{N}\), which holds if the conditions for multivariate Central Limit Theorem hold for \(D_i\) [42].

Assumption 10. \(\sqrt{N}(\overline{D}_N - \mathbb{E}(D_i))\) converges in distribution to \(N(0, V_D)\) for some variance matrix \(V_D\).

Now I discuss estimation and inference for \([L_S, U_S]\) under assumptions of 2 and 10. Recall that the expressions for \([L_S, U_S]\) are: \[[L_S, U_S] = \left[ \mathcal{B}_S - \frac{1}{2}\sqrt{\mathcal{E}_S\mathcal{D}_S}, ~\mathcal{B}_S + \frac{1}{2}\sqrt{\mathcal{E}_S\mathcal{D}_S} \right].\] Let \(\widehat{\mathcal{B}}_S\), \(\widehat{\mathcal{E}}_S\), and \(\widehat{\mathcal{D}}_S\) be the sample counterparts of \(\mathcal{B}_S\), \(\mathcal{E}_S\), and \(\mathcal{D}_S\) calculated with \(\overline{D}_N\). For example, \(\widehat{\mathcal{B}}_S\) is given by \[\begin{align} \widehat{\mathcal{B}}_S &= \frac{1}{2}e'\left(\frac{1}{N}\sum_{i=1}^N(R_i'R_i)^{-1}R_i'Y_i\right) + \frac{1}{2}e'\left(\frac{1}{N}\sum_{i=1}^N(R_i'R_i)^{-1}R_i'S_i'\right) \times \\ &\qquad\qquad\qquad\qquad\left(\frac{1}{N}\sum_{i=1}^NS_iR_i(R_i'R_i)^{-1}R_i'S_i'\right)^{-1} \left(\frac{1}{N}\sum_{i=1}^N (2S_iY_i - S_iR_i(R_i'R_i)^{-1}R_i'Y_i)\right). \end{align}\] Then, define an estimator of \([L_S, U_S]\) as \[[\widehat{L}_S, \widehat{U}_S] = \left[ \widehat{\mathcal{B}}_S - \frac{1}{2}\sqrt{\widehat{\mathcal{E}}_S\widehat{\mathcal{D}}_S}, ~\widehat{\mathcal{B}}_S + \frac{1}{2}\sqrt{\widehat{\mathcal{E}}_S\widehat{\mathcal{D}}_S} \right].\]

Since \([L_S, U_S]\) is a smooth function of \(\mathbb{E}(D_i)\) provided that \(\mathcal{E}_S > 0\) and \(\mathcal{D}_S > 0\), the Delta method [42] implies that \([\widehat{L}_S, \widehat{U}_S]\) is asymptotically normal. A key practical issue, however, is that the quantity \(\widehat{\mathcal{D}}_S\) may be negative in finite samples, causing the term \(\sqrt{\widehat{\mathcal{E}}_S\widehat{\mathcal{D}}_S}\) and thus the estimator \([\widehat{L}_S, \widehat{U}_S]\) to be not well-defined. This issue is related to a well-known challenge in inference for partially identified models — overidentification and model misspecification. In what follows, I discuss this issue in detail and propose an inference procedure that addresses it.

Recall that the bounds \([L_S, U_S]\) arise as the dual representations of the primal problem in (13 ) (and the corresponding problem for the upper bound) based on the moment restrictions in (11 ). It can be shown that the estimated bounds \([\widehat{L}_S, \widehat{U}_S]\) are the dual of the sample version of (13 ) where the population distribution \(P_W\) is replaced with the finite-sample empirical distribution \(\hat{P}_W\). Overidentification then arises when the population problem (13 ) is feasible but its sample version with \(\hat{P}_W\) is infeasible. This mirrors the familiar overidentification problem in generalized method of moments (GMM) estimation where, even if the population satisfies all the moment restrictions so that the population GMM criterion achieves zero, the finite sample may not satisfy all moment restrictions simultaneously, yielding a strictly positive sample GMM criterion8. In terms of the closed-form expressions of 2, this corresponds to having \(\mathcal{D}_S > 0\) but \(\widehat{\mathcal{D}}_S < 0\). In contrast, model misspecification arises when the population problem (13 ) itself is infeasible. In this case, the population quantity \(\mathcal{D}_S\) is negative, and thus its sample counterpart \(\widehat{\mathcal{D}}_S\) is also likely to be negative.

A recently growing literature on inference under misspecification in partially identified models [15], [43] propose solutions to these issues. In what follows, I adopt the procedure of [15] who provides a simple, easy-to-implement method for conducting inference on bounds that are smooth functions of the moments.

To apply the procedure of [15], I first construct a smooth approximation and extension of the bounds \([L_S, U_S]\) that remains well-defined for any values of \(\mathcal{B}_S\), \(\mathcal{E}_S\), and \(\mathcal{D}_S\). Let \(r > 0\) be a small constant, and define the smoothed square root function \[s(x,y) = \sqrt{\frac{xy + \sqrt{(xy)^2 + r^2}}{2}}.\] For small \(r > 0\), this function satisfies \(s(x,y) = \sqrt{xy} + O(r)\) if \(xy>0\), and \(s(x,y) = O(r)\) if \(xy < 0\). In other words, \(s(x,y)\) coincides with the ordinary square root when \(xy > 0\) and vanishes if \(xy < 0\). In addition, because of the term \(r^2 >0\), it is smooth everywhere, including at \(xy=0\). I then define the smooth approximation and extension of \([L_S, U_S]\) as: \[[L_{Smth}, U_{Smth}] = \left[ \mathcal{B}_S - \frac{1}{2}\left(s(\mathcal{E}_S,\mathcal{D}_S) - s(\mathcal{E}_S,-\mathcal{D}_S)\right), ~\mathcal{B}_S + \frac{1}{2}\left(s(\mathcal{E}_S,\mathcal{D}_S) - s(\mathcal{E}_S,-\mathcal{D}_S)\right) \right].\] Note that \(\mathcal{E}_S > 0\) even under overidentification and misspecification because \[\begin{align} \mathcal{E}_S &= e'\mathbb{E}((R_i'R_i)^{-1})e-e'\mathcal{P}_S'\mathcal{V}_S^{-1}\mathcal{P}_Se \\ &= \mathbb{E}\left( (e'-e'\mathbb{E}((R_i'R_i)^{-1}R_i'S_i')S_iR_i)(R_i'R_i)^{-1}(e-R_i'S_i'\mathbb{E}(S_iR_i(R_i'R_i)^{-1})e) \right), \end{align}\] which is a quadratic form associated with a positive definite matrix. Therefore, \(\mathcal{D}_S\) is the only quantity that can become negative in the square root function. Then, if \(\mathcal{D}_S > 0\), \([L_{Smth}, U_{Smth}]\) simplifies to \[[L_{Smth}, U_{Smth}] \approx \left[ \mathcal{B}_S - \frac{1}{2}s(\mathcal{E}_S,\mathcal{D}_S), ~\mathcal{B}_S + \frac{1}{2}s(\mathcal{E}_S,\mathcal{D}_S) \right],\] which coincides with \([L_S, U_S]\) up to the error term \(O(r)\). If \(\mathcal{D}_S < 0\), then \[[L_{Smth}, U_{Smth}] \approx \left[ \mathcal{B}_S + \frac{1}{2}s(\mathcal{E}_S,-\mathcal{D}_S), ~\mathcal{B}_S - \frac{1}{2}s(\mathcal{E}_S,-\mathcal{D}_S) \right]\] so that \(L_{Smth} > U_{Smth}\), indicating that the estimated bound is empty.

Now I discuss inference for \([L_{Smth}, U_{Smth}]\). Define the estimator of \([L_{Smth}, U_{Smth}]\) as \[[\widehat{L}_{Smth}, \widehat{U}_{Smth}] = \left[ \widehat{\mathcal{B}}_S - \frac{1}{2}\left(s(\widehat{\mathcal{E}}_S,\widehat{\mathcal{D}}_S) - s(\widehat{\mathcal{E}}_S,-\widehat{\mathcal{D}}_S)\right), ~\widehat{\mathcal{B}}_S + \frac{1}{2}\left(s(\widehat{\mathcal{E}}_S,\widehat{\mathcal{D}}_S) - s(\widehat{\mathcal{E}}_S,-\widehat{\mathcal{D}}_S)\right) \right].\] 10 and the Delta method [42] then imply that \((\widehat{L}_{Smth}, \widehat{U}_{Smth})\) is asymptotically normal: \[\sqrt{N}((\widehat{L}_{Smth}, \widehat{U}_{Smth})' - (L_{Smth}, U_{Smth})') \overset{d}{\longrightarrow} N\left(0, \left[\begin{array}{cc} \sigma_L^2 & \rho \sigma_L \sigma_U \\ \rho \sigma_L \sigma_U & \sigma_U^2 \end{array}\right]\right)\] for some \(\sigma_L\), \(\sigma_U\), and \(\rho\). This verifies Assumption 1 of [15]. Note that \(\sigma_L\), \(\sigma_U\), and \(\rho\) can be consistently estimated by bootstrap [42].

Next, define the pseudo-true parameter [15], [43]: \[\mu_e^* = \frac{\sigma_UL_{Smth} + \sigma_LU_{Smth}}{\sigma_L + \sigma_U}.\] Note that \(\mu_e^*\) is well-defined even if \(\mathcal{D}_S < 0\) and that \(\mu_e^* \approx \mathcal{B}_S\). Define its estimator as \[\widehat{\mu}_e^* = \frac{\widehat{\sigma}_U\widehat{L}_{Smth} + \widehat{\sigma}_L\widehat{U}_{Smth}}{\widehat{\sigma}_L + \widehat{\sigma}_U},\] where \(\widehat{\sigma}_L\), \(\widehat{\sigma}_U\), and \(\widehat{\rho}\) are consistent estimators of \(\sigma_L\), \(\sigma_U\), and \(\rho\), respectively. Both \(\mu_e^*\) and \(\widehat{\mu}_e^*\) are well-defined under overidentification or misspecification.

Then, the \((1-\alpha)\)-level confidence interval for \(\mu_e\) is constructed as follows. First, consider an interval for \(\mu_e\) based on the smoothed bounds \([\widehat{L}_{Smth}, \widehat{U}_{Smth}]\): \[I_{\mu_e} = \left[\widehat{L}_{Smth} - \widehat{c}(\alpha)\frac{\widehat{\sigma}_L}{\sqrt{N}}, ~~\widehat{U}_{Smth} + \widehat{c}(\alpha)\frac{\widehat{\sigma}_U}{\sqrt{N}}\right],\] where \(\widehat{c}(\alpha)\) is the critical value specified in Table 1 of [15]. For instance, if \(\alpha = 0.05\), then \(\widehat{c}(0.05) = 1.64\) if \(\widehat{\rho} < 0.8\), and \(\widehat{c}(0.05) = 1.96\) if \(\widehat{\rho} \approx 1\). Note that \(I_{\mu_e}\) may be empty under overidentification or misspecification. Second, consider an interval for the pseudo-true parameter \(\mu_e^*\): \[I_{\mu_e^*} = \left[\widehat{\mu}_e^* - \Phi\left(1-\frac{\alpha}{2}\right)\frac{\widehat{\sigma}^*}{\sqrt{N}}, ~~\widehat{\mu}_e^* + \Phi\left(1-\frac{\alpha}{2}\right)\frac{\widehat{\sigma}^*}{\sqrt{N}}\right]\] where \(\Phi\) is the standard normal CDF and \[\widehat{\sigma}^* = \frac{\widehat{\sigma}_L\widehat{\sigma}_U\sqrt{2+2\widehat{\rho}}}{\widehat{\sigma}_L + \widehat{\sigma}_U}.\] Then, the \((1-\alpha)\)-level confidence interval for \(\mu_e\) that is valid under overidentification and misspecification is given by \[CI_{\mu_e} = I_{\mu_e} \cup I_{\mu_e^*}.\] Theorem 1 of [15] establishes the validity of \(CI_{\mu_e}\). Under overidentification, \(CI_{\mu_e}\) asymptotically achieves the \((1-\alpha)\) coverage rate for the true parameter \(\mu_e\), where overidentification is resolved as \(N \rightarrow \infty\). Under misspecification, \(CI_{\mu_e}\) asymptotically achieves the coverage rate for the pseudo-true parameter \(\mu_e^*\).

5.2 Inference for the general parameters↩︎

I now discuss construction of a confidence interval for a general parameter \(\theta\) in 4. By 2, the bounds \([L, U]\) of \(\theta\) are given by \[L = \max_{\lambda \in \mathbb{R}^K}\mathbb{E}(G_L(\lambda, W_i)), \quad\text{and}\quad U = \min_{\lambda \in \mathbb{R}^K}\mathbb{E}(G_U(\lambda, W_i)).\] Note first that any \(\theta \in [L, U]\) must satisfy \[\begin{align} \theta \geq L &= \max_{\lambda \in \mathbb{R}^{K}}\mathbb{E}(G_L(\lambda, W_i)), \\ \theta \leq U &= \min_{\lambda \in \mathbb{R}^{K}}\mathbb{E}(G_U(\lambda, W_i)). \end{align}\] For regularity of the inference procedure, consider a large compact set \(R^K \subseteq \mathbb{R}^K\) and consider the inequalities \[\begin{align} \theta \geq \tilde{L} &= \max_{\lambda \in R^K}\mathbb{E}(G_L(\lambda, W_i)), \\ \theta \leq \tilde{U} &= \min_{\lambda \in R^K}\mathbb{E}(G_U(\lambda, W_i)). \end{align}\] I choose the set \(R^K\) to be large enough so that both \(\lambda_0^L = \mathop{\mathrm{argmax}}_\lambda \mathbb{E}(G_L(\lambda, W_i))\) and \(\lambda_0^U = \mathop{\mathrm{argmin}}_\lambda \mathbb{E}(G_U(\lambda, W_i))\) lie in the interior of \(R^K\), in which case \([L, U] = [\tilde{L}, \tilde{U}]\). Otherwise, \([\tilde{L}, \tilde{U}]\) becomes an outer identified set of \([L, U]\). I then rewrite the above as \[\begin{align} \theta \geq \mathbb{E}(G_L(\lambda, W_i)) \quad \text{ for all } \lambda \in R^K, \\ \theta \leq \mathbb{E}(G_U(\lambda, W_i)) \quad \text{ for all } \lambda \in R^K. \end{align}\] Equivalently, these can be written as the following moment inequalities: \[\begin{align} \mathbb{E}(G_L(\lambda, W_i) - \theta) \leq 0 \quad \text{ for all } \lambda \in R^K, \\ \mathbb{E}(\theta - G_U(\lambda, W_i)) \leq 0 \quad \text{ for all } \lambda \in R^K, \end{align} \label{eq46inference}\tag{18}\] which is a moment inequalities model with infinitely many restrictions indexed by \(\lambda\).

The literature on many moment inequalities [16], [44][46] develops procedures for constructing a confidence interval for \(\theta\). In this paper, I adopt the inference procedure of [16] on a continuum of moment inequalities, which includes countably many moment inequalities as a special case. Note first that \(G_L\) is concave and \(G_U\) is convex in \(\lambda\) by 4, which implies that both functions are continuous in \(\lambda\). This means that, for inference on \(\theta\), it suffices to consider: \[\begin{align} \mathbb{E}(G_L(\lambda, W_i) - \theta) \leq 0 \quad \text{ for all } \lambda \in Q^K, \\ \mathbb{E}(\theta - G_U(\lambda, W_i)) \leq 0 \quad \text{ for all } \lambda \in Q^K, \end{align} \label{eq46inference46countable}\tag{19}\] where \(Q^K \subseteq R^K\) is a set of rational numbers in \(R^K\), which is dense in \(R^K\). Section 9.2 of [16] develops an inference procedure for this countable set of moment inequalities. The conditions for the validity of their procedure are given in Lemma 9.2 of [16]. Although this lemma is given for a single moment restriction with one-dimensional \(\lambda\), its extension to two moment restrictions and to a \(K\)-dimensional \(\lambda\) is straightforward. In what follows, I assume that the conditions of their Lemma 9.2 are satisfied, which are mild given 8 and the fact that \(Q^K\) is compact9.

Assumption 11. There is \(\underline{\sigma} > 0\) such that \(\text{Var}(G_L(\lambda_0, W_i)) \geq \underline{\sigma}^2\) and \(\text{Var}(G_U(\lambda_0, W_i)) \geq \underline{\sigma}^2\) for some fixed \(\lambda_0 \in Q^K\). Also, there is a measurable function \(g\) such that \(|G_L(\lambda_0, W_i)| \leq g(W_i)\), \(|G_U(\lambda_0, W_i)| \leq g(W_i)\), and \(\mathbb{E}((g(W_i)/\underline{\sigma})^{2+r}) \leq C\) for some \(r > 0\) and \(C < \infty\).

In what follows, I apply their inference method under assumptions of 2 and 11, where I choose the tuning parameters appropriately for brevity of discussion. Given an i.i.d. sample \(\{W_i\}_{i=1}^N\) of size \(N\), define the sample quantities \[\hat{\mu}_{G_L}(\lambda) = \frac{1}{N}\sum_{i=1}^N G_L(\lambda, W_i) \quad\text{and}\quad \hat{\sigma}_{G_L}(\lambda) = \sqrt{(1+\kappa)\frac{1}{N}\sum_{i=1}^N \left( G_L(\lambda, W_i) - \hat{\mu}_{G_L}(\lambda)\right)^2}\] where \(\kappa = 0.05\) is a small number, and where \(\hat{\mu}_{G_U}(\lambda)\) and \(\hat{\sigma}_{G_U}^2(\lambda)\) are defined similarly with \(G_U\). Define the test statistic as \[T_{AS}(\theta) = \sup_{\lambda \in Q^K} ~\max\left\{\frac{\sqrt{N}(\hat{\mu}_{G_L}(\lambda) - \theta)}{\hat{\sigma}_{G_L}(\lambda)}, ~\frac{\sqrt{N}(\theta - \hat{\mu}_{G_U}(\lambda))}{\hat{\sigma}_{G_U}(\lambda)}, ~0\right\}^2,\] which corresponds to the function \(S_3\) in [16]. This test statistic is then compared to the critical value \(c_{AS}(\alpha)\), which can be computed in two ways: the plug-in asymptotic (PA) type and the generalized moment selection (GMS) type. For brevity of discussion, I briefly outline the PA type critical value here, which yields an intuitive expression for a confidence interval of \(\theta\), and refer to [16] for the GMS type critical value.

Let \(\{W_i^{(b)}\}_{i=1}^N\) be the empirical bootstrap sample of \(\{W_i\}_{i=1}^N\), meaning each \(\{W_i^{(b)}\}_{i=1}^N\) is drawn from \(\{W_i\}_{i=1}^N\) with replacement. Let \(\hat{\mu}_{G_L}^{(b)}\), \(\hat{\mu}_{G_U}^{(b)}\), \(\hat{\sigma}_{G_L}^{(b)}\), \(\hat{\sigma}_{G_U}^{(b)}\) be the values of \(\hat{\mu}_{G_L}\), \(\hat{\mu}_{G_U}\), \(\hat{\sigma}_{G_L}\), \(\hat{\sigma}_{G_U}\) computed with \(\{W_i^{(b)}\}_{i=1}^N\) instead of \(\{W_i\}_{i=1}^N\). Then, compute the statistic \[\begin{align} c_{AS}^{(b)}(\theta) = \sup_{\lambda \in Q^K} ~ \max \Big\{ & \frac{\sqrt{N}(\hat{\mu}_{G_L}^{(b)}(\lambda) - \hat{\mu}_{G_L}(\lambda)) }{\hat{\sigma}_{G_L}^{(b)}(\lambda)}, \frac{\sqrt{N}(\hat{\mu}_{G_U}(\lambda) - \hat{\mu}_{G_U}^{(b)}(\lambda)) }{\hat{\sigma}_{G_U}^{(b)}(\lambda)},~0\Big\}^2. \end{align}\] The critical value \(c_{AS}(\theta,\alpha)\) is then defined as the \((1-\alpha)\) quantile of the bootstrapped \(c_{AS}^{(b)}\) values. The confidence set for \(\theta\) is then given by \(\{\theta ~|~ T_{AS}(\theta) \leq c_{AS}(\theta,\alpha)\}\). Note that the critical value \(c_{AS}(\theta,\alpha)\) does not depend on \(\theta\). Consequently, the PA type confidence set simplifies to the interval \[\left[\sup_{\lambda}\left\{\hat{\mu}_{G_L}(\lambda) - \sqrt{c_{AS}(\alpha)} \times \frac{\hat{\sigma}_{G_L}(\lambda)}{\sqrt{N}}\right\}, ~~ \inf_{\lambda}\left\{\hat{\mu}_{G_U}(\lambda) + \sqrt{c_{AS}(\alpha)} \times \frac{\hat{\sigma}_{G_U}(\lambda)}{\sqrt{N}}\right\} \right].\]

When \(K\) is large, searching for supremum over all \(\lambda \in Q^K\) in \(T_{AS}(\theta)\) and \(c_{AS}^{(b)}(\theta)\) can be computationally prohibitive. However, note that the inequalities in (19 ) bind only at two \(\lambda\) values, namely at \(\lambda_L^* = \mathop{\mathrm{argmax}}_\lambda\mathbb{E}( G_L(\lambda, W_i))\) and \(\lambda_U^* = \mathop{\mathrm{argmin}}_\lambda\mathbb{E}( G_U(\lambda, W_i))\). Moreover, since \(G_L\) is concave and \(G_U\) is convex, the inequalities become loose for \(\lambda\) values that are far from \(\lambda_L^*\) and \(\lambda_U^*\). Consequently, in practice, one can focus the search for \(\lambda\) on neighborhoods of \(\lambda_L^*\) and \(\lambda_U^*\). While \(\lambda_L^*\) and \(\lambda_U^*\) are population quantities, they can be approximated with their sample analogues.

The procedure naturally extends to a vector-valued parameter \(\theta \in \mathbb{R}^d\), by considering (18 ) on each component of \(\theta\). For example, the moment inequalities for \(\theta = (\theta_1, \theta_2) \in \mathbb{R}^2\) are: \[\begin{align} \mathbb{E}(G_{L1}(\lambda, W_i) - \theta_1) \leq 0 \quad \text{ for all } \lambda \in Q^K, \\ \mathbb{E}(\theta_1 - G_{U1}(\lambda, W_i)) \leq 0 \quad \text{ for all } \lambda \in Q^K, \\ \mathbb{E}(G_{L2}(\lambda, W_i) - \theta_2) \leq 0 \quad \text{ for all } \lambda \in Q^K, \\ \mathbb{E}(\theta_2 - G_{U2}(\lambda, W_i)) \leq 0 \quad \text{ for all } \lambda \in Q^K, \end{align}\] where \(G_{Uk}\) and \(G_{Lk}\) denote the functions \(G_L\) and \(G_U\) in (18 ) corresponding to \(\theta_k\) for \(k=1,2\). Applying the same inference procedure then yields a confidence region in \(\mathbb{R}^2\). This extension can be used to construct a confidence interval for the variance of random coefficients, which involves both first and second moments. Alternatively, it can be constructed by the Bonferroni correction to the individual bounds.

Lastly, I discuss overidentification and model misspecification in inference for the general parameters. Under overidentification or misspecification, the test statistic \(T_{AS}(\theta)\) and its bootstrap critical value \(c_{AS}^{(b)}(\theta)\) all diverge to \(+\infty\). In contrast to the case of mean parameters, it is substantially more challenging to deal with these issues for general parameters. [43] develop a general method for constructing valid confidence intervals under overidentification or misspecification, but their approach applies to a finite number of moment restrictions and therefore is not readily applicable to the countably infinite set considered here. Extending their approach to countably many moment restrictions is beyond the scope of this paper and is not pursued here. Instead, in Online Appendix 10.5, I discuss a heuristic modification of the procedure of [16], which closely align with the spirit of [43]. I check the performance of this heuristic procedure via simulation, also in Online Appendix 10.5.

6 Application to lifecycle earnings dynamics↩︎

6.1 Overview↩︎

Lifecycle earnings dynamics serve as a key input in various macroeconomic models. For example, in models of consumption and savings dynamics [17][20], households facing a higher earnings risk accumulate more precautionary savings to smooth consumption over time. As [22] points out, specifying an earnings process that highlights features of real data is important for properly calibrating and drawing conclusions from these models.

When used as an input, it is common to specify earnings dynamics using a parsimonious linear model. [21], [22] studied two leading views on parsimonious specification of the earnings dynamics. Consider two earnings processes10: \[\begin{array}{llll} Y_{it} &= \alpha_i + z_{it}, \qquad &z_{it} = \rho z_{i,t-1} + \eta_{it}, & \qquad\text{(RIP)} \\ Y_{it} &= \alpha_i + \beta_i h_{it} + z_{it}, \qquad &z_{it} = \rho z_{i,t-1} + \eta_{it}, & \qquad\text{(HIP)} \end{array} \label{eq46application46incomeprocess46intro}\tag{20}\] where \(h = \text{age} - \max\{\text{years of schooling}, 12\} - 6\) is potential years of experience, \(Y_{it}\) is the residual log-earnings obtained by regressing log-earnings on time indicators and their interactions with a cubic polynomial in \(h\), and \((\alpha_i, \beta_i)\) are heterogeneous coefficients. In addition, \(\{z_{it}\}\) is an AR(1) process with a mean zero shock \(\eta_{it}\)11. These two models are known as the Restricted Income Profiles (RIP) process and the Heterogeneous Income Profiles (HIP) process, respectively. In both models, \(\rho\) captures the earnings persistence that households face. As [22] summarizes, the literature reports \(0.5 < \rho < 0.7\) and \(\text{Var}(\beta_i) > 0\) for the HIP process (e.g., [25], [47]), meaning that households experience modest persistence and heterogeneous trends. By contrast, [48] tested the hypothesis that \(\text{Var}(\beta_i) = 0\) and did not reject it. The literature reports \(\rho \approx 1\) for the RIP process (e.g., [49], [50]), meaning households experience extreme persistence and homogeneous trends. [21] demonstrated that the HIP process better aligns with features of consumption data, and [22] showed that misspecifying the HIP process as a RIP process leads to an upward biased estimate of \(\rho\), often obtaining \(\rho \approx 1\).

While there is vast literature on unobserved heterogeneity in \(\beta_i\) and its influence on \(\rho\), relatively few studies examines heterogeneity in \(\rho\) itself. Notable recent studies include [51], [52], and [53]; the first two assume a factor structure for \(\rho_i\), and the latter imposes stationarity of (20 ) and assumes \(\eta_{it}\) are i.i.d. over \(i\) and \(t\). In this section, I estimate a generalization of (20 ) where \(\rho\) varies across individuals, writing \(\rho=\rho_i\), where the distribution of \(\rho_i\) and its correlation with \((\alpha_i, \beta_i, Y_{i0})\) are unrestricted. Differently from [53], who also extend [22], the distribution of \(\eta_{it}\) also remains unrestricted and may depend on \((\alpha_i, \beta_i, \rho_i)\), allowing for heteroskedasticity.

In the remainder of this section, I find that, when \(\rho\) is allowed to vary across individuals, both RIP and HIP specifications deliver similar estimates of \(\mathbb{E}(\rho_i)\) that are significantly less than \(1\). At the 95% confidence level, the upper bounds of the confidence intervals for \(\mathbb{E}(\rho_i)\) under both processes are between \(0.5\) and \(0.6\), and the two intervals have substantial overlap. This result suggests that, when \(\rho\) is allowed to be heterogeneous, choosing RIP over HIP or vice versa may not lead to serious misspecification of \(\rho_i\). Moreover, the 90% confidence intervals for \(\text{Var}(\rho_i)\) and \(\mathbb{P}(\rho_i \leq r)\) for \(r \in (0,1)\) in the RIP model suggest the presence of heterogeneity in \(\rho_i\). In particular, the lower confidence limit for \(\text{Var}(\rho_i)\) is \(0.009\), implying a standard deviation of \(0.097\), and the confidence intervals for the CDF of \(\rho_i\) suggest that at least 41% of individuals have \(\rho_i \leq 0.8\).

6.2 Data and models↩︎

I analyze data on U.S. households from the Panel Study of Income Dynamics (PSID) dataset. I use the dataset of [22], who analyzed the PSID dataset of male heads of households collected annually. The dataset consists of male head of households who are not in the poverty (SEO) subsample and who consecutively reported positive hours (between 520 and 5110 hours a year) and earnings (between a preset minimum and maximum wage). From the dataset of [22], I select individuals observed consecutively from 1976 to 1991, yielding \(N=800\) and \(T=15\), where the first wave serves as the initial value of earnings. I estimate two dynamic random coefficient models: \[\begin{array}{llll} Y_{it} &= \alpha_i + \rho_i Y_{i,t-1} + \eta_{it}, & \mathbb{E}(\eta_{it}|\alpha_i, \rho_i, Y_i^{t-1}) = 0, & \qquad\text{(RIP-RC)} \\ Y_{it} &= \alpha_i + \beta_i h_{it} + \rho_i Y_{i,t-1} + \eta_{it}, & \mathbb{E}(\eta_{it}|\alpha_i, \beta_i, \rho_i, Y_i^{t-1}, h_i) = 0. & \qquad\text{(HIP-RC)} \end{array} \label{eq46application46incomeprocess}\tag{21}\] These models generalize (20 ), and they can be derived by quasi-differencing \(Y_{it}\) in (20 ) and assuming \(h_{it}\approx h_{i,t-1}+1\). Specifically, quasi-differencing the RIP process gives \[Y_{it} = \alpha_i(1-\rho_i) + \rho_i Y_{i,t-1} + \eta_{it} \equiv \tilde{\alpha}_i + \rho_i Y_{i,t-1} + \eta_{it}.\] Likewise, quasi-differencing the HIP process gives \[Y_{it} = \alpha_i(1-\rho_i) + \beta_i\rho_i + \beta_i(1-\rho_i)h_{it} + \rho_i Y_{i,t-1} + \eta_{it} \equiv \tilde{\alpha}_i + \tilde{\beta}_i h_{it} + \rho_i \tilde{Y}_{i,t-1} + \eta_{it}.\] Note that [22] defines \(Y_{it}\) in (20 ) as the residual from the regression on time indicators and their interactions with a cubic polynomial in \(h_{it}\), i.e., the regression \[\begin{align} Y_{it} &= \sum_{s=1976}^{1991} \left(\boldsymbol{1}(t=s)\delta_{0,s} + \boldsymbol{1}(t=s) h_{it} \delta_{1,s} + \boldsymbol{1}(t=s) h_{it}^2 \delta_{2,s} + \boldsymbol{1}(t=s) h_{it}^3 \delta_{3,s}\right) + \nu_{it} \\ &\equiv X_{it}'\delta + \nu_{it}, \end{align} \label{eq46application46firststage}\tag{22}\] where \(Y_{it}\) is now the raw log-earnings data, and \(X_{it}\) and \(\delta\) denote the regressors and the coefficients in (22 ), i.e., \(X_{it} = \text{vec}\left\{(\boldsymbol{1}(t=s), \boldsymbol{1}(t=s) h_{it}, \boldsymbol{1}(t=s) h_{it}^2, \boldsymbol{1}(t=s) h_{it}^3)_{s=1976}^{1991}\right\}\) and \(\delta = \text{vec}\left\{(\delta_{0,s}, \delta_{1,s}, \delta_{2,s}, \delta_{3,s})_{s=1976}^{1991}\right\}\). [22] estimate the RIP and HIP models in (20 ) using the two-step procedure that is standard in the literature, where one first obtains the residuals from the regression in (22 ), and then one treats these residuals as \(Y_{it}\) and estimate the RIP and HIP models in (20 ). The motivation of this approach is to first “partial out” the control variables \(X_{it}\) and then consider earnings dynamics that are free of \(X_{it}\). However, this approach may understate the standard errors of the RIP and HIP estimates, since it fails to account for the sampling variability introduced by the first-stage regression. Moreover, any estimation error in the first stage may appear as heterogeneity in \((\alpha_i, \beta_i)\) in the RIP-RC and HIP-RC specifications. To address these issues, I also consider a joint model of the control variables term in (22 ) and the RIP-RC and HIP-RC models in (21 ). Specifically, I estimate \[\begin{array}{llll} Y_{it} &= X_{it}'\delta + \alpha_i + \rho_i Y_{i,t-1} + \eta_{it}, & \mathbb{E}(\eta_{it}|\alpha_i, \rho_i, Y_i^{t-1}, X_i) = 0, & \text{(RIP-RC-J)} \\ Y_{it} &= X_{it}'\delta + \alpha_i + \beta_i h_{it} + \rho_i Y_{i,t-1} + \eta_{it}, & \mathbb{E}(\eta_{it}|\alpha_i, \beta_i, \rho_i, Y_i^{t-1}, h_i, X_i) = 0. & \text{(HIP-RC-J)} \end{array} \label{eq46application46incomeprocess46homo}\tag{23}\] where the homogeneous coefficients \(\delta\) and the heterogeneous coefficients \((\alpha_i, \beta_i, \rho_i)\) are jointly considered. I refer to these specifications in (23 ) as RIP-RC-J and HIP-RC-J. I estimate the mean parameters of (23 ) using the bounds in 3.

Note that, for estimation of the RIP-RC-J model, the regressor \(\boldsymbol{1}(t=1976)\) must be removed from the model because it is multicollinear with the individual-specific intercept \(\alpha_i\). Likewise, for estimation of the HIP-RC-J model, both \(\mathbf{1}(t=1976)\) and \(\mathbf{1}(t=1976)h_{it}\) must be dropped from \(X_{it}\) to avoid multicollinearity with the \(\alpha_i\) and the \(h_{it}\) terms. These exclusions ensure that the no-multicollinearity condition of 5 holds. After these removals, \(X_{it}\) has 59 regressors in RIP-RC-J and 58 in HIP-RC-J models. The estimation result below will show that the bounds in 3 produces informative confidence intervals under this setup, demonstrating its practical applicability with a large number of regressors with homogeneous coefficients.

In what follows, I construct confidence intervals for \(\mathbb{E}(\rho_i)\) under the RIP-RC, HIP-RC, RIP-RC-J, and HIP-RC-J specifications, using the bounds presented in [prop.mean.closedform.refined,prop.mean.closedform.refined.constant]. For the RIP-RC and HIP-RC models, I employ the two-step procedure of [22] which first obtains residuals from (22 ) and then uses these residuals as \(Y_{it}\) in the RIP-RC and HIP-RC models. In contrast, for the RIP-RC-J and HIP-RC-J models, I directly estimate \(\mathbb{E}(\rho_i)\) from (23 ), jointly considering the control variables term. In addition, I construct the confidence intervals for \(\text{Var}(\rho_i)\) and \(\mathbb{P}(\rho_i \leq r)\) over the grid \(r \in \{0.1, \ldots, 0.9\}\) under the RIP-RC model, using the bounds presented in 4.2 and assuming \(\mathcal{B} = [-3,3] \times [0,1]\) as the support of \((\alpha_i, \rho_i)\).

For calculation of the mean bounds, I choose \(S_{it} = (1, Y_{i,\max\{0, ~t-5\}}, \ldots, Y_{i,t-1})'\) for RIP-type models, and \(S_{it} = (1, Y_{i,\max\{0, ~t-5\}}, \ldots, Y_{i,t-1}, h_{i,\max\{1, ~t-5\}}, \ldots, h_{i,\min\{T, ~t+5\}})\) for HIP-type models. For calculation of the variance and the CDF bounds, I choose \(S_{it} = (1, Y_{i,\max\{0, ~t-4\}}, \ldots, Y_{i,t-1})'\) for the RIP-RC model. For these choices of \(S_{it}\), the overidentification issue arises in the estimated bounds. For inference on \(\mathbb{E}(\rho_i)\), I apply the procedure of [15] discussed in 5.1. For inference on \(\text{Var}(\rho_i)\) and \(\mathbb{P}(\rho_i \leq r)\), I adopt the heuristic modification of [16] described in Online Appendix 10.5. Guided by simulation results, I evaluate the supremum with \(100\) grid points in the neighborhoods. All critical values are calculated with \(1000\) bootstrap replications, using the PA type for \(\text{Var}(\rho_i)\) and \(\mathbb{P}(\rho_i \leq r)\). The interval for \(\text{Var}(\rho_i)\) is constructed with the Bonferroni correction.

6.3 Results↩︎

The 95% confidence intervals for \(\mathbb{E}(\rho_i)\) are reported in 2. Both models estimate \(\mathbb{E}(\rho_i)\) to be significantly less than 1, and the confidence intervals in RIP-RC and HIP-RC demonstrate substantial overlap, having similar upper confidence limits. This suggests that specifying homogeneous or heterogeneous \(\beta_i\) does not lead to serious misspecification when \(\rho_i\) is allowed to be heterogeneous. The confidence intervals for RIP-RC-J and HIP-RC-J are similar to those for RIP-RC and HIP-RC, supporting the same argument. Note that these intervals are computed with the procedure described in 5.1, which is robust to overidentification and model misspecification. These findings are qualitatively similar when also considering the transitory income process, as reported in Online Appendix 10.6.

Table 2: Confidence intervals of \(\mathbb{E}(\rho_i)\) for the RIP type and the HIP type processes with heterogeneous coefficients. The nominal coverage probability is \(0.95\). These confidence intervals are robust to overidentification and model misspecification.
Parameter RIP-RC HIP-RC RIP-RC-J HIP-RC-J
\(\mathbb{E}(\rho_i)\) [0.425, 0.596] [0.253, 0.566] [0.455, 0.588] [0.260, 0.543]

The 90% confidence intervals for \(\text{Var}(\rho_i)\) and \(\mathbb{P}(\rho_i \leq r)\) over the grid \(r \in \{0.1, \ldots, 0.9\}\) for the RIP-RC model are reported in 3. The lower confidence limit of \(\text{Var}(\rho_i)\) is \(0.009\), implying a standard deviation of \(0.097\), suggesting heterogeneity in \(\rho_i\). Similar evidence is observed from confidence intervals for the CDF of \(\rho_i\). They indicate that at least 41% of households have \(\rho_i \leq 0.8\) and at least 31% have \(\rho_i \leq 0.5\). These findings suggest unobserved heterogeneity in the earnings risk that households face, highlighting the importance of allowing for heterogeneity in \(\rho_i\) in modeling income processes that reflect features of real data.

Table 3: Confidence intervals of \(\text{Var}(\rho_i)\) and \(\mathbb{P}(\rho_i \leq r)\) for the RIP and the HIP processes with heterogeneous coefficients. The nominal coverage probability is \(0.90\).
Parameter RIP-RC
\(\text{Var}(\rho_i)\) [0.009, 0.233]
\(\mathbb{P}(\rho_i \leq 0.1)\) [0.087, 0.996]
\(\mathbb{P}(\rho_i \leq 0.2)\) [0.124, 0.996]
\(\mathbb{P}(\rho_i \leq 0.3)\) [0.159, 1.000]
\(\mathbb{P}(\rho_i \leq 0.4)\) [0.196, 1.000]
\(\mathbb{P}(\rho_i \leq 0.5)\) [0.310, 1.000]
\(\mathbb{P}(\rho_i \leq 0.6)\) [0.365, 1.000]
\(\mathbb{P}(\rho_i \leq 0.7)\) [0.396, 1.000]
\(\mathbb{P}(\rho_i \leq 0.8)\) [0.419, 1.000]
\(\mathbb{P}(\rho_i \leq 0.9)\) [0.413, 1.000]

7 Conclusion↩︎

This paper studies the identification and estimation of dynamic random coefficient models in a short panel context. The model extends the standard dynamic panel linear model with fixed effects [1], [2], allowing coefficients to be individual-specific. I show that the model is not point-identified but rather partially identified, and I characterize the identified sets of the mean, variance and CDF of the random coefficients using the dual representation of an infinite-dimensional linear program. I propose a computationally tractable estimation and inference procedure by adopting the approach of [15] for the mean parameters and [16] for the variance and CDF parameters. The procedure of [15] is robust to overidentification and model misspecification.

I use my method to estimate unobserved heterogeneity in earnings persistence across U.S. households using the PSID dataset. I find that the average earnings persistence is significantly less than 1 when it is allowed to be heterogeneous. Moreover, its confidence interval under the RIP and HIP specifications show substantial overlap, suggesting that choosing RIP over HIP or vice versa does not lead to serious misspecification about the earnings process when persistence is heterogeneous. Lastly, confidence intervals for the variance and CDF of the earnings persistence parameter suggest the presence of unobserved heterogeneity, which is a key source of heterogeneity in consumption and savings behaviors.

8 Acknowledgements↩︎

This is based on my PhD dissertation at the University of Chicago. I am deeply indebted to Stéphane Bonhomme, Alexander Torgovitsky, and Guillaume Pouliot for their invaluable guidance and support. I also thank Francesca Molinari and three anonymous reviewers for their insightful comments and suggestions. I thank Manuel Arellano, Timothy Armstrong, Antonio Galvao, Greg Kaplan, Roger Koenker, Zhipeng Liao, Jack Light, Hashem Pesaran, Azeem Shaikh, Shuyang Sheng, Panagiotis Toulis, and Ying Zhu for helpful discussions and comments. I also thank participants of the Econometrics Working Group at the University of Chicago.

9 Online Appendix: Proofs↩︎

Proof of Proposition 1. To prove 1, I start from a data generating process that satisfies (7 ) and then modify it to construct a new process that is observationally equivalent.

Let \((\gamma_i, \beta_i, Y_{i0}, Y_{i1}, Y_{i2})\) be the random variables that satisfy (7 ). These variables must satisfy two conditions. First, they generate the observed data: \[\mathbb{P}(Y_{i0} \leq y_0, Y_{i1} \leq y_1, Y_{i2} \leq y_2) = \mathbb{F}(y_0,y_1,y_2), \label{eq46proof46failure46data}\tag{24}\] where \(\mathbb{F}\) is the observed cumulative distribution function of \((Y_{i0}, Y_{i1}, Y_{i2})\). Second, they satisfy the model constraints: \[\begin{align} \mathbb{E}(Y_{i1} - \gamma_i - \beta_i Y_{i0}|\gamma_i, \beta_i, Y_{i0}) &= 0 \qquad \text{ for all } (\gamma_i,\beta_i,Y_{i0}), \\ \mathbb{E}(Y_{i2} - \gamma_i - \beta_i Y_{i1}|\gamma_i, \beta_i, Y_{i0}, Y_{i1}) &= 0 \qquad \text{ for all } (\gamma_i,\beta_i,Y_{i0},Y_{i1}). \\ \end{align} \label{eq46proof46failure46epsilon}\tag{25}\]

Now, I construct a new data generating process that also satisfies (24 ) and (25 ). Given the joint distribution of \((\gamma_i, \beta_i, Y_{i0}, Y_{i1})\), let \(k\) be a deterministic function of \((\gamma_i, \beta_i, Y_{i0}, Y_{i1})\) such that \[\mathbb{E}((Y_{i1}-Y_{i0})k(\gamma_i, \beta_i, Y_{i0}, Y_{i1})|\gamma_i, \beta_i, Y_{i0}) = 0, \label{eq46proof46failure46k}\tag{26}\] so that \(k\) is orthogonal to \(Y_{i1}-Y_{i0}\) conditional on \((\gamma_i, \beta_i, Y_{i0})\). I will specify the explicit expression for \(k\) later in the proof. Then, given the function \(k\), I define new random coefficients \((\tilde{\gamma}_i, \tilde{\beta}_i)\) as the following deterministic functions of \((\gamma_i, \beta_i, Y_{i0}, Y_{i1})\): \[\left(\left.\begin{array}{c} \tilde{\gamma}_i \\ \tilde{\beta}_i \end{array}\right)\right|(Y_{i0}=y_0, Y_{i1}=y_1, \gamma_i=r, \beta_i=b) = \left(\begin{array}{cc} r - y_1 k(r, b, y_0, y_1) \\ b + k(r, b, y_0, y_1) \end{array}\right). \label{eq46proof46failure46coef}\tag{27}\] I then define \(\tilde{Y}_{i2}\) conditional on \((Y_{i0}, Y_{i1}, \gamma_i, \beta_i, \tilde{\gamma}_i, \tilde{\beta}_i)\) as \[\begin{align} &\tilde{Y}_{i2}|(Y_{i0}=y_0, ~Y_{i1}=y_1, ~\gamma_i=r, ~\beta_i=b, ~\tilde{\gamma}_i=\tilde{r}, ~\tilde{\beta}_i=\tilde{b}) \\ &\overset{d}{=} Y_{i2}|(Y_{i0}=y_0, ~Y_{i1}=y_1, ~\gamma_i=r, ~\beta_i=b). \end{align} \label{eq46proof46failure46y2}\tag{28}\] Equations (27 ) and (28 ) together yield a joint distribution of \((\gamma_i, \beta_i, \tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1}, \tilde{Y}_{i2})\), which in turn implies a joint distribution of \((\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1}, \tilde{Y}_{i2})\). I now show that this new data generating process, given by \((\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1}, \tilde{Y}_{i2})\), satisfies both (24 ) and (25 ).

I first show that the new data generating process satisfies (24 ). Since the joint distribution of \((Y_{i0}, Y_{i1})\) remains unchanged, it suffices to verify that, conditional on \((Y_{i0}=y_0, Y_{i1}=y_1)\), the distribution of \(\tilde{Y}_{i2}\) coincides with that of \(Y_{i2}\). By the definition of \(\tilde{Y}_{i2}\) in (28 ) and the law of iterated expectations, I obtain \[\begin{align} &\mathbb{P}(\tilde{Y}_{i2} \leq y_2 | Y_{i0}, Y_{i1}) \\ &= \mathbb{E}(\mathbb{P}(\tilde{Y}_{i2} \leq y_2 | Y_{i0}, Y_{i1}, \gamma_i, \beta_i, \tilde{\gamma}_i, \tilde{\beta}_i)|Y_{i0}, Y_{i1}) \\ &= \mathbb{E}(\mathbb{P}(Y_{i2} \leq y_2 | Y_{i0}, Y_{i1}, \gamma_i, \beta_i)|Y_{i0}, Y_{i1}) \\ &= \mathbb{P}(Y_{i2} \leq y_2 | Y_{i0}, Y_{i1}), \\ \end{align}\] which shows that (24 ) holds for the new process. Next, to show that the new data generating process also satisfies (25 ), note that in conditional expectations, conditioning on \((\gamma_i, \beta_i, \tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1})\) is equivalent to conditioning on \((\gamma_i, \beta_i, Y_{i0}, Y_{i1})\) because \((\tilde{\gamma}_i, \tilde{\beta}_i)\) is a deterministic function of \((\gamma_i, \beta_i, Y_{i0}, Y_{i1})\). Then, by the law of iterated expectations, the following shows that the first line of (25 ) holds for the new data generating process: \[\begin{align} &\mathbb{E}(Y_{i1} - \tilde{\gamma}_i - \tilde{\beta}_iY_{i0}|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}) \\ &=\mathbb{E}(\mathbb{E}(Y_{i1} - \tilde{\gamma}_i - \tilde{\beta}_iY_{i0}|\gamma_i, \beta_i, \tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1})|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}) \\ &=\mathbb{E}(\mathbb{E}(Y_{i1} - \tilde{\gamma}_i - \tilde{\beta}_iY_{i0}|\gamma_i, \beta_i, Y_{i0}, Y_{i1})|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}) \\ &=\mathbb{E}(\mathbb{E}(Y_{i1} - \tilde{\gamma}_i - \tilde{\beta}_iY_{i0}|\gamma_i, \beta_i, Y_{i0})|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}) \\ &=\mathbb{E}(\mathbb{E}(Y_{i1} - \gamma_i - \beta_iY_{i0} + (Y_{i1} - Y_{i0})k(\gamma_i,\beta_i,Y_{i0},Y_{i1})|\gamma_i, \beta_i, Y_{i0})|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}) \\ &=\mathbb{E}(0 + 0|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}) = 0, \\ \end{align}\] where the last line is obtained by the first line of (25 ) and by (26 ). Similarly, the following derivation shows that the second line of (25 ) holds for the new data generating process: \[\begin{align} &\mathbb{E}(\tilde{Y}_{i2} - \tilde{\gamma}_i - \tilde{\beta}_iY_{i1}|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1}) \\ &=\mathbb{E}(\mathbb{E}(\tilde{Y}_{i2} - \tilde{\gamma}_i - \tilde{\beta}_iY_{i1}|\gamma_i, \beta_i, \tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1})|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1}) \\ &=\mathbb{E}(\mathbb{E}(\tilde{Y}_{i2} - \tilde{\gamma}_i - \tilde{\beta}_iY_{i1}|\gamma_i, \beta_i, Y_{i0}, Y_{i1})|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1}) \\ &=\mathbb{E}(\mathbb{E}(Y_{i2} - \tilde{\gamma}_i - \tilde{\beta}_iY_{i1}|\gamma_i, \beta_i, Y_{i0}, Y_{i1})|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1}) \\ &=\mathbb{E}(\mathbb{E}(Y_{i2} - \gamma_i - \beta_iY_{i1} \\ &\qquad\qquad + Y_{i1}k(\gamma_i,\beta_i,Y_{i0},Y_{i1}) - Y_{i1}k(\gamma_i,\beta_i,Y_{i0},Y_{i1})|\gamma_i, \beta_i, Y_{i0}, Y_{i1})|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1}) \\ &=\mathbb{E}(\mathbb{E}(Y_{i2} - \gamma_i - \beta_iY_{i1} |\gamma_i, \beta_i, Y_{i0}, Y_{i1})|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1}) =\mathbb{E}(0|\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1}) = 0,\\ \end{align}\] where the second-last equality follows from the second line of (25 ).

In summary, I have shown that, given the function \(k\), \((\tilde{\gamma}_i, \tilde{\beta}_i, Y_{i0}, Y_{i1}, \tilde{Y}_{i2})\) is a new data generating process that satisfies (24 ) and (25 ). It now remains to specify the expression for \(k\). Among many possible choices for \(k\) that satisfy (26 ), I consider the following expression: \[k(r,b,y_0,y_1) = 1 - \frac{\mathbb{E}(Y_{i1}-Y_{i0}|\gamma_i=r,\beta_i=b,Y_{i0}=y_0)}{\mathbb{E}((Y_{i1}-Y_{i0})^2|\gamma_i=r,\beta_i=b,Y_{i0}=y_0)}(y_1-y_0).\] The following calculation shows that this choice of \(k\) satisfies (26 ): \[\begin{align} &\mathbb{E}((Y_{i1}-Y_{i0})k(\gamma_i,\beta_i,Y_{i0},Y_{i1})|\gamma_i,\beta_i,Y_{i0}) \\ &= \mathbb{E}\left(\left.(Y_{i1}-Y_{i0}) - \frac{\mathbb{E}(Y_{i1}-Y_{i0}|\gamma_i,\beta_i,Y_{i0})}{\mathbb{E}((Y_{i1}-Y_{i0})^2|\gamma_i,\beta_i,Y_{i0})}(Y_{i1}-Y_{i0})^2\right|\gamma_i,\beta_i,Y_{i0}\right) \\ &= \mathbb{E}(Y_{i1}-Y_{i0}|\gamma_i,\beta_i,Y_{i0}) - \mathbb{E}(Y_{i1}-Y_{i0}|\gamma_i,\beta_i,Y_{i0}) = 0. \end{align}\] Then, under this choice of \(k\), the expectation of \(\tilde{\beta}_i\) is calculated as \[\begin{align} \mathbb{E}(\tilde{\beta}_i) &= \mathbb{E}(\beta_i + k(\gamma_i,\beta_i,Y_{i0},Y_{i1})) \\ &= \mathbb{E}(\beta_i) + 1 - \mathbb{E}\left(\frac{\mathbb{E}(Y_{i1}-Y_{i0}|\gamma_i,\beta_i,Y_{i0})}{\mathbb{E}((Y_{i1}-Y_{i0})^2|\gamma_i,\beta_i,Y_{i0})}(Y_{i1}-Y_{i0})\right) \\ &= \mathbb{E}(\beta_i) + 1 - \mathbb{E}\left(\mathbb{E}\left(\left.\frac{\mathbb{E}(Y_{i1}-Y_{i0}|\gamma_i,\beta_i,Y_{i0})}{\mathbb{E}((Y_{i1}-Y_{i0})^2|\gamma_i,\beta_i,Y_{i0})}(Y_{i1}-Y_{i0})\right|\gamma_i,\beta_i,Y_{i0}\right)\right) \\ &= \mathbb{E}(\beta_i) + 1 - \mathbb{E}\left(\frac{\mathbb{E}(Y_{i1}-Y_{i0}|\gamma_i,\beta_i,Y_{i0})^2}{\mathbb{E}((Y_{i1}-Y_{i0})^2|\gamma_i,\beta_i,Y_{i0})}\right). \end{align}\] Note that, in the last term, the denominator is larger than the numerator because \[\mathbb{E}((Y_{i1}-Y_{i0})^2|\gamma_i,\beta_i,Y_{i0}) - \mathbb{E}(Y_{i1}-Y_{i0}|\gamma_i,\beta_i,Y_{i0})^2 = \text{Var}(Y_{i1}-Y_{i0}|\gamma_i,\beta_i,Y_{i0}) \geq 0,\] where equality holds if \(Y_{i1}-Y_{i0}\) has zero variance conditional on \((\gamma_i,\beta_i,Y_{i0})\), which is ruled out by the assumptions. Then, it follows that \[\mathbb{E}(\tilde{\beta}_i) = \mathbb{E}(\beta_i) + 1 - \mathbb{E}\left(\frac{\mathbb{E}(Y_{i1}-Y_{i0}|\gamma_i,\beta_i,Y_{i0})^2}{\mathbb{E}((Y_{i1}-Y_{i0})^2|\gamma_i,\beta_i,Y_{i0})}\right) > \mathbb{E}(\beta_i) + 1 - 1 = \mathbb{E}(\beta_i).\] This implies that \(\mathbb{E}(\tilde{\beta}_i)\) is strictly larger than \(\mathbb{E}(\beta_i)\), which completes the proof. \(~\square\)

Proof of Lemma 1. 3 in Online Appendix 10.3 implies that, if \(\mathbb{E}(\beta_i)\) is point-identified, then \[f^*(Y_{i0}, Y_{i1}, Y_{i2}) + g_1^*(\gamma_i, \beta_i, Y_{i0})\varepsilon_{i1} + g_2^*(\gamma_i, \beta_i, Y_{i0}, Y_{i1})\varepsilon_{i2} = \beta_i \label{eq46proof46pointid46lemma}\tag{29}\] almost surely for \((\gamma_i, \beta_i, Y_{i0}, Y_{i1}, Y_{i2}) \in \mathcal{C}\), where \(f^*\), \(g_1^*\) and \(g_2^*\) are linear functionals on the spaces of finite and countably additive signed Borel measures that are absolutely continuous with respect to the Lebesgue measure. Then (29 ) implies that \(S^*(Y_{i0}, Y_{i1}, Y_{i2}) = f^*(Y_{i0}, Y_{i1}, Y_{i2})\) since \[\mathbb{E}(f^*(Y_{i0}, Y_{i1}, Y_{i2})|\beta_i) = \mathbb{E}\left( \beta_i - g_1^*(\gamma_i, \beta_i, Y_{i0})\varepsilon_{i1} - g_2^*(\gamma_i, \beta_i, Y_{i0}, Y_{i1})\varepsilon_{i2}| \beta_i\right) = \beta_i.\]

Conversely, if there exists \(S^*(Y_{i0}, Y_{i1}, Y_{i2})\) satisfying \(\mathbb{E}(S^*(Y_{i0}, Y_{i1}, Y_{i2})|\beta_i) = \beta_i\), then \(\mathbb{E}(S^*(Y_{i0}, Y_{i1}, Y_{i2})) = \mathbb{E}(\mathbb{E}(S^*(Y_{i0}, Y_{i1}, Y_{i2})|\beta_i)) = \mathbb{E}(\beta_i)\), which completes the proof. \(~\square\)

Proof of Theorem 1. In essence, the proof follows the logic used to show the general result of 2. However, because 2 has not yet been introduced and 1 does not require the regularity assumption of 2, I present here a standalone proof of 1 under [ass.crc,ass.mean.nomulticollinearity].

Let \(\lambda \in \mathbb{R}\) and let \(\mu\) be a real vector that has the same dimension as \(R_{it}\). Then, define the function \[\mathcal{L}(\lambda,\mu,W_i,B_i) \equiv e'B_i + \mu' \sum_{t=1}^T R_{it}(Y_{it} - R_{it}'B_i) + \lambda \sum_{t=1}^T (R_{it}'B_i)(Y_{it} - R_{it}'B_i).\] Note that \(\mathbb{E}(\mathcal{L}) = \mathbb{E}(e'B_i)\) since \[\mathbb{E}(\mathcal{L}) = \mathbb{E}(e'B_i) + \mu' \sum_{t=1}^T \mathbb{E}(R_{it}(Y_{it} - R_{it}'B_i)) + \lambda \sum_{t=1}^T \mathbb{E}((R_{it}'B_i)(Y_{it} - R_{it}'B_i))\] and that the moment condition in (2 ) implies that \[\mathbb{E}(R_{it}(Y_{it} - R_{it}'B_i)) = 0 \quad\text{and}\quad\mathbb{E}((R_{it}'B_i)(Y_{it} - R_{it}'B_i)) = 0.\] Now, note that \[\mathbb{E}(e'B_i) = \mathbb{E}(\mathcal{L}(\lambda,\mu,W_i,B_i)) \leq \mathbb{E}(\max_b\mathcal{L}(\lambda,\mu,W_i,b)),\] since \(\mathcal{L}(\lambda,\mu,W_i,B_i) \leq \max_b\mathcal{L}(\lambda,\mu,W_i,b)\) almost surely. Then, since this inequality holds for all \((\lambda,\mu)\), it follows that \[\mathbb{E}(e'B_i) \leq \min_{\lambda,\mu}\mathbb{E}(\max_b\mathcal{L}(\lambda,\mu,W_i,b)),\] which implies that the right-hand side is an upper bound of \(\mathbb{E}(e'B_i)\). Similarly, it follows that \[\mathbb{E}(e'B_i) = \mathbb{E}(\mathcal{L}(\lambda,\mu,W_i,B_i)) \geq \mathbb{E}(\min_b\mathcal{L}(\lambda,\mu,W_i,b)),\] which then implies that \[\mathbb{E}(e'B_i) \geq \max_{\lambda,\mu}\mathbb{E}(\min_b\mathcal{L}(\lambda,\mu,W_i,b)),\] which implies that the right-hand side is a lower bound of \(\mathbb{E}(e'B_i)\). Therefore, in summary, I obtain \(L^* \leq \mathbb{E}(e'B_i) \leq U^*\) where \[L^* \equiv \max_{\lambda, ~\mu} \mathbb{E}\left( \min_{b}\left[ e'b + \mu' \sum_{t=1}^T R_{it}(Y_{it} - R_{it}'b) + \lambda \sum_{t=1}^T (R_{it}'b)(Y_{it} - R_{it}'b) \right] \right),\] and \[U^* \equiv \min_{\lambda, ~\mu} \mathbb{E}\left( \max_{b}\left[ e'b + \mu' \sum_{t=1}^T R_{it}(Y_{it} - R_{it}'b) + \lambda \sum_{t=1}^T (R_{it}'b)(Y_{it} - R_{it}'b) \right] \right).\] In what follows, I show that the closed-form expression for \(L^*\) and \(U^*\) coincide with those in 1. In the remainder of the proof, I focus on showing that the closed-form expression for \(U^*\) coincides with that in 1. The expression for \(L^*\) can be verified by a similar argument.

Now I derive the closed-form expression for \(U^*\). Using the matrix notations \(R_i\) and \(Y_i\), I can write \(U^*\) concisely as \[U^* = \min_{\mu, \lambda} \mathbb{E}\left( \max_{b}\left[ e'b + \mu' R_i'Y_i - \mu'R_i'R_ib + \lambda Y_i'R_ib - b'(\lambda R_i'R_i)b \right] \right).\] Here, the inner maximization problem optimizes a quadratic polynomial in \(b\), where \(-\lambda R_i'R_i\) is the leading coefficient matrix. Note that if \(\lambda >0\), then by 2, the matrix \(-\lambda R_i'R_i\) is negative definite, in which case this quadratic polynomial attains a finite closed-form maximum at the solution to the first-order condition with respect to \(b\). On the other hand, if \(\lambda \leq 0\), the polynomial’s maximum diverges to \(+\infty\) unless \(R_i'R_i\) has a zero eigenvalue, which is ruled out by 2. Consequently, a finite upper bound is obtained only for \(\lambda > 0\), and I can write \(U^*\) as: \[U^* = \min_{\mu, \lambda > 0} \mathbb{E}\left( \max_{b}\left[ e'b + \mu' R_i'Y_i - \mu'R_i'R_ib + \lambda Y_i'R_ib - b'(\lambda R_i'R_i)b \right] \right).\] Now, for \(\lambda >0\), I can solve for the closed-form maximum of the quadratic polynomial in \(b\). The first-order condition with respect to \(b\) yields \[e - R_i'R_i\mu + \lambda R_i'Y_i - 2(\lambda R_i'R_i)b = 0 \quad\Rightarrow\quad b^* = \frac{1}{2}(\lambda R_i'R_i)^{-1}(e + \lambda R_i'Y_i - R_i'R_i\mu).\] Plugging this solution back into the expression for \(U^*\) yields: \[\min_{\lambda > 0, ~\mu} \mathbb{E}\left( \mu' R_i'Y_i + \frac{1}{4\lambda}\left[ e + \lambda R_i'Y_i - R_i'R_i\mu \right]'(R_i'R_i)^{-1} \left[ e + \lambda R_i'Y_i - R_i'R_i\mu \right] \right). \label{eq46proof46closedform}\tag{30}\] I solve this problem with respect to \(\mu\) for a fixed \(\lambda\). The first-order condition with respect to \(\mu\) given \(\lambda\) is: \[\mathbb{E}(R_i'Y_i) + \frac{1}{2\lambda}\mathbb{E}(R_i'R_i)\mu - \frac{1}{2\lambda}e - \frac{1}{2}\mathbb{E}(R_i'Y_i) = 0.\] The optimal \(\mu\) that solves this first-order condition is \(\mu^* = \mathbb{E}(R_i'R_i)^{-1}[e - \lambda\mathbb{E}(R_i'Y_i)]\). I substitute this into (30 ) and then solve the resulting expression with respect to \(\lambda\). The first-order condition with respect to \(\lambda\) is: \[\frac{1}{\lambda^2}\left[e'\mathbb{E}((R_i'R_i)^{-1})e - e'\mathbb{E}(R_i'R_i)^{-1}e\right] = \mathbb{E}(R_i'Y_i'(R_i'R_i)^{-1}R_i'Y_i) - \mathbb{E}(R_i'Y_i)'\mathbb{E}(R_i'R_i)^{-1}\mathbb{E}(R_i'Y_i).\] Since \(\lambda > 0\), the optimal \(\lambda\) that satisfies this first-order condition is: \[\lambda^* = \sqrt{\frac{e'\mathbb{E}((R_i'R_i)^{-1})e - e'\mathbb{E}(R_i'R_i)^{-1}e}{\mathbb{E}(R_i'Y_i'(R_i'R_i)^{-1}R_i'Y_i) - \mathbb{E}(R_i'Y_i)'\mathbb{E}(R_i'R_i)^{-1}\mathbb{E}(R_i'Y_i)}}. \label{eq46proof46closedform46optlambda}\tag{31}\] Substituting (31 ) back into (30 ) yields the expression for \(U\) in 1.

The numerator and denominator in (31 ) are both weakly positive, and each is equal to zero if and only if \((R_i'R_i)^{-1}e\) and \((R_i'R_i)^{-1}R_i'Y_i\) are degenerate across individuals, respectively. To show this, one can apply the following proposition to the functions \(E(R_i'R_i) = e'(R_i'R_i)^{-1}e\) and \(D(R_i'Y_i, R_i'R_i) = (R_i'Y_i)'(R_i'R_i)^{-1}R_i'Y_i\). \(~\square\)

Proposition 8 ([54], Lemma 3.2). For an integer \(l > 0\), let \(A_1, \ldots, A_l\) be \(n \times m\) matrices and \(B_1, \ldots, B_l\) be nonsingular positive definite and symmetric \(n \times n\) matrices. Let \(a_1, \ldots, a_l\) be positive real numbers such that \(\sum_k a_k = 1\). Then \[\sum_{k=1}^l a_k A_k'B_k^{-1}A_k - \left[\sum_{k=1}^l a_k A_k\right]'\left[\sum_{k=1}^l a_k B_k\right]^{-1}\left[\sum_{k=1}^l a_k A_k\right] \geq 0\] where ‘\(\geq\)’ is the partial ordering defined in terms of positive semidefinite matrices. In addition, the equality holds if and only if \(B_1^{-1}A_1 = \ldots = B_l^{-1}A_l\).

Proof of Proposition 2. I first show that \(\mathcal{V}_S\) is invertible, for which I show that \(\mathcal{V}_S\) is positive definite, i.e., \[x'S_iR_i(R_i'R_i)^{-1}R_i'S_i'x > 0\] with positive probability for every nonzero \(x\).

Note first that 3 implies \(R_i'S_i'x \neq 0\) with positive probability for every nonzero \(x\). Note also that 2 implies that \((R_i'R_i)^{-1}\) is positive definite, meaning that \(y'(R_i'R_i)^{-1}y > 0\) for any nonzero vector \(y\). Now, for every nonzero \(x\), define \(y_i = R_i'S_i'x\). Then \(y_i \neq 0\) with positive probability, and it follows that \[x'S_iR_i(R_i'R_i)^{-1}R_i'S_i'x = y_i'(R_i'R_i)^{-1}y_i > 0\] with positive probability. This proves that \(\mathcal{V}_S\) is positive definite, and thus invertible.

Now I prove the remainder of 2. Following the proof of 1, let \(\lambda \in \mathbb{R}\) and let \(\mu_t\) be a real vector that has the same dimension as \(S_{it}\), and define the function \[\begin{align} \mathcal{L} &\equiv e'B_i + \sum_{t=1}^T \mu_t'S_{it}(Y_{it} - R_{it}'B_i) + \lambda \sum_{t=1}^T (R_{it}'B_i)(Y_{it} - R_{it}'B_i) \\ &= e'B_i + \mu'S_i(Y_i-R_iB_i) + \lambda B_i'R_i'(Y_i-R_iB_i), \end{align}\] where \(\mu = (\mu_1', \mu_2', \ldots, \mu_T')\) is a real vector that attaches all \(\mu_t\) vectors into a single vector. Then, following the proof of 1, \(L_S \leq \mathbb{E}(e'B_i) \leq U_S\) where \[L_S \equiv \max_{\mu, \lambda} \mathbb{E}\left( \min_{b}\left[ e'b + \mu'S_i(Y_i-R_ib) + \lambda b'R_i'(Y_i-R_ib) \right] \right),\] and \[U_S \equiv \min_{\mu, \lambda} \mathbb{E}\left( \max_{b}\left[ e'b + \mu'S_i(Y_i-R_ib) + \lambda b'R_i'(Y_i-R_ib) \right] \right).\] In what follows, I show that the closed-form expression for \(L_S\) and \(U_S\) coincide with those in 2. In the remainder of the proof, I focus on showing that the closed-form expression for \(U_S\) coincides with that in 2. The expression for \(L_S\) can be verified by a similar argument.

Now I derive the closed-form expression for \(U_S\). I first rewrite \(U_S\) as \[U_S = \min_{\mu, \lambda} \mathbb{E}\left( \max_{b}\left[ \mu'S_iY_i + (e + \lambda R_i'Y_i - R_i'S_i'\mu)'b - b'\left(\lambda R_i'R_i\right)b \right] \right).\] The inner maximization problem of \(U_S\) optimizes a quadratic polynomial in \(b\), where \(-\lambda R_i'R_i\) is the leading coefficient matrix. Note that if \(\lambda >0\), then by 2, this matrix is negative definite, in which case the quadratic polynomial attains a finite closed-form maximum. On the other hand, if \(\lambda \leq 0\), the polynomial’s maximum diverges to \(+\infty\) unless \(R_i'R_i\) has a zero eigenvalue, which is ruled out by 2. Consequently, a finite upper bound is obtained only for \(\lambda > 0\), and I can write \(U_S\) as: \[U_S = \min_{\mu, \lambda > 0} \mathbb{E}\left( \max_{b}\left[ \mu'S_iY_i + (e + \lambda R_i'Y_i - R_i'S_i'\mu)'b - b'\left(\lambda R_i'R_i\right)b \right] \right).\] Now, for \(\lambda >0\), I can solve for the closed-form maximum of the quadratic polynomial in \(b\). The first order condition with respect to \(b\) yields \[e + \lambda R_i'Y_i - R_i'S_i'\mu - 2(\lambda R_i'R_i)b = 0 \quad\Rightarrow\quad b^* = \frac{1}{2}(\lambda R_i'R_i)^{-1}\left(e + \lambda R_i'Y_i - R_i'S_i'\mu\right).\] Plugging this solution back into the expression for \(U_S\) yields: \[\min_{\lambda > 0, ~\mu} \mathbb{E}\left( \mu'S_iY_i + \frac{1}{4\lambda}\left[ e + \lambda R_i'Y_i - R_i'S_i'\mu \right]'(R_i'R_i)^{-1} \left[ e + \lambda R_i'Y_i - R_i'S_i'\mu \right] \right). \label{eq46proof46closedform46corollary}\tag{32}\] I solve this problem with respect to \(\mu\) for a fixed \(\lambda\). The first-order condition with respect to \(\mu\) given \(\lambda\) is: \[\mathbb{E}(S_iY_i) - \frac{1}{2\lambda}\mathbb{E}\left(S_iR_i(R_i'R_i)^{-1} \left[ e + \lambda R_i'Y_i - R_i'S_i'\mu \right]\right) = 0.\] The optimal \(\mu\) that solves this first-order condition is \[\mu^* = \mathbb{E}(S_iR_i(R_i'R_i)^{-1}R_i'S_i')^{-1}\left[ \mathbb{E}(S_iR_i(R_i'R_i)^{-1})e + \lambda\left( \mathbb{E}(S_iR_i(R_i'R_i)^{-1}R_i'Y_i) - 2\mathbb{E}(S_iY_i) \right) \right]\] which I can write concisely as, using the notation from the main text: \[\mu^* = \mathcal{V}_S^{-1}\left[ \mathcal{P}_Se + \lambda\left( \mathcal{Y}_S - 2Y_S \right) \right].\] I now substitute this into (32 ). First, expand (32 ) and obtain \[\begin{align} \min_{\lambda > 0, ~\mu} \Big\{\mu'Y_S + \frac{1}{4\lambda}\Big[ &e'\mathbb{E}((R_i'R_i)^{-1})e + \lambda^2 m_0 + \mu'\mathcal{V}_S\mu \\ &+ 2\lambda e'\mathbb{E}(\widehat{B}_i) -2e'\mathcal{P}_S'\mu - 2\lambda \mathcal{Y}_S'\mu \Big] \Big\}, \end{align}\] where I used the notation from the main text to write it concisely. I then substitute the expression for \(\mu^*\) into the above, obtaining: \[\begin{align} \min_{\lambda > 0} \Big\{Y_S'&\mathcal{V}_S^{-1}\left[ \mathcal{P}_Se + \lambda\left( \mathcal{Y}_S - 2Y_S \right) \right] \\ + \frac{1}{4\lambda}\Big[ &e'\mathbb{E}((R_i'R_i)^{-1})e + \lambda^2 m_0 + \left[ \mathcal{P}_Se + \lambda\left( \mathcal{Y}_S - 2Y_S \right) \right]'\mathcal{V}_S^{-1}\left[ \mathcal{P}_Se + \lambda\left( \mathcal{Y}_S - 2Y_S \right) \right] \\ + &2\lambda e'\mathbb{E}(\widehat{B}_i) -2e'\mathcal{P}_S'\mathcal{V}_S^{-1}\left[ \mathcal{P}_Se + \lambda\left( \mathcal{Y}_S - 2Y_S \right) \right] - 2\lambda \mathcal{Y}_S'\mathcal{V}_S^{-1}\left[ \mathcal{P}_Se + \lambda\left( \mathcal{Y}_S - 2Y_S \right) \right] \Big] \Big\}. \end{align}\] Expanding this expression and collecting terms with respect to \(\lambda\) yields the expression: \[\begin{align} \min_{\lambda > 0} \Big\{ &\frac{1}{4\lambda}[e'\mathbb{E}((R_i'R_i)^{-1})e-e'\mathcal{P}_S'\mathcal{V}_S^{-1}\mathcal{P}_Se] + \frac{\lambda}{4}[m_0-(\mathcal{Y}_S-2Y_S)'\mathcal{V}_S^{-1}(\mathcal{Y}_S-2Y_S)] \\ &+ \frac{1}{2}[2e'\mathcal{P}_S'\mathcal{V}_S^{-1}Y_S + e'\mathbb{E}(\widehat{B}_i)-e'\mathcal{P}_S'\mathcal{V}_S^{-1}\mathcal{Y}_S]\Big\}. \end{align}\] The first order condition with respect to \(\lambda\) then yields \[\lambda^* = \sqrt{\frac{e'\mathbb{E}((R_i'R_i)^{-1})e-e'\mathcal{P}_S'\mathcal{V}_S^{-1}\mathcal{P}_Se}{m_0-(\mathcal{Y}_S-2Y_S)'\mathcal{V}_S^{-1}(\mathcal{Y}_S-2Y_S)}}.\] Substituting this expression yields the expression for \(U_S\) in 2. \(~\square\)

Proof of Proposition 3. I first show that \(\mathcal{V}_M - M_0\) is invertible. Note that \[\mathcal{V}_M - M_0 = \mathbb{E}(M_i'R_i(R_i'R_i)^{-1}R_i'M_i) - \mathbb{E}(M_i'M_i) = \mathbb{E}(M_i'(R_i(R_i'R_i)^{-1}R_i' - I)M_i).\] Since \(R_i(R_i'R_i)^{-1}R_i'\) is a projection matrix, \(R_i(R_i'R_i)^{-1}R_i' - I\) is negative semidefinite. For every nonzero \(x\), define \(y_i = M_ix\). Then, by 5, \(y_i\) is not in the column space of \(R_i\) with positive probability. This implies that \[x'M_i'(R_i(R_i'R_i)^{-1}R_i' - I)M_ix = y_i'(R_i(R_i'R_i)^{-1}R_i' - I)y_i < 0\] with positive probability. Therefore, its expectation \(\mathcal{V}_M - M_0\) is negative definite and thus invertible.

Next, I show that \(\mathcal{V}\) is invertible. First, as shown in the proof of 2, \(\mathcal{V}_S\) is positive definite under [ass.mean.nomulticollinearity.constant,ass.mean.nomulticollinearity.s.constant]. I have also shown that \(\mathcal{V}_M - M_0\) is negative definite, which implies that \(-(\mathcal{V}_M - M_0)\) is positive definite. Therefore, the quantity \(\mathcal{V}_S - (C - \mathcal{C})(\mathcal{V}_M - M_0)(C - \mathcal{C})'\) is positive definite and thus invertible.

Now I prove the remainder of 3. Following the proof of 2, let \(\lambda \in \mathbb{R}\) and let \(\mu_t\) be a real vector that has the same dimension as \(S_{it}\). For a fixed value of \(\delta\), define the function \[\begin{align} \mathcal{L}(\delta) &\equiv e'B_i + \sum_{t=1}^T \mu_t'S_{it}(Y_{it} - R_{it}'B_i - M_{it}'\delta) + \lambda \sum_{t=1}^T (R_{it}'B_i+M_{it}'\delta)(Y_{it} - R_{it}'B_i-M_{it}'\delta) \\ &= e'B_i + \mu'S_i(Y_i-R_iB_i - M_i\delta) + \lambda (B_i'R_i'+\delta'M_i')(Y_i-R_iB_i-M_i\delta), \end{align}\] where \(\mu = (\mu_1', \mu_2', \ldots, \mu_T')\) is a real vector that attaches all \(\mu_t\) vectors into a single vector. Then, following the proof of 1, \(L_M(\delta) \leq \mathbb{E}(e'B_i) \leq U_M(\delta)\) where \[L_M(\delta) \equiv \max_{\mu, \lambda} \mathbb{E}\left( \min_{b}\left[ e'b + \mu'S_i(Y_i-R_ib-M_i\delta) + \lambda (b'R_i'+\delta'M_i')(Y_i-R_ib-M_i\delta) \right] \right),\] and \[U_M(\delta) \equiv \min_{\mu, \lambda} \mathbb{E}\left( \max_{b}\left[ e'b + \mu'S_i(Y_i-R_ib-M_i\delta) + \lambda (b'R_i'+\delta'M_i')(Y_i-R_ib-M_i\delta) \right] \right).\] Then, an outer bound of \(\mathbb{E}(e'B_i)\) is obtained by taking the union of \([L_M(\delta), U_M(\delta)]\) over all \(\delta \in \mathbb{R}^{q_m+p_m}\) (rather than over all admissible \(\delta\) only). In other words, it follows that \(L_M \leq \mathbb{E}(e'B_i) \leq U_M\) where \[L_M = \min_{\delta \in \mathbb{R}^{q_m+p_m}} L_M(\delta), \quad\text{and}\quad U_M = \max_{\delta \in \mathbb{R}^{q_m+p_m}}U_M(\delta).\] In what follows, I show that the closed-form expression for \(L_M\) and \(U_M\) coincide with those in 3. In the remainder of the proof, I focus on showing that the closed-form expression for \(U_M\) coincides with that in 3. The expression for \(L_S\) can be verified by a similar argument.

Now I derive the closed-form expression for \(U_M\), for which I first derive the closed-form expression for \(U_M(\delta)\). For a fixed \(\delta\), the inner maximization problem of \(U_M(\delta)\) optimizes a quadratic polynomial in \(b\), where \(-\lambda R_i'R_i\) is the leading coefficient matrix. Note that if \(\lambda >0\), then by 5, this matrix is negative definite, in which case the quadratic polynomial attains a finite closed-form maximum. On the other hand, if \(\lambda \leq 0\), the polynomial’s maximum diverges to \(+\infty\) unless \(R_i'R_i\) has a zero eigenvalue, which is ruled out by 5. Consequently, a finite upper bound is obtained only for \(\lambda > 0\). Then, for \(\lambda >0\), I solve for the first order condition with respect to \(b\) and substitute the solution back into \(U_M(\delta)\), which yields \[\begin{align} &U_M(\delta) = \min_{\lambda > 0, ~\mu} \mathbb{E}\Big(\mu'S_iY_i - \mu'S_iM_i\delta + \lambda\delta'M_i'Y_i - \lambda \delta'M_i'M_i\delta \\ &\qquad + \frac{1}{4\lambda}\left[ e - R_i'S_i'\mu + \lambda R_i'Y_i - 2\lambda R_i'M_i\delta \right]'(R_i'R_i)^{-1} \left[ e - R_i'S_i'\mu + \lambda R_i'Y_i - 2\lambda R_i'M_i\delta \right] \Big). \end{align} \label{eq46proof46closedform46corollary46constant}\tag{33}\] I then expand the terms in (33 ), which yields the expression \[\begin{align} U_M(\delta) = \min_{\lambda > 0, ~\mu} &\Big\{\mu'Y_S - \mu'C\delta + \lambda\delta'Y_M - \lambda\delta' M_0\delta \\ &+\frac{1}{4\lambda}e'\mathbb{E}((R_i'R_i)^{-1})e + \frac{\lambda}{4}m_0 + \frac{1}{4\lambda}\mu'\mathcal{V}_S\mu + \lambda \delta'\mathcal{V}_M\delta \\ &+ \frac{1}{2} e'\mathbb{E}(\widehat{B}_i) -\frac{1}{2\lambda}e'\mathcal{P}_S'\mu - \frac{1}{2} \mathcal{Y}_S'\mu - \delta'\mathcal{P}_Me - \lambda\delta'\mathcal{Y}_M + \mu'\mathcal{C}\delta \Big\}. \end{align}\] Let \(L(\lambda,\mu,\delta)\) be the objective function of the above, so that \(U_M(\delta) = \min_{\lambda > 0, ~\mu}L(\lambda,\mu,\delta)\). Then I can write \[U_M = \max_{\delta} U_M(\delta) = \max_{\delta}\min_{\lambda > 0, ~\mu} L(\lambda,\mu,\delta).\] I note two properties about \(L(\lambda,\mu,\delta)\). First, it can be shown that \(L(\lambda,\mu,\delta)\) is convex in \((\lambda,\mu)\), which I state later as 4. Second, \(L(\lambda,\mu,\delta)\) is a quadratic polynomial in \(\delta\), where the leading coefficient matrix is \(\lambda (\mathcal{V}_M - M_0)\). Since \(\lambda > 0\) and \(\mathcal{V}_M - M_0\) is negative definite, this implies that \(L(\lambda,\mu,\delta)\) is concave in \(\delta\). These two properties then imply: \[U_M = \max_{\delta}\min_{\lambda > 0, ~\mu} L(\lambda,\mu,\delta) = \min_{\lambda > 0, ~\mu} \max_{\delta} L(\lambda,\mu,\delta).\] Now I solve for the latter expression. I first solve \(L(\lambda,\mu,\delta)\) with respect to \(\delta\) for a fixed \((\lambda, \mu)\). The optimal \(\delta\) that solves the first order condition is \[\delta^* = -\frac{1}{2\lambda}(\mathcal{V}_M - M_0)^{-1}\left( \lambda (Y_M - \mathcal{Y}_M) - C'\mu - \mathcal{P}_Me + \mathcal{C}'\mu \right).\] I then substitute this into \(L(\lambda,\mu,\delta)\), which yields the following expression for \(U_M\): \[\begin{align} &\min_{\lambda > 0, ~\mu} \Big\{\mu'Y_S +\frac{1}{4\lambda}e'\mathbb{E}((R_i'R_i)^{-1})e + \frac{\lambda}{4}m_0 + \frac{1}{4\lambda}\mu'\mathcal{V}_S\mu + \frac{1}{2} e'\mathbb{E}(\widehat{B}_i) -\frac{1}{2\lambda}e'\mathcal{P}_S'\mu - \frac{1}{2} \mathcal{Y}_S'\mu - \\ &~~\frac{1}{4\lambda} \left( \lambda (Y_M - \mathcal{Y}_M) - C'\mu - \mathcal{P}_Me + \mathcal{C}'\mu \right)'(\mathcal{V}_M - M_0)^{-1}\left( \lambda (Y_M - \mathcal{Y}_M) - C'\mu - \mathcal{P}_Me + \mathcal{C}'\mu \right) \Big\}. \end{align}\] Next, I solve this expression with respect to \(\mu\) for a fixed \(\lambda > 0\). The optimal \(\mu\) that solves the first order condition is \[\mu^* = \mathcal{V}^{-1}\left[ \mathcal{P}_Se + \lambda\mathcal{Y}_S - 2\lambda Y_S + (C-\mathcal{C})(\mathcal{V}_M - M_0)^{-1}(\mathcal{P}_Me + \lambda \mathcal{Y}_M - \lambda Y_M ) \right].\] I substitute this expression back into the above expression for \(U_M\), obtaining: \[U_M = \min_{\lambda > 0} \left( \frac{\lambda}{4}\mathcal{D}_M + \mathcal{B}_M + \frac{1}{4\lambda}\mathcal{E}_M \right),\] where \(\mathcal{D}_M\), \(\mathcal{B}_M\), and \(\mathcal{E}_M\) are as defined in 3. The first order condition with respect to \(\lambda\) then yields \[\lambda^* = \sqrt{\frac{\mathcal{E}_M}{\mathcal{D}_M}}.\] Substituting this expression yields the expression for \(U_M\) in 3. \(~\square\)

Proof of Theorem 2. In what follows, I show that (14 ) is the dual representation of (13 ). The proof is a direct application of the duality theorem for linear programming over topological vector spaces [55]. The same argument applies to (15 ).

To apply the theorem, I first rewrite (13 ) into a standard form of linear programming, for which I introduce additional notation. Recall that \(\mathcal{M}_{W \times B}\) is a linear space of finite and countably additive signed Borel measures on \(\mathcal{W} \times \mathcal{B}\). Let \(\overline{\mathcal{F}}_{W \times B}\) be the dual space of \(\mathcal{M}_{W \times B}\), and let \(\mathcal{F}_{W \times B}\) be the space of all bounded Borel measurable functions on \(\mathcal{W} \times \mathcal{B}\). Note that \(\mathcal{F}_{W \times B}\) is a linear subspace of \(\overline{\mathcal{F}}_{W \times B}\).

For \(P \in \mathcal{M}_{W \times B}\) and \(f \in \overline{\mathcal{F}}_{W \times B}\), define the dual pairing \[\langle P, f \rangle = \int fdP.\] Similarly, let \(\mathcal{M}_{W}\) be the linear space of finite and countably additive signed Borel measures on \(\mathcal{W}\). Let \(\overline{\mathcal{F}}_{W}\) be the dual space of \(\mathcal{M}_{W}\), and let \(\mathcal{F}_{W}\) be the space of all bounded Borel measurable functions on \(\mathcal{W}\). Note that \(\mathcal{F}_{W}\) is a linear subspace of \(\overline{\mathcal{F}}_{W}\). In addition, define \(\mathcal{G} = \mathbb{R}^K \times \mathcal{M}_{W}\) and \(\mathcal{H} = \mathbb{R}^K \times \overline{\mathcal{F}}_{W}\), and let \(g = (g_1, \ldots, g_K, P_g)\) and \(h=(\lambda_1, \ldots, \lambda_K, f_h)\) be their generic elements. Note that \(\mathcal{H}\) is the dual space of \(\mathcal{G}\). Define the dual pairing \[\langle g, h \rangle = \sum_{k=1}^K \lambda_k g_k + \int f_h dP_g.\]

Next, define a linear map \(A: \mathcal{M}_{W \times B} \mapsto \mathcal{G}\) by \[A(P) = \left( \int \phi_1 dP, \ldots, \int \phi_K dP, P(\cdot, \mathcal{B}) \right).\] Since each \(\phi_k\) is bounded, \(A\) is a bounded (thus continuous) linear operator. Moreover, note that \[\langle A(P), h \rangle = \sum_{k=1}^K \lambda_k \int \phi_k dP + \int_{\mathcal{W}} f_h(w) P(dw, \mathcal{B}).\] It is straightforward to show that \[\int_{\mathcal{W}} f_h(w) P(dw, \mathcal{B}) = \int_{\mathcal{W} \times \mathcal{B}} f_h(w) dP(w,v).\] Then I obtain \[\langle A(P), h \rangle = \sum_{k=1}^K \lambda_k \int \phi_k dP + \int f_h dP = \int \left[ \sum_{k=1}^K \lambda_k \phi_k + f_h \right] dP \equiv \langle P, A^*(h) \rangle, \label{eq46proof46adjoint}\tag{34}\] where \(A^*(h): \mathcal{H} \mapsto \overline{\mathcal{F}}_{W \times B}\) is defined as \[A^*(h) = \sum_{k=1}^K \lambda_k \phi_k + f_h.\] Equation (34 ) shows that \(A^*\) is the adjoint of \(A\). With these notations, I rewrite (13 ) as a standard form of linear programming: \[\min_{P \in \mathcal{M}_{W \times V}} \langle P, m \rangle \qquad\text{subject to}\qquad A(P) = c, \qquad P \geq 0, \label{eq46proof46primal}\tag{35}\] where \(c = (0, \ldots, 0, P_W)\). I now apply the duality theorem to (35 ), where I verify the conditions for the duality theorem later in the proof. The dual problem of (35 ) is given by: \[\max_{h \in \mathcal{H}} \langle c, h \rangle \qquad\text{subject to}\qquad m - A^*(h) \geq 0,\] which I can write more concretely as: \[\max_{\lambda_1, \ldots, \lambda_K \in \mathbb{R}, ~ f_h \in \overline{\mathcal{F}}_W} \int f_h dP_W \qquad\text{subject to}\qquad \sum_{k=1}^K \lambda_k \phi_k + f_h \leq m. \label{eq46proof46dual}\tag{36}\] I now simplify (36 ) further. I rearrange the constraint of (36 ): \[f_h(w) \leq m(w,b) - \sum_{k=1}^K \lambda_k \phi_k(w,b).\] The left-hand side does not involve \(v\). Therefore: \[f_h(w) \leq \min_{b \in \mathcal{B}} \left[ m(w,b) - \sum_{k=1}^K \lambda_k \phi_k(w,b) \right] \quad \text{for all} \quad w \in \mathcal{W}.\] Since (36 ) maximizes the expectation of \(f_h\), the optimal solution \(f_h^*\) for a fixed \((\lambda_1, \ldots, \lambda_K)\) is given by: \[f_h^*(w) = \min_{b \in \mathcal{B}} \left[ m(w,b) - \sum_{k=1}^K \lambda_k \phi_k(w,b) \right] \label{eq46proof46dual46solution}\tag{37}\] almost surely in \(P_W\). If not, i.e., if \(f_h^*(w)\) is strictly less than the right-hand side of (37 ) with positive probability in \(P_W\), then one can increase the value of the objective by increasing \(f_h^*\) on a set of positive probability. I then substitute (37 ) into (36 ), which yields: \[\max_{\lambda_1, \ldots, \lambda_K \in \mathbb{R}} \int \min_{b \in \mathcal{B}} \left[ m(w,b) - \sum_{k=1}^K \lambda_k \phi_k(w,b) \right] dP_W(w).\] The above display remains equivalent even if the signs of \((\lambda_1, \ldots, \lambda_K)\) are switched, because they are choice variables supported on \(\mathbb{R}^K\). Switching the signs of \((\lambda_1, \ldots, \lambda_K)\) then gives: \[\max_{\lambda_1, \ldots, \lambda_K \in \mathbb{R}} \int \min_{b \in \mathcal{B}} \left[ m(w,b) + \sum_{k=1}^K \lambda_k \phi_k(w,b) \right] dP_W(w) \label{eq46proof46dual46simple}\tag{38}\] which is exactly the expression in (14 ).

It remains to verify that the conditions for the duality theorem holds, so that the optimal value of the primal problem in (35 ) equals to that of the dual problem in (38 ). Note that, by the assumptions, the dual problem in (38 ) attains a finite maximum value, which I denote by \(L\). Then, since the set \(\{P \in \mathcal{M}_{W \times V} ~|~ P \geq 0\}\) is closed in \(\mathcal{M}_{W \times V}\), the sufficient conditions for Theorem 4 in [55] are satisfied. This theorem then implies that the primal problem in (35 ) attains its minimum value at \(L\), and thus strong duality holds. Note that Theorem 4 in [55] requires that the dual problem has a sequence of choice variables \((\lambda_1, \ldots, \lambda_K)\) whose objective function values converge to the optimal value \(L\), which trivially holds if the optimal value \(L\) is attained. \(~\square\)

Proof of Proposition 4. This proof shows that \(G_L\) is concave in \(\lambda\). The proof for the convexity of \(G_U\) is similar. Let \(\lambda_1 = (\lambda_{11}, \ldots, \lambda_{1K})\) and \(\lambda_2 = (\lambda_{21}, \ldots, \lambda_{2K})\) be two arbitrary points in \(\mathbb{R}^K\). Then, for any \(t \in [0,1]\) and \(w \in \mathcal{W}\): \[\begin{align} & G_L(t\lambda_1+(1-t)\lambda_2, w) \\ &= \min_{b \in \mathcal{B}} \left\{ t\left[m(w, b) + \sum_{k=1}^{K}\lambda_{1k} \phi_k(w, b)\right] + (1-t)\left[m(w, b) + \sum_{k=1}^{K}\lambda_{2k} \phi_k(w, b)\right] \right\} \\ &\geq t \min_{b \in \mathcal{B}} \left\{m(w, b) + \sum_{k=1}^{K}\lambda_{1k} \phi_k(w, b)\right\} + (1-t) \min_{b \in \mathcal{B}} \left\{ m(w, b) + \sum_{k=1}^{K}\lambda_{2k} \phi_k(w, b) \right\} \\ &= tG_L(\lambda_1, w) + (1-t)G_L(\lambda_2, w), \end{align}\] which is the definition of concavity. \(~\square\)

Proof of Lemma 2. As stated in (36 ) in the proof of 2, the sharp lower bound of \(\theta\) is given by \[\max_{\lambda_1, \ldots, \lambda_K \in \mathbb{R}, ~ f_h \in \overline{\mathcal{F}}_W} \int f_h dP_W \qquad\text{subject to}\qquad \sum_{k=1}^K \lambda_k \phi_k + f_h \leq m \label{eq46proof46lemma46lb}\tag{39}\] where all notations follow the proof of 2. Similarly, the sharp upper bound of \(\theta\) is given by \[\min_{\lambda_1, \ldots, \lambda_K \in \mathbb{R}, ~ f_h \in \overline{\mathcal{F}}_W} \int f_h dP_W \qquad\text{subject to}\qquad \sum_{k=1}^K \lambda_k \phi_k + f_h \geq m. \label{eq46proof46lemma46ub}\tag{40}\]

Suppose, by the way of contradiction, that \(\theta\) is point-identified but there do not exist \(S^* \in \overline{\mathcal{F}}_W\) and \(\lambda_1^*, \ldots, \lambda_K^* \in \mathbb{R}\) such that, almost surely: \[\sum_{k=1}^K \lambda_k^* \phi_k + S^* = m.\] Then the optimal solution \((\lambda_1^l, \ldots, \lambda_K^l, S^l)\) to (39 ) must satisfy its constraint \(\sum_{k=1}^K \lambda_k^l \phi_k + S^l \leq m\) with strict inequality on a set of positive Lebesgue measure on \(\mathcal{W} \times \mathcal{B}\). Similarly, the optimal solution \((\lambda_1^u, \ldots, \lambda_K^u, S^u)\) to (40 ) must satisfy its constraint \(\sum_{k=1}^K \lambda_k^u \phi_k + S^u \geq m\) with strict inequality on a set of positive Lebesgue measure on \(\mathcal{W} \times \mathcal{B}\). Then it follows that: \[\mathbb{E}(S^l) = \mathbb{E}\left( \sum_{k=1}^K \lambda_k^l \phi_k + S^l \right) < \mathbb{E}(m) < \mathbb{E}\left( \sum_{k=1}^K \lambda_k^u \phi_k + S^u \right) = \mathbb{E}(S^u)\] where strict inequalities follow because the density of \((W_i, B_i)\) is strictly positive. This implies that the sharp lower bound \(\mathbb{E}(S^l)\) is strictly less than the sharp upper bound \(\mathbb{E}(S^u)\), which is a contradiction since \(\theta\) is assumed to be point-identified.

Conversely, suppose there exists \((S^*, \lambda_1^*, \ldots, \lambda_K^*)\) such that \(\sum_{k=1}^K \lambda_k^* \phi_k + S^* = m\). Then: \[\mathbb{E}(S^*) = \mathbb{E}\left(\sum_{k=1}^K \lambda_k \phi_k + S^*\right) = \mathbb{E}(m) = \theta,\] which shows that \(\theta\) is point-identified by \(\mathbb{E}(S^*)\). \(~\square\)

10 Online Appendix: Extensions and Discussions↩︎

10.1 Extension to multivariate random coefficient models↩︎

Results from this paper extend to a multivariate version of (1 ), a system of random coefficient models: \[\mathbf{Y}_{it} = \mathbf{Z}_{it}'\gamma_i + \mathbf{X}_{it}'\beta_i + \mathbf{e}_{it},\] where \(\mathbf{Y}_{it}\) is a \(D \times 1\) vector of dependent variables, \(\mathbf{Z}_{it}\) is a \(D \times q\) matrix of strictly exogenous regressors, \(\mathbf{X}_{it}\) is a \(D \times p\) matrix of sequentially exogenous regressors, and \(\mathbf{e}_{it}\) is a \(D \times 1\) vector of idiosyncratic error terms. Assume that \[\mathbb{E}(\mathbf{e}_{it}|\gamma_i, \beta_i, \mathbf{Z}_{i}, \mathbf{X}_{i}^t) = 0,\] which is a multivariate extension of (2 ). The following is an example of a multivariate random coefficient model.

Example 4 (Joint model of household earnings and consumption behavior).

One can combine (3 ) and (4 ) to construct a joint lifecycle model of earnings and consumption behavior. In particular, when the time \(t\) consumption equation is combined with the time \(t+1\) earnings equation, a system of random coefficient models is obtained: \[\begin{align} C_{it} &= \gamma_{i1} + \gamma_{i2}Y_{it} + \beta_{i1}A_{it} + \nu_{it}, \\ Y_{i,t+1} &= \gamma_{i3} + \beta_{i2}Y_{it} + \varepsilon_{it}, \end{align}\] which can be written in the following matrix form: \[\left(\begin{array}{c} C_{it} \\ Y_{i,t+1} \end{array}\right) = \left(\begin{array}{ccc} 1 & Y_{it} & 0 \\ 0 & 0 & 1 \end{array}\right)\left(\begin{array}{c} \gamma_{i1} \\ \gamma_{i2} \\ \gamma_{i3} \end{array}\right) + \left(\begin{array}{cc} A_{it} & 0 \\ 0 & Y_{it} \end{array}\right)\left(\begin{array}{c} \beta_{i1} \\ \beta_{i2} \end{array}\right) + \left(\begin{array}{c} \nu_{it} \\ \varepsilon_{it} \end{array}\right).\] In this model, the \(\gamma_i\)s and \(\beta_i\)s can freely correlate among themselves and with \((Y_{i0}, A_{i1})\), allowing for correlation between earnings and consumption processes.

10.2 Alternative proof of Proposition 1↩︎

This proof is an application of the general result in Online Appendix 10.3. Suppose that the regularity conditions stated as 13 in Online Appendix 10.3 hold. Also, for notational simplicity, suppose that \(\mathcal{C} = \mathcal{C}_0^5\), where \(\mathcal{C}_0\) is a compact subset of \(\mathbb{R}\). The proof can be easily modified for a generic compact set \(\mathcal{C}\).

Assume that \(\mathbb{E}(\beta_i)\) is point-identified, from which I derive a contradiction. 3 in Online Appendix 10.3 implies that, if \(\mathbb{E}(\beta_i)\) is point-identified, then: \[f^*(Y_{i0}, Y_{i1}, Y_{i2}) + g_1^*(\gamma_i, \beta_i, Y_{i0})\varepsilon_{i1} + g_2^*(\gamma_i, \beta_i, Y_{i0}, Y_{i1})\varepsilon_{i2} = \beta_i \label{eq46proof46pointid}\tag{41}\] almost surely in \((\gamma_i, \beta_i, Y_{i0}, Y_{i1}, Y_{i2})\), where \(f^* : \mathcal{C}_0^3 \mapsto \mathbb{R}\), \(g_1^* : \mathcal{C}_0^3 \mapsto \mathbb{R}\) and \(g_2^* : \mathcal{C}_0^4 \mapsto \mathbb{R}\) are linear functionals on the spaces of finite and countably additive signed Borel measures that are absolutely continuous with respect to the Lebesgue measure. Substituting \(\varepsilon_{it} = Y_{it} - \gamma_i - \beta_iY_{i,t-1}\) in (41 ) yields, almost surely in \((\gamma_i, \beta_i, Y_{i0}, Y_{i1}, Y_{i2})\), \[f^*(Y_{i0}, Y_{i1}, Y_{i2}) + g_1^*(\gamma_i, \beta_i, Y_{i0})(Y_{i1}-\gamma_i-\beta_i Y_{i0}) + g_2^*(\gamma_i, \beta_i, Y_{i0}, Y_{i1})(Y_{i2}-\gamma_i-\beta_iY_{i1}) = \beta_i. \label{eq46proof46pointid46substitute}\tag{42}\]

Now, consider any \(\gamma, \tilde{\gamma}, \beta, y_0, y_1, y_2 \in \mathcal{C}_0\) such that \(\gamma \neq \tilde{\gamma}\). I then evaluate (42 ) at \((\gamma_i, \beta_i, Y_{i0}, Y_{i1}, Y_{i2}) = (\gamma, \beta, y_0, y_1, y_2)\) and at \((\tilde{\gamma}, \beta, y_0, y_1, y_2)\) and take the difference between the two. This yields: \[\begin{align} & (y_1-\tilde{\gamma}-\beta y_0)\triangle_{\tilde{\gamma},\gamma} g_1^* - (\tilde{\gamma}-\gamma)g_1^*(\gamma, \beta, y_0) \\ &+ (y_2-\tilde{\gamma}-\beta y_1)\triangle_{\tilde{\gamma},\gamma} g_2^* - (\tilde{\gamma}-\gamma)g_2^*(\gamma, \beta, y_0, y_1) = 0 \end{align} \label{eq46proof46diff1}\tag{43}\] where \(\triangle_{\tilde{\gamma},\gamma} g_1^* \equiv g_1^*(\tilde{\gamma}, \beta, y_0) - g_1^*(\gamma, \beta, y_0)\) and \(\triangle_{\tilde{\gamma},\gamma} g_2^* \equiv g_2^*(\tilde{\gamma}, \beta, y_0, y_1) - g_2^*(\gamma, \beta, y_0, y_1)\).

In (43 ), note that the variable \(y_2\) appears only in the third term. In addition, (43 ) must hold almost surely for all \(\gamma, \tilde{\gamma}, \beta, y_0, y_1, y_2 \in \mathcal{C}_0\) such that \(\gamma \neq \tilde{\gamma}\), and in particular for any choice of \(y_2 \in \mathcal{C}_0\). This implies that the third term must not depend on \(y_2\), which implies that, almost surely: \[\triangle_{\tilde{\gamma},\gamma} g_2^* = 0,\] which means that \(g_2^*\) is almost surely a constant function on \(\gamma\): \[g_2^*(\gamma, \beta, y_0, y_1) = g_2^*(\beta, y_0, y_1). \label{eq46proof46diff146sol46conclusion}\tag{44}\] If not, i.e., if \(\triangle_{\tilde{\gamma},\gamma} g_2^* \neq 0\) on a subset of \(\mathcal{C}_0^6\) with positive Lebesgue measure, one can change the value of \(y_2\) without altering \((\gamma, \tilde{\gamma}, \beta, y_0, y_1)\) within that subset to violate (43 ) on a set of a positive measure.

Next, consider any \(\gamma, \beta, \tilde{\beta}, y_0, y_1, y_2 \in \mathcal{C}_0\) such that \(\beta \neq \tilde{\beta}\). I then evaluate (42 ) at \((\gamma, \beta, y_0, y_1, y_2)\) and \((\gamma, \tilde{\beta}, y_0, y_1, y_2)\) and take the difference between the two. This yields: \[\begin{align} & (y_1-\gamma-\tilde{\beta} y_0)\triangle_{\tilde{\beta},\beta} g_1^* - (\tilde{\beta}-\beta)y_0g_1^*(\gamma, \beta, y_0) \\ &+ (y_2-\gamma-\tilde{\beta} y_1)\triangle_{\tilde{\beta},\beta} g_2^* - (\tilde{\beta}-\beta)y_1g_2^*(\beta, y_0, y_1) = \tilde{\beta} - \beta \end{align} \label{eq46proof46diff2}\tag{45}\] where \(\triangle_{\tilde{\beta},\beta} g_1^* \equiv g_1^*(\gamma, \tilde{\beta}, y_0) - g_1^*(\gamma, \beta, y_0)\) and \(\triangle_{\tilde{\beta},\beta} g_2^* = g_2^*(\tilde{\beta}, y_0, y_1) - g_2^*(\beta, y_0, y_1)\). In (45 ), note that \(y_2\) appears only in the third term. This implies \(g_2^*(\beta, y_0, y_1) = g_2^*(y_0, y_1)\) almost surely, similarly to the argument leading to (44 ). Then (43 ) simplifies to: \[(y_1-\tilde{\gamma}-\beta y_0)\triangle_{\tilde{\gamma},\gamma} g_1^* - (\tilde{\gamma}-\gamma)g_1^*(\gamma, \beta, y_0) - (\tilde{\gamma}-\gamma)g_2^*(y_0, y_1) = 0. \label{eq46proof46diff146simple}\tag{46}\] Let \(\gamma, \tilde{\gamma}, \hat{\gamma} \in \mathcal{C}_0\) be such that \(\hat{\gamma} - \tilde{\gamma} = \tilde{\gamma} - \gamma\). I then evaluate (46 ) at \((\gamma, \tilde{\gamma}, \beta, y_0, y_1)\) and \((\tilde{\gamma}, \hat{\gamma}, \beta, y_0, y_1)\) and take the difference between the two. This yields: \[(y_1-\hat{\gamma}-\beta y_0)\left(\triangle_{\hat{\gamma},\tilde{\gamma}} g_1^* - \triangle_{\tilde{\gamma},\gamma} g_1^*\right) - (\hat{\gamma} - \tilde{\gamma})\triangle_{\tilde{\gamma},\gamma} g_1^* - (\tilde{\gamma}-\gamma)\triangle_{\tilde{\gamma},\gamma} g_1^* = 0. \label{eq46proof46diff11}\tag{47}\] In (47 ), note that \(y_1\) appears only in the first term, which implies \(\triangle_{\hat{\gamma},\tilde{\gamma}} g_1^* - \triangle_{\tilde{\gamma},\gamma} g_1^* = 0\) almost surely, similarly to the argument leading to (44 ). Then (47 ) simplifies to: \[(\hat{\gamma} - \tilde{\gamma})\triangle_{\tilde{\gamma},\gamma} g_1^* + (\tilde{\gamma}-\gamma)\triangle_{\tilde{\gamma},\gamma} g_1^* = 0, \label{eq46proof46diff1146conclusion}\tag{48}\] which implies \(\triangle_{\tilde{\gamma},\gamma} g_1^* = 0\) since \(\hat{\gamma} - \tilde{\gamma} = \tilde{\gamma} - \gamma \neq 0\). This implies that \(g_1^*\) is almost surely a constant function over \(\gamma\), i.e., \(g_1^*(\gamma, \beta, y_0) = g_1^*(\beta, y_0)\). Then (45 ) simplifies to: \[\begin{align} & (y_1-\gamma-\tilde{\beta} y_0)\triangle_{\tilde{\beta},\beta} g_1^* - (\tilde{\beta}-\beta)y_0g_1^*(\beta, y_0) \\ &+ (y_2-\gamma-\tilde{\beta} y_1)\triangle_{\tilde{\beta},\beta} g_2^* - (\tilde{\beta}-\beta)y_1g_2^*(y_0, y_1) = \tilde{\beta} - \beta. \end{align} \label{eq46proof46diff246simple}\tag{49}\] Let \(\beta, \tilde{\beta}, \hat{\beta} \in \mathcal{C}_0\) be such that \(\hat{\beta} - \tilde{\beta} = \tilde{\beta} - \beta\). Evaluating (49 ) at \((\gamma, \hat{\beta}, \tilde{\beta}, y_0, y_1, y_2)\) and at \((\gamma, \tilde{\beta}, \beta, y_0, y_1, y_2)\) and taking the difference yields \(g_1^*(\beta, y_0) = g_1^*(y_0)\), similarly to the argument leading to \(g_1^*(\gamma, \beta, y_0) = g_1^*(\beta, y_0)\) from (47 ). Then (42 ) simplifies to: \[f^*(y_0, y_1, y_2) + g_1^*(y_0)(y_1-\gamma-\beta y_0) + g_2^*(y_0, y_1)(y_2-\gamma-\beta y_1) = \beta\] almost surely for all \((\gamma,\beta,y_0,y_1,y_2)\). This is a linear identity in \((\gamma, \beta)\), so the coefficients of \(\gamma\) and \(\beta\) must match on both sides of the equation. In particular, equating the coefficients on \(\gamma\) implies that \(-g_1^* - g_2^* = 0\), and equating the coefficients on \(\beta\) implies \(-y_0 g_1^* - y_1 g_2^* = 1\). Solving these two equations for \((g_1^*, g_2^*)\) yields, almost surely: \[g_1^* = \frac{1}{y_1-y_0}, \quad g_2^* = \frac{-1}{y_1-y_0}.\] However, \(g_1^*\) cannot be a function of \(y_1\), which is a contradiction. \(~\square\)

10.3 Identification under conditional moment restrictions↩︎

This subsection studies moment equality models that incorporate both conditional and unconditional moment restrictions. Consider the following extension of 7.

Assumption 12. The random vectors \((W_i, B_i)\) satisfy: \[\begin{align} \mathbb{E}(\phi_k(W_i, B_i)) &= 0, \quad k=1, \ldots, K_U, \\ \mathbb{E}(\psi_k(W_i, B_i) | A_{ik}) &= 0, \quad k=1, \ldots, K_C, \end{align}\] where \(\phi_k, \psi_k : \mathcal{W} \times \mathcal{B} \mapsto \mathbb{R}\) are moment functions, \(A_{i1}, \ldots, A_{iK_C}\) are subvectors of \((W_i, B_i)\), and \(K_U,K_C \in \mathbb{N}\) are the number of unconditional and conditional moment restrictions, respectively.

Under 12, I characterize the identified set of \[\theta = \mathbb{E}(m(W_i, B_i))\] for some known function \(m:\mathcal{W} \times \mathcal{B} \mapsto \mathbb{R}\). For brevity of notation, let \(A_{ik}'\) be the subvector of \((W_i, B_i)\) collecting the variables not included in \(A_{ik}\) so that \((A_{ik}, A_{ik}')\) is a rearrangement of \((W_i, B_i)\). Accordingly, any function \(f(w,b)\) on \(\mathcal{W} \times \mathcal{B}\) can be equivalently written as \(f(a_k, a_k')\) on \(\mathcal{A}_k \times \mathcal{A}_k'\), where \(\mathcal{A}_k \times \mathcal{A}_k'\) is the rearrangement of \(\mathcal{W} \times \mathcal{B}\) according to \((A_{ik}, A_{ik}')\). I assume the following regularity conditions.

Assumption 13. The following conditions hold.

  • \(\mathcal{W} \times \mathcal{B}\) is a compact set in a Euclidean space.

  • \((m, \phi_1, \ldots, \phi_{K_U}, \psi_1, \ldots, \psi_{K_C})\) are \(L^\infty\) with respect to the Lebesgue measure.

  • The distribution of \((W_i, B_i)\) is absolutely continuous with respect to the Lebesgue measure, and its density \(p\) is \(L^\infty\) with respect to the Lebesgue measure.

  • There exists a joint density \(p_0\) of \((W_i, B_i)\) such that it satisfies 12, its marginal density with respect to \(W_i\) equals to the observed density of \(W_i\), and it is strictly positive on \(\mathcal{W} \times \mathcal{B}\).

13 (i) and (ii) are similar to 8. 13 (iii) and (iv) are restrictive, but they are useful enough for 1 and an alternative proof of 1 in Online Appendix 10.2. Under these assumptions, I obtain the following theorem and lemma, which are counterparts of 2 and 2, respectively, by characterizing the identified set \(I\) of \(\theta\) and providing a necessary and sufficient condition for point identification of \(\theta\).

Theorem 3. Suppose that either of these two conditions hold:

  1. [ass.appendix.gmm,ass.appendix.regularity] (i)-(iii) hold, and the optimization problems \[L = \max_{\{\lambda_k\}_{k=1}^{K_U}, \{\mu_k\}_{k=1}^{K_C}} \mathbb{E}\left[ \min_{b \in \mathcal{B}} \left\{ m(W_i, b) + \sum_{k=1}^{K_U}\lambda_k \phi_k(W_i, b) + \sum_{k=1}^{K_C}\mu_k(A_k(W_i, b))\psi_k(W_i, b)\right\} \right] \label{eq46appendix46lb}\tag{50}\] and \[U = \min_{\{\lambda_k\}_{k=1}^{K_U}, \{\mu_k\}_{k=1}^{K_C}} \mathbb{E}\left[ \max_{b \in \mathcal{B}} \left\{ m(W_i, b) + \sum_{k=1}^{K_U}\lambda_k \phi_k(W_i, b) + \sum_{k=1}^{K_C}\mu_k(A_k(W_i, b))\psi_k(W_i, b)\right\} \right] \label{eq46appendix46ub}\tag{51}\] possess finite solutions, where \(\lambda_k \in \mathbb{R}\) for \(k=1, \ldots, K_U\) and \(\mu_k : \mathcal{A}_k \mapsto \mathbb{R}\) for \(k=1, \ldots, K_C\), and \(A_k(w,b)\) denotes the value of \(A_{ik}\) given \(W_i =w\) and \(B_i = b\).

  2. [ass.appendix.gmm,ass.appendix.regularity] (i)-(iv) hold.

If either (A) or (B) holds, then \(I = [L,U]\).

Proof. The proof focuses on showing (50 ). The same argument applies to (51 ).

Let \(\mathcal{M}_{W \times B}\) be the space of finite and countably additive signed Borel measures that are absolutely continuous with respect to the Lebesgue measure. Using absolute continuity, I identify each element of \(\mathcal{M}_{W \times B}\) by its density \(p : \mathcal{W} \times \mathcal{B} \mapsto \mathbb{R}\). Let \(p_W\) be the density of the observed data distribution \(P_W\). Then, the identified set \(I\) is defined by \[\begin{align} I \equiv \left\{ \int m(w, b) p(w,b) \right.& d(w,b) ~\Big|~ p \in \mathcal{M}_{W \times B}, \quad p \geq 0, \\ & \int \phi_k(w, b) p(w,b)d(w,b) = 0, \quad k=1, \ldots, K_U, \\ & \int \psi_k(a_k, a_k') p(a_k, a_k') da_k' = 0 ~\text{for all } a_k \in \mathcal{A}_k, \quad k=1, \ldots, K_C,\\ & \left. \int p(w, b)db = p_W(w) ~\text{ for all } w \in \mathcal{W} \right\}, \end{align}\] where \(a_k\) is an element of \(\mathcal{A}_k\) and \(a_k'\) is an element of \(\mathcal{A}_k'\). The second line above represents the unconditional moment restrictions, while the third line represents the conditional moment restrictions.

The lower bound of \(I\) is then given by the infinite-dimensional linear program \[\begin{align} \min_{p \in \mathcal{M}_{W \times B}, ~p \geq 0} \int & m(w, b) p(w,b) d(w,b) \qquad\text{subject to}\qquad\\ & \int \phi_k(w, b) p(w,b) d(w,b) = 0, \quad k=1, \ldots, K_U, \\ & \int \psi_k(a_k, a_k') p(a_k, a_k') da_k' = 0, ~\text{for all } a_k \in \mathcal{A}_k, \quad k=1, \ldots, K_C, \\ & \int p(w, b)db = p_W(w) ~\text{ for all } w \in \mathcal{W}. \end{align} \label{eq46appendix46primal}\tag{52}\]

Now I show that (50 ) is the dual representation of (52 ), by directly applying the duality theorem of linear programming for topological vector spaces [55], for which I introduce additional notation. Let \(L^2(\mathcal{W} \times \mathcal{B})\) be the space of all \(L^2\) functions on \(\mathcal{W} \times \mathcal{B}\), and let \(L^2(\mathcal{W})\) be the space of all \(L^2\) functions on \(\mathcal{W}\). I also let \(L^2(\mathcal{A}_k)\) be the space of all \(L^2\) functions on \(\mathcal{A}_k\).

Define \(\mathcal{G}\) and \(\mathcal{H}\) as \(\mathcal{G} = \mathcal{H} = \mathbb{R}^K \times L^2(\mathcal{A}_1) \times \ldots \times L^2(\mathcal{A}_{K_C}) \times L^2(\mathcal{W})\). I denote their generic elements as \(g = (g_1, \ldots, g_{K_U}, \overline{g}_1, \ldots, \overline{g}_{K_C}, f_g)\) and \(h=(\lambda_1, \ldots, \lambda_{K_U}, \mu_1, \ldots, \mu_{K_C}, f_h)\), respectively. Note that \(\mathcal{H}\) is a dual space of \(\mathcal{G}\).

Define a linear map \(A: \mathcal{M}_{W \times B} \mapsto \mathcal{G}\) by \[A(p) = \left( \int \phi_1 p~d(w,b), \ldots, \int \phi_K p~d(w,b), \int \psi_k p~da_1', \ldots, \int \psi_k p~da_{K_C}', \int p~db \right).\] The map \(A\) is a bounded (thus continuous) linear operator because the functions \(\phi_k\) and \(\psi_k\) are assumed to be bounded. Next, define the dual pairing as \[\langle A(P), h \rangle = \sum_{k=1}^{K_U} \lambda_k \int \phi_k p~d(w,vb) + \sum_{k=1}^{K_C} \iint \psi_k p ~da_k'~ \mu_k da_k + \int f_h \int p db dw.\] It is straightforward to show that \[\iint \psi_k p ~da_k'~ \mu_k da_k = \int \psi_k \mu_k p ~ d(w,b)\] and \[\int f_h \int p db dw = \int f_h p ~ d(w,b).\] Then, I obtain \[\langle A(P), h \rangle = \int \left[\sum_{k=1}^{K_U} \lambda_k \phi_k + \sum_{k=1}^{K_C} \mu_k \psi_k + f_h \right] p(w,b) d(w,b) \equiv \langle p, A^*(h) \rangle, \label{eq46appendix46adjoint}\tag{53}\] where \(A^*(h): \mathcal{H} \mapsto L^2(\mathcal{W} \times \mathcal{B})\) is defined as \[A^*(h) = \sum_{k=1}^{K_U} \lambda_k \phi_k + \sum_{k=1}^{K_C} \mu_k \psi_k + f_h.\] Equation (53 ) shows that \(A^*\) is the adjoint of \(A\).

Then, similar to the proof of 2, I apply the strong duality theorem of linear programming for topological vector spaces to (52 ). Under the conditions of (A), I apply Theorem 4 of [55], similarly to the proof of 2. Under the conditions of (B), I use Theorem 9 of [55]. The sufficient conditions for this Theorem 9 are satisfied as follows. First, 13 (iv) verifies the condition that “there is \(x_0\) in the interior of \(P\) with \(Ax_0 = b\)” in Theorem 9 of [55]. Second, 13 (i)-(iii) ensures that the primal problem in (52 ) possesses a finite solution, which verifies the condition that “EP has finite value” in Theorem 9 of [55]. In addition, its implicit condition that \(A\) is continuous is also satisfied.

Consequently, under either conditions of (A) or (B), the strong duality holds. Therefore, the optimal solution to (52 ) is equal to the solution to \[\max_{\lambda_1, \ldots, \lambda_{K_U}, \mu_1, \ldots, \mu_{K_C}, f_h} \int f_h(w) p_w(w) dw \qquad\text{subject to}\qquad\sum_{k=1}^{K_U} \lambda_k \phi_k + \sum_{k=1}^{K_C} \mu_k \psi_k + f_h \leq m. \label{eq46appendix46dual}\tag{54}\] Then, simplifying (54 ) as in the proof of 2 yields the expression in (50 ). ◻

Lemma 3. Suppose that the conditions (B) of 3 hold. Then \(\theta\) is point-identified if and only if there exists a function \(S^*\) which is a linear functional on \(\mathcal{M}_{W}\) (which is the projection of \(\mathcal{M}_{W \times B}\) onto \(\mathcal{W}\)), real numbers \(\lambda_1^*, \ldots, \lambda_{K}^* \in \mathbb{R}\), and functions \(\mu_1^*, \ldots, \mu_K^*\) which are \(L^2(\mathcal{A}_1), \ldots, L^2(\mathcal{A}_{K_C})\) functions, respectively, such that: \[m(W_i, b) + \sum_{k=1}^{K_U}\lambda_k \phi_k(W_i, b) + \sum_{k=1}^{K_C}\mu_k(A_k(W_i, b))\psi_k(W_i, b) = S^*(W_i)\] almost surely on \(\mathcal{W} \times \mathcal{B}\). When such \(S^*\) exists, \(\theta\) is identified by \(\theta = \mathbb{E}(S^*(W_i))\).

Proof. As in (54 ) in the proof of 3, the sharp lower bound of \(\theta\) is given by \[\max_{\lambda_1, \ldots, \lambda_{K_U}, \mu_1, \ldots, \mu_{K_C}, f_h} \int f_h(w) p_w(w) dw \qquad\text{subject to}\qquad\sum_{k=1}^{K_U} \lambda_k \phi_k + \sum_{k=1}^{K_C} \mu_k \psi_k + f_h \leq m,\] where all notation follows the proof of 3. Similarly, the sharp upper bound of \(\theta\) is given by \[\min_{\lambda_1, \ldots, \lambda_{K_U}, \mu_1, \ldots, \mu_{K_C}, f_h} \int f_h(w) p_w(w) dw \qquad\text{subject to}\qquad\sum_{k=1}^{K_U} \lambda_k \phi_k + \sum_{k=1}^{K_C} \mu_k \psi_k + f_h \geq m.\] 3 then follows by replicating the argument in the proof of 2. ◻

10.4 Identified set for a general variance parameter↩︎

In this subsection, I consider identification of a general variance parameter. Recall the dynamic random coefficient model defined in (1 ) and (2 ): \[Y_{it} = R_{it}'B_i + \varepsilon_{it}, \qquad \mathbb{E}(\varepsilon_{it}|B_i, Z_i, X_i^t) = 0, \qquad t=1, \ldots, T,\] where \(R_{it} = (Z_{it}', X_{it}')'\). I consider the second moments of the random coefficients: \[V_e = \mathbb{E}(e_1'B_iB_i'e_2)\] where \(e_1\) and \(e_2\) are real-valued vectors that the researcher chooses. For example, if \(e_1 = e_2 = (1,0,\ldots,0)'\), then \(V_e\) is the second moment of the first entry of \(B_i\).

The key idea for identifying the mean in 3 is to consider a moment condition that is quadratic in \(B_i\) so that it can “dominate” the linear term \(e'B_i\). By the same idea, to “dominate” the term \(e_1'B_iB_i'e_2\), I consider a moment condition that is fourth order in \(B_i\). Specifically, I consider the moment restrictions \[\mathbb{E}\left(\sum_{t=1}^T (R_{it}'B_i)^3\varepsilon_{it}\right) = 0, \quad\text{and}\quad\mathbb{E}\left(S_{it}\varepsilon_{it}\right) = 0 \quad\text{for}\quad t=1, \ldots, T, \label{eq46orthogonal46variance}\tag{55}\] where I replaced the first moment restriction in (11 ) with a fourth order restriction in \(B_i\). A direct application of 2 then yields the following bounds for \(V_e\), which I state without proof.

Proposition 9. Suppose that [ass.crc,ass.mean.nomulticollinearity,ass.mean.nomulticollinearity.s,ass.proof.regularity] hold, and that Equation (55 ) holds. Then \(L_V \leq V_e \leq U_V\) where \[L_V = \max_{\lambda > 0, ~\mu \in \mathbb{R}^L} \mathbb{E}\left[ \min_{b \in \mathcal{B}} \left\{ e_1'bb'e_2 + \lambda \sum_{t=1}^T (R_{it}'b)^3(Y_{it} - R_{it}'b) + \mu'S_i(Y_i - R_ib) \right\} \right],\] and \[U_V = \min_{\lambda < 0, ~\mu \in \mathbb{R}^L} \mathbb{E}\left[ \max_{b \in \mathcal{B}} \left\{ e_1'bb'e_2 + \lambda \sum_{t=1}^T (R_{it}'b)^3(Y_{it} - R_{it}'b) + \mu'S_i(Y_i - R_ib) \right\} \right].\]

In 9, the optimization over \(b\) requires global optimization of a fourth-order polynomial, for which no closed-form solution exists. Instead, this problem can be solved numerically using the semidefinite relaxation approach [56], [57], which transforms the polynomial optimization problem into a convex optimization problem over a variable that is a semidefinite matrix.

10.5 Overidentification in the general inference procedure↩︎

In this subsection, I discuss a simple heuristic modification of the general inference procedure in 5.2 that practically deals with the overidentification, assuming that the model is correctly specified. Note that this heuristic method may yield spuriously narrow confidence intervals for \(\theta\) even if the model is partially identified. This occurs because the procedure does not formally account for overidentification or misspecification as in [15] and [43]. Nonetheless, I check the performance of the heuristic procedure via simulation at the end of this subsection, and I find that it achieves reasonable coverage rates.

I first note that the inference procedure of [16] is still implementable under overidentification, since \(T_{AS}(\theta)\) and \(c_{AS,GMS}^{(b)}(\theta)\) can still be computed for each fixed \(\theta\). The practical difficulty, however, is that the finite-sample optimizers \(\hat{\lambda}_N^L\) and \(\hat{\lambda}_N^U\) diverge, making it hard to search for the supremum in the neighborhoods of \(\hat{\lambda}_N^L\) and \(\hat{\lambda}_N^U\). To resolve this issue, I propose to compute the finite-sample optimizers with \(L^1\) penalties: \[\begin{align} \tilde{\lambda}_N^L(\zeta) &= \max_{\lambda \in \mathbb{R}^K} \left[ \frac{1}{N}\sum_{i=1}^N G_L(\lambda, W_i) - \zeta\sum_{k \in K_0} |\lambda_k| \right], \\ \tilde{\lambda}_N^U(\zeta) &= \min_{\lambda \in \mathbb{R}^K} \left[ \frac{1}{N}\sum_{i=1}^N G_U(\lambda, W_i) + \zeta\sum_{k \in K_0} |\lambda_k| \right], \end{align} \label{eq46inf46pen46bounds}\tag{56}\] where \(\zeta > 0\) is the penalty parameter and \(K_0 \subseteq \{1, \ldots, K\}\) is the index set of the penalized moment restrictions. In practice, one may simply take \(K_0 = \{1, \ldots, K\}\).

This modification has the following econometric interpretation. For \(\zeta \geq 0\), consider the following relaxation of the moment conditions: \[\mathbb{E}(\phi_k(W_i, B_i)) = 0 \text{ for all } k \notin K_0 \quad\text{and}\quad |\mathbb{E}(\phi_k(W_i, B_i))| \leq \zeta \text{ for all } k \in K_0, \label{eq46relaxation}\tag{57}\] which reduces to 7 if \(\zeta = 0\). This is similar in spirit to the minimally relaxed identified set in [43]. The following proposition then characterizes the smallest \(\zeta \geq 0\) for which the finite sample satisfies the relaxed moment restrictions in (57 ), therefore resolving the overidentification issue.

Proposition 10. Given the sample \((W_1, \ldots, W_N)\), consider the linear program \[\begin{align} \min_{P \in \mathcal{M}_{W \times B}, ~P \geq 0, ~\zeta \geq 0} \zeta \qquad\text{subject to}\qquad & \left|\int \phi_k(W_i, B_i) dP\right| \leq \zeta, \quad k \in K_0, \\ & \int \phi_k(W_i, B_i) dP = 0, \quad k \notin K_0, \\ & \int P(w, dB_i) = \hat{P}_W(w) ~\text{ for all } w \in \mathcal{W}, \end{align} \label{eq46minimumDistance46primal}\qquad{(1)}\] where \(\hat{P}_W\) is the empirical distribution of \(W_i\) constructed from \((W_1, \ldots, W_N)\). Then, under 8, its solution equals to the solution to: \[\max_{\lambda \in \mathbb{R}^K} \frac{1}{N}\sum_{i=1}^N \min_{b \in \mathcal{B}} \left\{ \sum_{k=1}^{K}\lambda_k \phi_k(W_i, b) \right\} \qquad\text{subject to}\qquad\sum_{k \in K_0} |\lambda_k| \leq 1. \label{eq46minimumDistance}\qquad{(2)}\]

Proof. I can rewrite (?? ) as: \[\begin{align} \min_{P \in \mathcal{M}_{W \times B}, ~P \geq 0, ~\zeta \geq 0} \zeta \qquad\text{subject to}\qquad & \int \phi_k(W_i, B_i) dP \leq \zeta, \quad k \in K_0, \\ & \int \phi_k(W_i, B_i) dP \geq -\zeta, \quad k \in K_0, \\ & \int \phi_k(W_i, B_i) dP = 0, \quad k \notin K_0, \\ & \int P(w, dB_i) = \hat{P}_W(w) ~\text{ for all } w \in \mathcal{W}, \end{align}\] Then, similarly to the proof of 2, I can invoke the dualty theorem with inequality constraints [55] to obtain (?? ) as the simplified dual representation of (?? ). ◻

Let \(\zeta^*\) be the solution to (?? ). Then, for any \(\zeta \geq \zeta^*\), it follows that the estimated bounds for \(\theta\) under the \(\zeta\)-relaxed moment restrictions in (57 ) are given by the \(L^1\)-penalized optimizations. The following proposition shows this result for the lower bound. The result for the upper bound holds similarly.

Proposition 11. Given the sample \((W_1, \ldots, W_N)\) and given \(\zeta \in \mathbb{R}\), consider the linear program that finds the smallest value of \(\theta = \mathbb{E}(m(W_i, B_i))\) that satisfies (57 ): \[\begin{align} \min_{P \in \mathcal{M}_{W \times B}, ~P \geq 0} \int m(W_i, B_i) dP \qquad\text{subject to}\qquad & \left|\int \phi_k(W_i, B_i) dP\right| \leq \zeta, \quad k \in K_0, \\ & \int \phi_k(W_i, B_i) dP = 0, \quad k \notin K_0, \\ & \int P(w, db) = \hat{P}_W(w) ~\text{ for all } w \in \mathcal{W}, \end{align} \label{eq46lb46est46pen46primal}\qquad{(3)}\] where \(\hat{P}_W\) is the empirical distribution of \(W_i\) constructed from \((W_1, \ldots, W_N)\). Then, under 8, its solution equals to \[\tilde{L} = \max_{\lambda \in \mathbb{R}^K} \left[ \frac{1}{N}\sum_{i=1}^N G_L(\lambda, W_i) - \zeta\sum_{k \in K_0} |\lambda_k| \right]. \label{eq46lb46est46pen}\qquad{(4)}\]

Proof. I can rewrite (?? ) as: \[\begin{align} \min_{P \in \mathcal{M}_{W \times B}, ~P \geq 0} \int m(W_i, B_i) dP \qquad\text{subject to}\qquad & \int \phi_k(W_i, B_i) dP \leq \zeta, \quad k \in K_0, \\ & \int \phi_k(W_i, B_i) dP \geq -\zeta, \quad k \in K_0, \\ & \int \phi_k(W_i, B_i) dP = 0, \quad k \notin K_0, \\ & \int P(w, db) = \hat{P}_W(w) ~\text{ for all } w \in \mathcal{W}. \end{align}\] Then, similarly to the proof of 2, I can invoke the dualty theorem with inequality constraints [55] to obtain (?? ) as the simplified dual representation of (?? ). ◻

11 implies that the \(L^1\)-penalized finite sample optimizers \(\tilde{\lambda}_N^L(\zeta)\) and \(\tilde{\lambda}_N^U(\zeta)\) defined in (56 ) are precisely the maximizer in (?? ) for the lower bound and and the corresponding minimizer for the upper bound. I then implement the procedure of [16] with a modification that I restrict the supremum to be calculated over the neighborhoods of \(\tilde{\lambda}_N^L(\zeta)\) and \(\tilde{\lambda}_N^U(\zeta)\) rather than the entire \(Q^K\) space of \(\lambda\). Note that, if the supremum were taken over all of \(Q^K\), both \(T_{AS}(\theta)\) and \(c_{AS,GMS}^{(b)}(\theta)\) would all diverge. As overidentification is resolved as \(N \rightarrow \infty\), the supremum over \(Q^K\) becomes finite and the original procedure of [16] can be applied.

In what follows, I check the performance of this heuristic method by simulation. Consider a data generating process \[Y_{it} = \alpha_i + \beta_i Y_{i,t-1} + \varepsilon_{it}, \quad t=1, \ldots, T,\] with \(T=10\), where \(\alpha_i \sim Unif[-3,3]\), \(\beta_i \sim Unif[0,1]\), and \(\varepsilon_{it} \sim N(0,1)\) are independent random variables. I generate the initial value by \(Y_{i0} = \beta_i + z_i\), where \(z_i \sim N(0,1)\) is another independent random variable. I construct the confidence interval for \(\mathbb{E}(\beta_i)\) using the moment conditions in (11 ), where I set \(S_{it} = \{1, Y_{i,\max\{0, t-5\}}, \ldots, Y_{i,t-1}\}\) and relax the first moment restriction \(\mathbb{E}\left(\sum_{t=1}^T (R_{it}'B_i)\varepsilon_{it}\right) = 0\), which means that I take \(K_0 = \{1\}\). To circumvent the computational difficulty in calcuating the population identified set of this model, I generate \(100,000\) observations from this model and treat them as a finite population, for which the population identified set can be calculated using the bounds in 2.

Under this setup, I implement the heuristic modification of [16] where I calculate the supremum over a finite grid of \(L\) points in the neighborhoods of \(\tilde{\lambda}_N^L(\zeta)\) and \(\tilde{\lambda}_N^U(\zeta)\). I obtain this grid by adding Gaussian perturbations to \(\tilde{\lambda}_N^L(\zeta)\) and \(\tilde{\lambda}_N^U(\zeta)\), while including these optimizers themselves. I then obtain the critical values via \(100\) bootstrap replications, for a nominal coverage rate of \(0.9\). The simulated coverage rate is obtained by \(1000\) Monte Carlo replications.

4 reports the simulated coverage rates for various sample sizes \(N\) and the grid sizes \(L\). The results show that, as long as \(L\) is sufficiently large, the heuristic confidence interval achieves reasonable coverage rates.

Table 4: Simulated coverage rates for the heuristic inference procedure, where the supremum is evaluated with a total of \(L\) finite number of points in the neighborhoods of \(\tilde{\lambda}_N^L(\zeta)\) and \(\tilde{\lambda}_N^U(\zeta)\). The nominal coverage probability is \(0.9\).
\(L=50\) \(L=100\) \(L=200\)
\(N=500\) 0.878 0.890 0.932
\(N=1000\) 0.905 0.918 0.944

10.6 Estimations with transitory income processes↩︎

In this subsection, I examine robustness of the results in 6 to existence of a transitory income process. In particular, I examine if the confidence intervals for \(\mathbb{E}(\rho_i)\) change if there is a transitory income process added to (21 ).

To estimate the confidence intervals in the presence of a transitory income process, I consider the model \(Y_{it} = \tilde{Y}_{it} + \varepsilon_{it}\), where \(Y_{it}\) is the raw log-earnings data, \(\tilde{Y}_{it}\) is the log-earnings without the transitory income process, and \(\varepsilon_{it}\) is an i.i.d. Gaussian transitory income process. Note that the models in the main text do not involve transitory income processes, which corresponds to \(\varepsilon_{it} = 0\).

I conduct estimation and inference for \(\mathbb{E}(\rho_i)\) in the presence of \(\varepsilon_{it}\) in a two-step procedure. First, I use the approach [58] to numerically recover pseudo-observations of \(\tilde{Y}_{it}\) when \(Y_{it}\) is observed and the distribution of \(\varepsilon_{it}\) is known. Second, I apply estimation procedures for the RIP-RC, HIP-RC, RIP-RC-J, and HIP-RC-J models to the numerically recovered pseudo-observations of \(\tilde{Y}_{it}\). The estimation results from this procedure are presented in 5. The estimation results are qualitatively similar to those in 2 in the main text. In particular, the upper confidence limits of \(\mathbb{E}(\rho_i)\) are significantly less than 1, and the confidence intervals for the RIP and the HIP processes show substantial overlap.

Table 5: Confidence intervals of \(\mathbb{E}(\rho_i)\) for the RIP type and the HIP type processes with heterogeneous coefficients, after obtaining pseudo-observations of \(\tilde{Y}_{it}\) without the transitory income process using the method of [58]. The nominal coverage probability is \(0.95\). These confidence intervals are robust to overidentification and model misspecification.
Parameter RIP-RC HIP-RC RIP-RC-J HIP-RC-J
\(\mathbb{E}(\rho_i)\) [0.424, 0.597] [0.267, 0.572] [0.450, 0.583] [0.253, 0.529]

In what follows, I describe in detail the procedure that I used to numerically recover \(\tilde{Y}_{it}\) from the model \(Y_{it} = \tilde{Y}_{it} + \varepsilon_{it}\). I first describe the method proposed in [58]. They considered a model \[Z = X + \varepsilon \label{eq46appendix46abmodel}\tag{58}\] where all variables are scalar12 and \(X\) is independent of \(\varepsilon\). In this model, \(Z\) is observed, but \(X\) and \(\varepsilon\) are not observed. Instead, the distribution of \(\varepsilon\) is known. The objective of [58] is to obtain pseudo-observations of \(X\), given the observations of \(Z\) and the knowledge on the distribution of \(\varepsilon\).

Let \(\mathbb{P}_Z\), \(\mathbb{P}_X\) and \(\mathbb{P}_\varepsilon\) be the probability distributions of \(Z\), \(X\) and \(\varepsilon\), respectively. Let \(\mathbb{P}_{X+\varepsilon}\) be the distribution of \(X+\varepsilon\), which is equal to the convolution of \(\mathbb{P}_X\) and \(\mathbb{P}_\varepsilon\). The second-order Wasserstein distance between \(Z\) and \(X + \varepsilon\), denoted by \(W_2(\mathbb{P}_Z, \mathbb{P}_{X+\varepsilon})\), is defined by: \[W_2(\mathbb{P}_Z, \mathbb{P}_{X+\varepsilon}) = \left( \min_{\pi \in \Pi(\mathbb{P}_Z, \mathbb{P}_{X+\varepsilon})} \int || z - \hat{z} ||^2 d\pi(z, \hat{z}) \right)^{1/2}, \label{eq46appendix46wasserstein}\tag{59}\] where \(\Pi(\mathbb{P}_Z, \mathbb{P}_{X+\varepsilon})\) is the set of couplings of \(\mathbb{P}_Z\) and \(\mathbb{P}_{X+\varepsilon}\), i.e., joint distributions of \(Z\) and \(X + \varepsilon\) whose marginal distributions are \(\mathbb{P}_Z\) and \(\mathbb{P}_{X+\varepsilon}\). It is known that (59 ) is a metric for convergence in distribution among distributions with finite second moments, which means that it satisfies the axioms of distance and that \(W_2(\nu_k, \mu) \rightarrow 0\) if and only if \(\nu_k \overset{d}{\rightarrow} \mu\). Then, (58 ) implies that \[W_2(\mathbb{P}_Z, \mathbb{P}_{X+\varepsilon}) = 0.\] Based on this result, [58] obtain pseudo-observations of \(X\) by minimizing the sample version of (59 ).

I apply their approach to the panel data setting to obtain pseudo-observations of \(\tilde{Y}_{it}\). I assume that \(\varepsilon_{it}\) follows an i.i.d. zero-mean Gaussian distribution such that \(\text{Var}(\varepsilon_{it}) = 0.047\), which is the variance estimate of the transitory income process in [22]. I then simulate \(K = 200\) i.i.d. draws of \((\varepsilon_{i1}, \ldots, \varepsilon_{iT})\): \[\varepsilon_{k} = (\varepsilon_{k1}, \ldots, \varepsilon_{kT}) \in \mathbb{R}^T, \quad k=1, \ldots, K.\] Then, given the initial values of \(\tilde{Y}_{it}\), denoted by \[\tilde{Y}_i = (\tilde{Y}_{i1}, \ldots, \tilde{Y}_{iT}) \in \mathbb{R}^T, \quad i=1, \ldots, N,\] I obtain the synthetic data of \(Y_{it}\) by calculating: \[\hat{Y}_{ik} = \tilde{Y}_i + \varepsilon_k \in \mathbb{R}^T, \quad i=1, \ldots, N, \quad k=1, \ldots, K, \label{eq46appendix46convolution}\tag{60}\] where the synthetic data \(\hat{Y}_{it}\) has size \(NK\). Note that (60 ) computes a convolution of \(\tilde{Y}_i\) and \(\varepsilon_{it}\), because the distribution of \(\hat{Y}_{ik}\) is equal to the convolution of the empirical distribution of \(\tilde{Y}_i\) and the empirical distribution of \(\varepsilon_k\).

I then compare the distribution of \(\hat{Y}_{ik}\) with the observed distribution of \(Y_{it}\). Let \(\hat{P}_{\hat{Y}}\) and \(\hat{P}_{Y}\) be the empirical distributions of \(\hat{Y}_{ik}\) and \(Y_i\), respectively. Then the (squared) second-order Wasserstein distance between the synthetic and the observed data is given by: \[\begin{align} W_2^2(\hat{P}_{Y}, \hat{P}_{\hat{Y}}) &= \min_{0 \leq p_{ijk} \leq 1} \sum_{i=1}^N \sum_{j=1}^N \sum_{k=1}^K p_{ijk} || Y_i - \hat{Y}_{jk} ||^2 \\ &\qquad\text{subject to}\qquad\sum_{i=1}^N p_{ijk} = 1, \quad \sum_{j=1}^N\sum_{k=1}^K p_{ijk} = 1, \end{align}\] which is the sample analogue of (59 ) and takes the form of a linear program. I then obtain pseudo-observations of \(\tilde{Y}_{it}\), denoted by \(\tilde{Y}_i = (\tilde{Y}_{i1}, \ldots, \tilde{Y}_{iT})\) for \(i=1, \ldots, N\), by: \[\{\tilde{Y}_i\}_{i=1}^N = \mathop{\mathrm{argmin}}_{\tilde{Y}_1, \ldots, \tilde{Y}_N} W_2^2(\hat{P}_{Y}, \hat{P}_{\hat{Y}}),\] which can be shown to be a convex optimization problem. The minimizer of this problem is then the pseudo-observations \(\tilde{Y}_i\).

References↩︎

[1]
M. Arellano and S. Bond, “Some tests of specification for panel data: Monte carlo evidence and an application to employment equations,” Review of Economic Studies, vol. 58, no. 2, pp. 277–297, 1991.
[2]
R. Blundell and S. Bond, “Initial conditions and moment restrictions in dynamic panel data models,” Journal of Econometrics, vol. 87, no. 1, pp. 115–143, 1998.
[3]
G. Chamberlain, “Feedback in panel data models,” Working paper, 1993.
[4]
G. Chamberlain, “Feedback in panel data models,” Journal of Econometrics, vol. 226, no. 1, pp. 4–20, 2022.
[5]
M. Arellano and S. Bonhomme, “Identifying distributional characteristics in random coefficients panel data models,” Review of Economic Studies, vol. 79, no. 3, pp. 987–1020, 2012.
[6]
G. Chamberlain, “Efficiency bounds for semiparametric regression,” Econometrica, vol. 60, no. 3, pp. 567–596, 1992.
[7]
J. M. Wooldridge, “Fixed-effects and related estimators for correlated random-coefficient and treatment-effect panel data models,” Review of Economics and Statistics, vol. 87, no. 2, pp. 385–390, 2005.
[8]
B. S. Graham and J. L. Powell, “Identification and estimation of average partial effects in ‘irregular’ correlated random coefficient panel data models,” Econometrica, vol. 80, no. 5, pp. 2105–2152, 2012.
[9]
B. E. Honoré and E. Tamer, “Bounds on parameters in panel dynamic discrete choice models,” Econometrica, vol. 74, no. 3, pp. 611–629, 2006.
[10]
B. E. Honoré and A. Lleras-Muney, “Bounds in competing risks models and the war on cancer,” Econometrica, vol. 74, no. 6, pp. 1675–1698, 2006.
[11]
M. Mogstad, A. Santos, and A. Torgovitsky, “Using instrumental variables for inference about policy relevant treatment parameters,” Econometrica, vol. 86, no. 5, pp. 1589–1619, 2018.
[12]
A. Torgovitsky, “Nonparametric inference on state dependence in unemployment,” Econometrica, vol. 87, no. 5, pp. 1475–1505, 2019.
[13]
A. Galichon and M. Henry, “A test of non-identifying restrictions and confidence regions for partially identified parameters,” Journal of Econometrics, vol. 152, no. 2, pp. 186–196, 2009.
[14]
S. M. Schennach, “Entropic latent variable integration via simulation,” Econometrica, vol. 82, no. 1, pp. 345–385, 2014.
[15]
J. Stoye, “A simple, short, but never-empty confidence interval for partially identified parameters,” Working paper, arXiv preprint arXiv:2010.10484, 2020.
[16]
D. W. Andrews and X. Shi, “Inference based on many conditional moment inequalities,” Journal of Econometrics, vol. 196, no. 2, pp. 275–287, 2017.
[17]
R. E. Hall and F. S. Mishkin, “The sensitivity of consumption to transitory income: Estimates from panel data on households,” Econometrica, vol. 50, no. 2, pp. 461–481, 1982.
[18]
R. Blundell, L. Pistaferri, and I. Preston, “Consumption inequality and partial insurance,” American Economic Review, vol. 98, no. 5, pp. 1887–1921, 2008.
[19]
R. Blundell, L. Pistaferri, and I. Saporta-Eksten, “Consumption inequality and family labor supply,” American Economic Review, vol. 106, no. 2, pp. 387–435, 2016.
[20]
M. Arellano, R. Blundell, and S. Bonhomme, “Earnings and consumption dynamics: A nonlinear panel data framework,” Econometrica, vol. 85, no. 3, pp. 693–734, 2017.
[21]
F. Guvenen, “Learning your earning: Are labor income shocks really very persistent?” American Economic Review, vol. 97, no. 3, pp. 687–712, 2007.
[22]
F. Guvenen, “An empirical investigation of labor income processes,” Review of Economic Dynamics, vol. 12, no. 1, pp. 58–79, 2009.
[23]
S. Bonhomme, K. Dano, and B. S. Graham, “Identification in a binary choice panel data model with a predetermined covariate,” SERIEs, vol. 14, no. 3, pp. 315–351, 2023.
[24]
S. Bonhomme, K. Dano, and B. S. Graham, “Moment restrictions for nonlinear panel data models with feedback,” Working paper, arXiv preprint arXiv:2506.12569, 2025.
[25]
L. A. Lillard and Y. Weiss, “Components of variation in panel earnings data: American scientists 1960-70,” Econometrica, vol. 47, no. 2, pp. 437–454, 1979.
[26]
R. Blundell, H. Low, and I. Preston, “Decomposing changes in income risk using consumption data,” Quantitative Economics, vol. 4, no. 1, pp. 1–37, 2013.
[27]
J. Gu and R. Koenker, “Unobserved heterogeneity in income dynamics: An empirical bayes perspective,” Journal of Business & Economic Statistics, vol. 35, no. 1, pp. 1–16, 2017.
[28]
C. Meghir and L. Pistaferri, “Income variance dynamics and heterogeneity,” Econometrica, vol. 72, no. 1, pp. 1–32, 2004.
[29]
G. Kaplan and G. L. Violante, “A model of the consumption response to fiscal stimulus payments,” Econometrica, vol. 82, no. 4, pp. 1199–1239, 2014.
[30]
G. S. Olley and A. Pakes, “The dynamics of productivity in the telecommunications equipment industry,” Econometrica, vol. 64, no. 6, pp. 1263–1297, 1996.
[31]
J. Levinsohn and A. Petrin, “Estimating production functions using inputs to control for unobservables,” Review of Economic Studies, vol. 70, no. 2, pp. 317–341, 2003.
[32]
D. A. Ackerberg, K. Caves, and G. Frazer, “Identification properties of recent production function estimators,” Econometrica, vol. 83, no. 6, pp. 2411–2451, 2015.
[33]
H. Kasahara, P. Schrimpf, and M. Suzuki, “Identification and estimation of production function with unobserved heterogeneity,” Working paper, arXiv preprint arXiv:2305.12067, 2023.
[34]
H. J. Bierens, “A consistent conditional moment test of functional form,” Econometrica, vol. 58, no. 6, pp. 1443–1458, 1990.
[35]
D. W. Andrews and X. Shi, “Inference based on conditional moment inequalities,” Econometrica, vol. 81, no. 2, pp. 609–666, 2013.
[36]
F. Gunsilius, “Bounds in continuous instrumental variable models,” Working paper, 2019.
[37]
L. Li, “Identification of structural and counterfactual parameters in a large class of structural econometric models,” Working paper, 2018.
[38]
P. Milgrom and I. Segal, “Envelope theorems for arbitrary choice sets,” Econometrica, vol. 70, no. 2, pp. 583–601, 2002.
[39]
S. Bonhomme, “Unrestricted heterogeneity in linear econometric models,” Working paper, 2025.
[40]
A. Beresteanu, I. Molchanov, and F. Molinari, “Sharp identification regions in models with convex moment predictions,” Econometrica, vol. 79, no. 6, pp. 1785–1821, 2011.
[41]
F. Molinari, “Partial identification of probability distributions with misclassified data,” Journal of Econometrics, vol. 144, no. 1, pp. 81–117, 2008.
[42]
A. W. Van der Vaart, Asymptotic statistics. Cambridge university press, 2000.
[43]
D. W. Andrews and S. Kwon, “Misspecified moment inequality models: Inference and diagnostics,” Review of Economic Studies, vol. 91, no. 1, pp. 45–76, 2024.
[44]
J. P. Romano, A. M. Shaikh, and M. Wolf, “A practical two-step method for testing moment inequalities,” Econometrica, vol. 82, no. 5, pp. 1979–2002, 2014.
[45]
V. Chernozhukov, D. Chetverikov, and K. Kato, “Inference on causal and structural parameters using many moment inequalities,” Review of Economic Studies, vol. 86, no. 5, pp. 1867–1900, 2019.
[46]
Y. Bai, A. Santos, and A. M. Shaikh, “A two-step method for testing many moment inequalities,” Journal of Business & Economic Statistics, vol. 40, no. 3, pp. 1070–1080, 2022.
[47]
M. Baker, “Growth-rate heterogeneity and the covariance structure of life-cycle earnings,” Journal of Labor Economics, vol. 15, no. 2, pp. 338–375, 1997.
[48]
T. E. MaCurdy, “The use of time series processes to model the error structure of earnings in a longitudinal data analysis,” Journal of Econometrics, vol. 18, no. 1, pp. 83–114, 1982.
[49]
J. M. Abowd and D. Card, “On the covariance structure of earnings and hours changes,” Econometrica, vol. 57, no. 2, pp. 411–445, 1989.
[50]
R. H. Topel and M. P. Ward, “Job mobility and the careers of young men,” Quarterly Journal of Economics, vol. 107, no. 2, pp. 439–479, 1992.
[51]
M. Browning, M. Ejrnaes, and J. Alvarez, “Modelling income processes with lots of heterogeneity,” Review of Economic Studies, vol. 77, no. 4, pp. 1353–1381, 2010.
[52]
S. Alan, M. Browning, and M. Ejrnæs, “Income and consumption: A micro semistructural analysis with pervasive heterogeneity,” Journal of Political Economy, vol. 126, no. 5, pp. 1827–1864, 2018.
[53]
M. H. Pesaran and L. Yang, “Heterogeneous autoregressions in short t panel data models,” Journal of Applied Econometrics, vol. 39, no. 7, pp. 1359–1378, 2024.
[54]
J. Kiefer, “Optimum experimental designs,” Journal of the Royal Statistical Society: Series B, vol. 21, no. 2, pp. 272–304, 1959.
[55]
E. J. Anderson, “A review of duality theory for linear programming over topological vector spaces,” Journal of Mathematical Analysis and Applications, vol. 97, no. 2, pp. 380–392, 1983.
[56]
J.-B. Lasserre, Moments, positive polynomials and their applications. World Scientific, 2010.
[57]
J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization. Cambridge University Press, 2015.
[58]
M. Arellano and S. Bonhomme, “Recovering latent variables by matching,” Journal of the American Statistical Association, pp. 1–14, 2021.

  1. Economics Discipline Group, UTS Business School, University of Technology Sydney. Address: 14-28 Ultimo Road, Ultimo, NSW 2007, Australia. Tel: (02) 9514 3074. Email: ↩︎

  2. In related studies, [23], [24] analyzed general nonlinear panel data models with sequentially exogenous regressors and individual-specific intercepts.↩︎

  3. In the literature, it is standard to add a transitory shock to (3 ).↩︎

  4. [8] studied a violation of 2 in a non-dynamic context.↩︎

  5. If 2 is violated because of \(Z_i\), one may choose to consider the subpopulation where \(\text{det}(Z_i'Z_i) \geq d_0\) for some \(d_0 > 0\). The results of this paper extend straightforwardly to this subpopulation because \(\varepsilon_{it}\) is assumed to have zero mean conditional on \(Z_i\), as stated in (2 ). By contrast, the results of this paper do not extend to the subpopulation for which \(\text{det}(X_i'X_i) \geq d_0\), since \(\varepsilon_{it}\) has zero mean only conditional on the current history of \(X_{it}\), not the full history.↩︎

  6. Whether there exist point-identified parameters in (1 ) and (2 ) that are similar to the examples in [3], [4] and [39] remains an open question and is not pursued here.↩︎

  7. Analogously to the discussion on 2 in Footnote 4, if 9 is violated because of \(Z_i\), one may choose to consider the subpopulation where \(\text{det}(Z_i'Z_i) \geq d_0\) for some \(d_0 > 1/\lambda_{min}\).↩︎

  8. For the empirical likelihood approach, this translates into the empirical likelihood criterion failing to attain its optimum at equal probabilities.↩︎

  9. Lemma 9.2 of [16] introduces a weight function associated with an ordering of the moment inequalities. This weight function does not affect the inference procedure, since it cancels out in the construction of the test statistics and therefore does not appear in any of the expressions.↩︎

  10. As [21] points out, this is a stylized version of what is used in the literature, but it still captures features important for the discussion.↩︎

  11. In the literature, it is standard to add a transitory income process to (20 ). I present estimation results that account for a transitory income process in Online Appendix 10.6. The estimation results yield similar qualitative conclusions outlined in this subsection.↩︎

  12. They also consider a more general case of multivariate factor models.↩︎