City Research Online

Abstract

This paper provides a step-by-step guide to estimating infinite horizon discrete choice dynamic programming (DDP) models using a new Bayesian estimation algorithm (Imai et al., Econometrica 77:1865–1899, 2009a) (IJC). In the conventional nested fixed point algorithm, most of the information obtained in the past iterations remains unused in the current iteration. In contrast, the IJC algorithm extensively uses the computational results obtained from the past iterations to help solve the DDP model at the current iterated parameter values. Consequently, it has the potential to significantly alleviate the computational burden of estimating DDP models. To illustrate this new estimation method, we use a simple dynamic store choice model where stores offer “frequent-buyer” type rewards programs. Our Monte Carlo results demonstrate that the IJC method is able to recover the true parameter values of this model quite precisely. We also show that the IJC method could reduce the estimation time significantly when estimating DDP models with unobserved heterogeneity, especially when the discount factor is close to 1.

Publication Type:	Article
Additional Information:	The final publication is available at Springer via http://dx.doi.org/10.1007/s11129-012-9119-6
Publisher Keywords:	Bayesian estimation, Dynamic programming, Discrete choice models, Rewards programs
Subjects:	H Social Sciences > HB Economic Theory
Departments:	School of Policy & Global Affairs > Economics
SWORD Depositor:	Symplectic Administrator

Export

Downloads