The use of finite mixture distributions to control for unobserved heterogeneity has become increasingly popular among those estimating dynamic discrete choice models. One of the barriers to using mixture models is that parameters that could previously be estimated in stages must now be estimated jointly: using mixture distributions destroys any additive separability of the log likelihood function. The EM algorithm reintroduces additive separability, however, thus allowing the option of estimating parameters sequentially during each maximization step. We show that, relative to full information maximum likelihood, the EM algorithm with sequential maximization (ESM) can generate large computational savings with little loss of efficiency.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Duke University, Department of Economics in its series Working Papers with number
00-16.
Length: Date of creation: 2000 Date of revision: Handle: RePEc:duk:dukeec:00-16
Contact details of provider: Postal: Department of Economics Duke University 213 Social Sciences Building Box 90097 Durham, NC 27708-0097 Phone: (919) 660-1800 Fax: (919) 684-8974 Web page: http://www.econ.duke.edu/
For technical questions regarding this item, or to correct its listing, contact: (Department of Economics Webmaster).
Find related papers by JEL classification: C13 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: General - - - Estimation C61 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Optimization Techniques; Programming Models; Dynamic Analysis D90 - Microeconomics - - Intertemporal Choice and Growth - - - General
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)