2024 European Winter Meeting, Palma de Majorca, Spain: December, 2024

Linear programming approach to partially identified econometric models

Andrei Voronin

The bounds on a parameter of interest in partially identified settings are often given by the values of linear programs (LP). This paper studies estimation and inference for the value of a LP, where all the problem's parameters are inferred from the data. We develop the first root-n-consistent estimator that does not require additional restrictions. Unlike existing methods, our estimator remains valid under point-identification, over-identifying constraints and solution multiplicity. Exact and computationally simple inference procedure is developed. Turning to uniform properties, we prove that there exists no uniformly consistent estimator absent further conditions. We propose the 'delta-condition', under which our estimator is uniformly consistent. Delta-condition does not rule out economically relevant problematic scenarios, covers the unrestricted set of measures in the limit, and is strictly weaker than all previously proposed restrictions. We complement our estimation approach with a general identification result for models described by affine inequalities over conditional moments (AICM), potentially augmented with relevant almost sure restrictions on the potential outcomes and missing data conditions. Sharp bounds on affine treatment parameters under AICM are shown to take the form of a LP. Our results allow applied work to employ previously intractable conditions, including arbitrary combinations of existing restrictions, and conduct sensitivity analysis. We apply our findings to estimating returns to education. For that, we develop the conditionally monotone IV assumption (cMIV) that tightens classical bounds. We argue that cMIV remains unrestrictive relative to the classical conditions and provide a formal test for it. Under cMIV, university education in Colombia is shown to increase the average wage by at least 5.91%. In contrast, classical conditions fail to produce an informative bound.



Preview

Page 1
Page 2
Page 3
Page 4
Page 5
Page 6
Page 7
Page 8
Page 9
Page 10
Page 11
Page 12
Page 13
Page 14
Page 15
Page 16
Page 17
Page 18
Page 19
Page 20
Page 21
Page 22
Page 23
Page 24
Page 25
Page 26
Page 27
Page 28
Page 29
Page 30
Page 31
Page 32
Page 33
Page 34
Page 35
Page 36
Page 37
Page 38
Page 39
Page 40
Page 41
Page 42
Page 43
Page 44
Page 45
Page 46
Page 47
Page 48
Page 49
Page 50
Page 51
Page 52
Page 53
Page 54
Page 55
Page 56
Page 57
Page 58
Page 59
Page 60
Page 61
Page 62
Page 63
Page 64
Page 65
Page 66
Page 67
Page 68
Page 69
Page 70
Page 71
Page 72
Page 73
Page 74
Page 75
Page 76
Page 77
Page 78
Page 79
Page 80
Page 81
Page 82
Page 83
Page 84
Page 85

Slides

 

Download Slides