Equilibrium-Constrained Estimation of Recursive Logit Choice Models
递归 Logit 选择模型的均衡约束估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要直接研究递归 Logit 序贯离散选择模型,并联合估计结构参数与值函数。
递归 Logit 选择模型的均衡约束估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
The recursive logit (RL) model provides a flexible framework for modeling sequential decision-making in transportation and choice networks, with important applications in route choice analysis, multiple discrete choice problems, and activity-based travel demand modeling. Despite its versatility, estimation of the RL model typically relies on nested fixed-point (NFXP) algorithms that are computationally expensive and prone to numerical instability. We propose a new approach that reformulates the maximum likelihood estimation problem as an optimization problem with equilibrium constraints, where both the structural parameters and the value functions are treated as decision variables. We further show that this formulation can be equivalently transformed into a conic optimization problem with exponential cones, enabling efficient solution using modern conic solvers such as MOSEK. Experiments on synthetic and real-world datasets demonstrate that our convex reformulation achieves accuracy comparable to traditional methods while offering significant improvements in computational stability and efficiency, thereby providing a practical and scalable alternative for recursive logit model estimation.
含未观测异质性与策略互动的网络形成模型两步估计
In this paper, I characterize the network formation process as a static game of incomplete information, where the latent payoff of forming a link between two individuals depends on the structure of the network, as well as private information on agents' attributes. I allow agents' private unobserved attributes to be correlated with observed attributes through individual fixed effects. Using data from a single large network, I propose a two-step estimator for the model…
大型超模博弈的情景抽样
This paper introduces a simulation algorithm for evaluating the log-likelihood function of a large supermodular binary-action game. Covered examples include (certain types of) peer effect, technology adoption, strategic network formation, and multi-market entry games. More generally, the algorithm facilitates simulated maximum likelihood (SML) estimation of games with large numbers of players, $T$, and/or many binary actions per player, $M$ (e.g., games with tens of…
行程观测不完整时递归路径选择模型的估计
This work concerns the estimation of recursive route choice models in the situation that the trip observations are incomplete, i.e., there are unconnected links (or nodes) in the observations. A direct approach to handle this issue would be intractable because enumerating all paths between unconnected links (or nodes) in a real network is typically not possible. We exploit an expectation-maximization (EM) method that allows to deal with the missing-data issue by…
利用新古典消费者选择理论从购买数据构建市场图谱
This article presents a new model for estimating the spatial representation of objects and preference vectors from actual choice behavior of individuals or households. It is based on neoclassical economic theory of consumer choice. The model integrates both decisions of which good(s) to buy and the quantity of purchase. Overall preference is decomposed into price effects and intrinsic preference for the good. A maximum likelihood method for estimating the model parameters is…
理性疏忽—加性随机效用模型的估计
This paper develops likelihood-based estimation for parametric rational inattention--additive random utility models. We establish consistency and asymptotic normality of the exact maximum likelihood estimator and provide conditions under which the simulated estimator shares its asymptotic distribution. To implement estimation, we develop Newton--BA, a KKT-guided hybrid of Newton--Raphson and Blahut--Arimoto (BA). The algorithm accommodates both interior and boundary…
扰动效用模型的 Fenchel–Young 估计量
Perturbed Utility Models (PUMs) represent discrete choice as utility maximization under convex perturbation or regularization, encompassing a broad class of choice models, including Multinomial Logit (MNL) and models that permit zero choice probabilities. Because, for general perturbations, maximum likelihood may be non-convex, and the negative log-likelihood is infinite when a sparse model assigns zero probability to an observed choice, we specialize the Fenchel--Young…