论文检索

利用均匀化与稀疏性估计和计算连续时间动态离散选择博弈AI 解读

Continuous-time empirical dynamic discrete choice games offer notable computational advantages over discrete-time models. This paper addresses remaining computational and econometric challenges to further improve both model solution and estimation. We establish convergence rates for value iteration and policy evaluation with fixed beliefs, and develop Newton-Kantorovich methods that exploit analytical Jacobians and sparse matrix structure. We apply uniformization both to…

连续时间动态离散选择博弈的识别与估计AI 解读

This paper considers the theoretical, computational, and econometric properties of continuous time dynamic discrete choice games with stochastically sequential moves, introduced by Arcidiacono, Bayer, Blevins, and Ellickson (2016). We consider identification of the rate of move arrivals, which was assumed to be known in previous work, as well as a generalized version with heterogeneous move arrival rates. We re-establish conditions for existence of a Markov perfect…

连续时间动态离散博弈的嵌套伪似然估计AI 解读

We introduce a sequential estimator for continuous time dynamic discrete choice models (single-agent models and games) by adapting the nested pseudo likelihood (NPL) estimator of Aguirregabiria and Mira (2002, 2007), developed for discrete time models with discrete time data, to the continuous time case with data sampled either discretely (i.e., uniformly-spaced snapshot data) or continuously. We establish conditions for consistency and asymptotic normality of the estimator,…