Duality in dynamic discrete-choice models
动态离散选择模型中的对偶性AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:题名与摘要明确研究动态离散选择模型的收益识别及两步结构估计。
动态离散选择模型中的对偶性AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Using results from Convex Analysis, we investigate a novel approach to identification and estimation of discrete-choice models that we call the mass transport approach. We show that the conditional choice probabilities and the choice-specific payoffs in these models are related in the sense of conjugate duality, and that the identification problem is a mass transport problem. Based on this, we propose a new two-step estimator for these models; interestingly, the first step of our estimator involves solving a linear program that is identical to the classic assignment (two-sided matching) game of Shapley and Shubik (1971). The application of convex-analytic tools to dynamic discrete-choice models and the connection with two-sided matching models is new in the literature. Monte Carlo results demonstrate the good performance of this estimator, and we provide an empirical application based on Rust's (1987) bus engine replacement model.