Model-Adaptive Approach to Dynamic Discrete Choice Models with Large State Spaces
Estimation and counterfactual experiments in dynamic discrete choice models with large state spaces pose computational difficulties. This paper develops a novel model-adaptive approach to solve the linear system of fixed point equations of the policy valuation operator. We propose a model-adaptive sieve space, constructed by iteratively augmenting the space with the residual from the previous iteration. We show both theoretically and numerically that model-adaptive sieves dramatically improve performance. In particular, the approximation error decays at a superlinear rate in the sieve dimension, unlike a linear rate achieved using conventional methods. Our method works for both conditional choice probability estimators and full-solution estimators with policy iteration. We apply the method to analyze consumer demand for laundry detergent using Kantar's Worldpanel Take Home data. On average, our method is 51.5% faster than conventional methods in solving the dynamic programming problem, making the Bayesian MCMC estimator computationally feasible.
Code (0)
등록된 구현이 없습니다.
Tasks
Computational EfficiencycounterfactualDiscrete Choice ModelsSimilar Papers 제목 키워드 기반
A Recursive Partitioning Approach for Dynamic Discrete Choice Modeling in High Dimensional Settings
Dynamic discrete choice models are widely employed to answer substantive and policy questions in settings where individuals' current choices have future implications. However, estimation of these models is often computat…
Discrete Choice ModelsNetwork-based Representations and Dynamic Discrete Choice Models for Multiple Discrete Choice Analysis
In many choice modeling applications, people demand is frequently characterized as multiple discrete, which means that people choose multiple items simultaneously. The analysis and prediction of people behavior in multip…
Discrete Choice ModelsMultiple-choiceWhen to Sense and Control? A Time-adaptive Approach for Continuous-Time RL
Reinforcement learning (RL) excels in optimizing policies for discrete-time Markov decision processes (MDP). However, various systems are inherently continuous in time, making discrete-time MDPs an inexact modeling choic…
Reinforcement Learning (RL)Deep reinforced learning enables solving rich discrete-choice life cycle models to analyze social security reforms
Discrete-choice life cycle models of labor supply can be used to estimate how social security reforms influence employment rate. In a life cycle model, optimal employment choices during the life course of an individual m…
Conditional Choice Probability Estimation of Dynamic Discrete Choice Models with 2-period Finite Dependence
This paper extends the work of Arcidiacono and Miller (2011, 2019) by introducing a novel characterization of finite dependence within dynamic discrete choice models, demonstrating that numerous models display 2-period f…
Discrete Choice Models