This paper provides a step-by-step guide to estimating discrete choice dynamic programming (DDP) models using the Bayesian Dynamic Programming algorithm developed in Imai, Jain and Ching (2008) (IJC). The IJC method combines the DDP solution algorithm with the Bayesian Markov Chain Monte Carlo...

'Frequent-buyer' type of rewards program is a commonly used marketing tool for companies to compete for market shares. It also provides an unique environment for studying consumer's forward-looking behavior. The consumer's problem on accumulating reward points can be formulated as a stationary...

For information/digital products, the used goods market has been viewed as a threat by producers. However, it is not clear if this view is justified because the used goods market also provides owners with an opportunity to sell their products. To investigate the impact of the used goods market...

We develop a Bayesian Markov chain Monte Carlo (MCMC) algorithm for estimating finite-horizon discrete choice dynamic programming (DDP) models. The proposed algorithm has the potential to reduce the computational burden significantly when some of the state variables are continuous. In a...