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

This paper considers parametric estimation problems with i.i.d. data. It focusses on rate-effciency, in the sense of maximal possible convergence rates of stochastically bounded estimators, as an optimality criterion, largely unexplored in parametric estimation. Under mild conditions, the...

<p><p>This paper considers parametric estimation problems with independent, identically,non-regularly distributed data. It focuses on rate-effciency, in the sense of maximal possible convergence rates of stochastically bounded estimators, as an optimality criterion,largely unexplored in parametric...</p></p>

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

This paper considers structural nonparametric random utility models for continuous choice variables. It provides suffcient conditions on random preferences to yield reduced- form systems of nonparametric stochastic demand functions that allow global invertibility between demands and random...