We analyze the identification and estimation of parameters β satisfying the incomplete linear moment restrictions E(z T(x β-y)) = E(zTu(z)) where z is a set of instruments and u(z) an unknown bounded scalar function. We first provide empirically relevant examples of such a set-up. Second, we...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...

This paper is concerned with inference about an unidentified linear function, L(g), where the function g satisfies the relation Y=g(X)+U; E(U |W)=0. In this relation, Y is the dependent variable, X is a possibly endogenous explanatory variable, W is an instrument for X and U is an unobserved...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. We show that...

We present the clrbound, clr2bound, clr3bound, and clrtest commands for estimation and inference on intersection bounds as developed by Chernozhukov et al. (2013). The intersection bounds framework encompasses situations where a population parameter of interest is partially identified by a...

This paper is concerned with inference about an unidentified linear functional, L(g), where the function g satisfies the relation Y=g(x) + U; E(U/W) = 0. In this relation, Y is the dependent variable, X is a possibly endogenous explanatory variable, W is an instrument for X, and U is an...

We develop a practical and novel method for inference on intersection bounds, namely bounds defined by either the infimum or supremum of a parametric or nonparametric function, or equivalently, the value of a linear programming problem with a potentially infinite constraint set. Our approach is...

Efron's elegant approach to g-modeling for empirical Bayes problems is contrasted with an implementation of the Kiefer-Wolfowitz nonparametric maximum likelihood estimator for mixture models for several examples. The latter approach has the advantage that it is free of tuning parameters and...

This paper presents a method of calculating sharp bounds on the average treatment effect using linear programming under identifying assumptions commonly used in the literature. This new method provides a sensitivity analysis of the identifying assumptions and missing data in an application...

This paper describes a method for carrying out inference on partially identified parameters that are solutions to a class of optimization problems. The optimization problems arise in applications in which grouped data are used for estimation of a model's structural parameters. The parameters are...