Conditional Choice Probability Estimation of Dynamic Discrete Choice Models With Unobserved Heterogeneity.

We adapt the expectation-maximization algorithm to incorporate unobserved heterogeneity into conditional choice probability (CCP) estimators of dynamic discrete choice problems. The unobserved heterogeneity can be time-invariant or follow a Markov chain. By developing a class of problems where the d...

Descripción completa

Detalles Bibliográficos
Publicado en:Econometrica Vol. 79; no. 6; pp. 1823 - 1868
Autores principales: Arcidiacono, Peter, Miller, Robert A.
Formato: Artículo
Publicado: Wiley-Blackwell November 2011
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ssf&AN=527580382&site=ehost-live
header:
  @attributes:
    shortDbName: ssf
    uiTerm: 527580382
    longDbName: Social Sciences Full Text (H.W. Wilson)
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00129682
        ECN
      jtl: Econometrica
      issn: 00129682
      maglogo: N
    pubinfo:
      dt: November 2011
      vid: 79
      iid: 6
      pid: 480
      pub: Wiley-Blackwell
    artinfo:
      ui:
        527580382
        10.3982/ECTA7743
      ppf: 1823
      ppct: 45
      formats:
      tig:
        atl: Conditional Choice Probability Estimation of Dynamic Discrete Choice Models With Unobserved Heterogeneity.
      aug:
        au:
          Arcidiacono, Peter
          Miller, Robert A.
      ab: We adapt the expectation-maximization algorithm to incorporate unobserved heterogeneity into conditional choice probability (CCP) estimators of dynamic discrete choice problems. The unobserved heterogeneity can be time-invariant or follow a Markov chain. By developing a class of problems where the difference in future value terms depends on a few conditional choice probabilities, we extend the class of dynamic optimization problems where CCP estimators provide a computationally cheap alternative to full solution methods. Monte Carlo results confirm that our algorithms perform quite well, both in terms of computational time and in the precision of the parameter estimates. Reprinted by permission of the publisher.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: N
    holdings:
      @attributes:
        islocal: N