All Rights Reserved
AccessEcon LLC 2006, 2008.
Powered by MinhViet JSC

Yu Wang and Yao Luo
''SpMV approaches to dynamic discrete choice models with limited transition''
( 2022, Vol. 42 No.4 )
Dynamic optimization problems often involve continuous state variables. Casting such problems into dynamic discrete choice models usually requires variable discretization. When there are multiple state variables, many discretized future states will be visited with only very small probability conditional on current states. We investigate pruning these small transition probabilities and applying the sparse matrix-vector multiplication method in value function iterations. We assess our method in a numerical example inspired by Rust (1987) and Barwick and Pathak (2015). Our method substantially improves computational performance and reduces memory requirements with little loss in accuracy.
Keywords: Sparse, Discretization
JEL: C6 - Mathematical Methods and Programming: General
C5 - Econometric Modeling: General
Manuscript Received : Aug 31 2022 Manuscript Accepted : Dec 30 2022

  This abstract has been downloaded 30 times                The Full PDF of this paper has been downloaded 153794 times