Constrained Optimization Approaches to Estimation of Structural Models
Maximum likelihood estimation of structural models is often viewed as computationally difficult. This impression is due to a focus on the Nested Fixed-Point approach. We present a direct optimization approach to the general problem and show that it is significantly faster than the NFXP approach when applied to the canonical Zurcher bus repair model. The NFXP approach is inappropriate for estimating games since it requires finding all Nash equilibria of a game for each parameter vector considered, a generally intractable computational problem. We formulate the problem of maximum likelihood estimation of games as a constrained optimization problem that is qualitatively no more difficult to solve than standard maximum likelihood problems. The direct optimization approach is also applicable to other structural estimation methods such as methods of moments, and also allows one to use computationally intensive bootstrap methods to calculate inference. The MPEC approach is also easily implemented on software with high-level interfaces. Furthermore, all the examples in this paper were computed using only free resources available on the web.
(This abstract was borrowed from another version of this item.)
Volume (Year): 80 (2012)
Issue (Month): 5 (09)
|Contact details of provider:|| Phone: 1 212 998 3820|
Fax: 1 212 995 4487
Web page: http://www.econometricsociety.org/
More information through EDIRC
|Order Information:|| Web: https://www.econometricsociety.org/publications/econometrica/access/ordering-back-issues Email: |
When requesting a correction, please mention this item's handle: RePEc:ecm:emetrp:v:80:y:2012:i:5:p:2213-2230. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.