Reinforcement Learning Based Computationally Efficient Conditional Choice Simulation Estimation of Dynamic Discrete Choice Models
基于强化学习的高效动态离散选择模型条件选择模拟估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要直接研究动态离散选择模型的收益函数估计,并强调结构解释及反事实政策分析,对应离散选择与结构估计。
基于强化学习的高效动态离散选择模型条件选择模拟估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Dynamic discrete choice (DDC) models have found widespread application in marketing. However, estimating these becomes challenging in "big data" settings with high-dimensional state-action spaces. To address this challenge, this paper develops a Reinforcement Learning (RL)-based two-step ("computationally light") Conditional Choice Simulation (CCS) estimation approach that combines the scalability of machine learning with the transparency, explainability, and interpretability of structural models, which is particularly valuable for counterfactual policy analysis. The method is premised on three insights: (1) the CCS ("forward simulation") approach is a special case of RL algorithms, (2) starting from an initial state-action pair, CCS updates the corresponding value function only after each simulation path has terminated, whereas RL algorithms may update for all the state-action pairs visited along a simulated path, and (3) RL focuses on inferring an agent's optimal policy with known reward functions, whereas DDC models focus on estimating the reward functions presupposing optimal policies. The procedure's computational efficiency over CCS estimation is demonstrated using Monte Carlo simulations with a canonical machine replacement and a consumer food purchase model. Framing CCS estimation of DDC models as an RL problem increases their applicability and scalability to high-dimensional marketing problems while retaining both interpretability and tractability.
大规模需求估计的贝叶斯机器学习方法
This work studies how Bayesian machine learning methods can be used for large-scale demand estimation with many product categories. I compare two model classes, a latent factorization model and a mixed logit model and two Bayesian estimation approaches, Markov Chain Monte Carlo (MCMC) and Variational Inference (VI). The analysis combines a simulation study with an application to supermarket scanner data. The results show that the latent factorization model benefits from…
劳动者侧歧视:信念与偏好
When agents choose among options with unobserved attributes to maximize expected utility, their choices conflate preferences with beliefs about those attributes. We develop a novel theory-driven identification strategy for such settings, showing that compensating differentials separately identify beliefs from preferences. Noting that workers’ preferences and beliefs shape labor market outcomes, yet remain understudied, we apply our method to provide the first evidence on the…
动态离散选择与逆强化学习:从人类行为推断偏好和信念
This article surveys two deeply connected literatures that approach the same fundamental problem from different disciplinary traditions: dynamic discrete choice (DDC) in structural econometrics and inverse reinforcement learning (IRL) in machine learning. Both seek to infer the preferences of decision makers from observed sequential behavior, assuming that individuals act to maximize an expected reward function within a dynamic, uncertain environment formalized as a Markov…
动态处理效应与一般嵌套泛函的自动去偏机器学习
Many canonical models in causal inference and structural econometrics have recursive identification formulas. In causal inference, recursion arises when identification requires both pre- and post-treatment covariates. For example, short-term surrogate outcomes are measured after the treatment, and serve as necessary covariates when identifying long-term effects. Post-treatment covariates are also required for identification of dynamic difference-in-differences designs,…
从联合分析数据学习偏好:结构模型与深度学习的混合方法
Conjoint experiments randomize multidimensional profiles, yet political science applications typically report only nonparametric averages that do not recover counterfactual choices or individual tradeoffs. We develop a hybrid structural approach for recovering individual preferences from conjoint data. The estimator combines a flexible machine-learning mean preference function, via a deep netural network in our applications, with respondent-level empirical-Bayes updating in…
离线逆强化学习与动态离散选择模型的经验风险最小化方法
We study the problem of estimating Dynamic Discrete Choice (DDC) models, also known as offline Maximum Entropy-Regularized Inverse Reinforcement Learning (offline MaxEnt-IRL) in machine learning. The objective is to recover reward or $Q^*$ functions that govern agent behavior from offline behavior data. In this paper, we propose a globally convergent gradient-based method for solving these problems without the restrictive assumption of linearly parameterized rewards. The…