×

Revisiting the nested fixed-point algorithm in BLP random coefficients demand estimation. (English) Zbl 1396.91392

Summary: This paper examines the numerical properties of the nested fixed-point algorithm (NFP) in the estimation of S. Berry et al. [Econometrica 63, No. 4, 841–890 (1995; Zbl 0836.90057)] random coefficient logit demand model. J.-P. Dubé et al. [Econometrica 80, No. 5, 2231–2267 (2012; Zbl 1274.91282)] find the bound on the errors of the NFP estimates computed by contraction mappings (NFP/CTR) has the order of the square root of the inner loop tolerance. Under our assumptions, we theoretically derive an upper bound on the numerical bias in the NFP/CTR, which has the same order of the inner loop tolerance. We also discuss that, compared with NFP/CTR, NFP using Newton’s method has a smaller bound on the estimate error.

MSC:

91B42 Consumer behavior, demand theory
54H25 Fixed-point and coincidence theorems (topological aspects)
65D15 Algorithms for approximation of functions
Full Text: DOI

References:

[1] Ackerberg, D.; Geweke, J.; Hahn, J., Comments on “convergence properties of the likelihood of computed dynamic models”, Econometrica, 77, 6, 2009-2017, (2009) · Zbl 1182.62212
[2] Berry, S.; Levinsohn, J.; Pakes, A., Automobile prices in market equilibrium, Econometrica, 63, 4, 841-890, (1995) · Zbl 0836.90057
[3] Dubé, J. P.; Fox, J. T.; Su, C. L., Improving the numerical performance of blp static and dynamic discrete choice random coefficients demand estimation, Econometrica, 80, 5, 2231-2267, (2012) · Zbl 1274.91282
[4] Iskhakov, F.; Lee, J.; Rust, J.; Schjerning, B.; Seo, K., Comment on “constrained optimization approaches to estimation of structural models”, Econometrica, 84, 1, 365-370, (2016) · Zbl 1410.62203
[5] Kim, K., Park, M., 2010. Approximation error in the nested fixed point algorithm for BLP model estimation, Working paper.
[6] Rust, J., Optimal replacement of GMC bus engines: an empirical model of harold zurcher, Econometrica, 55, 5, 999-1033, (1987) · Zbl 0624.90034
[7] Yamamoto, T., A method for finding sharp error bounds for newton’s method under the Kantorovich assumptions, Numer. Math., 49, 203-220, (1986) · Zbl 0607.65033
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.