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, Jain and Ching, Econometrica 77:1865-1899, 2009) (IJC). In the conventional nested fixed point algorithm, most of the...

In "Marketing Information: A Competitive Analysis,'' Sarvary and Parker (1997) (S&P) [Marketing Science, 16(1): 24-38] argue that, a reduction in the price of one information product can lead to an increase in demand for another information product -- information products can be gross...

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...

As information technology improves rapidly and becomes more accessible, it becomes much easier for consumers to gather product in-formation and spend more time thinking about how to get the most out of their budget constraints. This means that consumers are getting “smarter” and more...

In "Marketing Information: A Competitive Analysis,'' Sarvary and Parker (1997) (S&P) [Marketing Science, 16(1): 24-38] argue that in part of the parameter space that they considered, a reduction in the price of one information product can lead to an increase in demand for another information...