This paper supersedes two earlier working papers (Beresteanu, Molchanov, and Molinari (2008, 2009)). We thank a co-editor and three anonymous reviewers for very useful suggestions that substantially improved the paper. We are grateful to H. Bar, T. Bar, L. Barseghyan, I. Canay, G. Chamberlain, P. Ellickson, Y. Feinberg, K. Hirano, T. Magnac, T. O'Donoghue, M. Peski, A. Rosen, X. Shi, J. Stoye, A. Sweeting, and, especially, L. Blume, D. Easley, and C. Manski for comments. We also thank seminar participants at many institutions and conferences where this paper was presented. We are grateful to M. Grant for advice on the use of the CVX software, which we used to run simulations in MatLab. Financial support from the U.S. NSF Grants SES-0617559 and SES-0922373 (Beresteanu) and SES-0617482 and SES-0922330 (Molinari); from the Swiss National Science Foundation Grants 200021-117606 and 200021-126503 (Molchanov); and from the Center for Analytic Economics at Cornell University is gratefully acknowledged. Ilya Molchanov gratefully acknowledges the hospitality of the Department of Economics at Cornell University in October 2006.
Sharp Identification Regions in Models With Convex Moment Predictions
Article first published online: 22 NOV 2011
© 2011 The Econometric Society
Volume 79, Issue 6, pages 1785–1821, November 2011
How to Cite
Beresteanu, A., Molchanov, I. and Molinari, F. (2011), Sharp Identification Regions in Models With Convex Moment Predictions. Econometrica, 79: 1785–1821. doi: 10.3982/ECTA8680
- Issue published online: 22 NOV 2011
- Article first published online: 22 NOV 2011
- Manuscript received July, 2009; final revision received March, 2011.
- Partial identification;
- random sets;
- Aumann expectation;
- support function;
- finite static games;
- multiple equilibria;
- random utility models;
- interval data;
- best linear prediction
We provide a tractable characterization of the sharp identification region of the parameter vector θ in a broad class of incomplete econometric models. Models in this class have set-valued predictions that yield a convex set of conditional or unconditional moments for the observable model variables. In short, we call these models with convex moment predictions. Examples include static, simultaneous-move finite games of complete and incomplete information in the presence of multiple equilibria; best linear predictors with interval outcome and covariate data; and random utility models of multinomial choice in the presence of interval regressors data. Given a candidate value for θ, we establish that the convex set of moments yielded by the model predictions can be represented as the Aumann expectation of a properly defined random set. The sharp identification region of θ, denoted ΘI, can then be obtained as the set of minimizers of the distance from a properly specified vector of moments of random variables to this Aumann expectation. Algorithms in convex programming can be exploited to efficiently verify whether a candidate θ is in ΘI. We use examples analyzed in the literature to illustrate the gains in identification and computational tractability afforded by our method.