Sharp Identification Regions in Models With Convex Moment Predictions

被引:94
作者
Beresteanu, Arie [1 ]
Molchanov, Ilya [2 ]
Molinari, Francesca [3 ]
机构
[1] Univ Pittsburgh, Dept Econ, Pittsburgh, PA 15260 USA
[2] Univ Bern, Inst Math Stat & Actuarial Sci, CH-3012 Bern, Switzerland
[3] Cornell Univ, Dept Econ, Ithaca, NY 14853 USA
基金
瑞士国家科学基金会;
关键词
Partial identification; random sets; Aumann expectation; support function; finite static games; multiple equilibria; random utility models; interval data; best linear prediction; DISCRETE RESPONSE; INFERENCE; ENTRY; SETS; DISTRIBUTIONS; EQUILIBRIA; PARAMETERS; VOLUME;
D O I
10.3982/ECTA8680
中图分类号
F [经济];
学科分类号
02 ;
摘要
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 TI, 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 TI. We use examples analyzed in the literature to illustrate the gains in identification and computational tractability afforded by our method.
引用
收藏
页码:1785 / 1821
页数:37
相关论文
共 57 条
[31]  
GALICHON A., 2006, INFERENCE INCO UNPUB
[32]  
GALICHON A, 2009, SET IDENTIFICA UNPUB
[33]   A test of non-identifying restrictions and confidence regions for partially identified parameters [J].
Galichon, Alfred ;
Henry, Marc .
JOURNAL OF ECONOMETRICS, 2009, 152 (02) :186-196
[34]   Graph implementations for nonsmooth convex programs [J].
Stanford University, United States .
Lect. Notes Control Inf. Sci., 2008, (95-110) :95-110
[35]  
GRIECO P. L. E, 2009, DISCRETE CHOIC UNPUB
[36]  
Horowitz J. L., 2003, Reliable Computing, V9, P419, DOI 10.1023/A:1025865520086
[37]  
KIM K.-I, 2009, SET ESTIMATION UNPUB
[38]   Simulated annealing in convex bodies and an O*(n4) volume algorithm [J].
Lovász, L ;
Vempala, S .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2006, 72 (02) :392-417
[39]  
Manski C.F., 2003, PARTIAL IDENTIFICATI
[40]   Inference on regressions with interval data on a regressor or outcome [J].
Manski, CF ;
Tamer, E .
ECONOMETRICA, 2002, 70 (02) :519-546