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...

In parametric models a sufficient condition for local idenfication is that the vector of moment is differentiable at the true parameter with full rank derivative matrix. This paper shows that additional conditions are often needed in nonlinear, nonparametric models to avoid nonlinearities...

This paper provides inference methods for best linear approximations to functions which are known to lie within a band. It extends the partial identification literature by allowing the upper and lower functions defining the band to be any functions, including ones carrying an index, which can be...

<p>This paper extends Imbens and Manski's (2004) analysis of confidence intervals for interval identified parameters. For their final result, Imbens and Manski implicitly assume superefficient estimation of a nuisance parameter. This appears to have gone unnoticed before, and it limits the result's...</p>

This paper develops and implements a nonparametric test of Random Utility Models (RUM) using only nonsatiation and the Strong Axiom of Revealed Preference (SARP) as restrictions on individual level behaviour, allowing for fully unrestricted unobserved heterogeneity. The main application is the...