不确定考虑集下的需求估计

IF 0.7 4区 管理学 Q3 Engineering Military Operations Research Pub Date : 2023-09-04 DOI:10.1287/opre.2022.0006
Srikanth Jagabathula, Dmitry Mitrofanov, Gustavo Vulcano
{"title":"不确定考虑集下的需求估计","authors":"Srikanth Jagabathula, Dmitry Mitrofanov, Gustavo Vulcano","doi":"10.1287/opre.2022.0006","DOIUrl":null,"url":null,"abstract":"In “Demand Estimation Under Uncertain Consideration Sets,” Jagabathula, Mitrofanov, and Vulcano investigate statistical properties of the consider-then-choose (CTC) models, which gained recent attention in the operations literature as an alternative to the classical random utility (RUM) models. The general class of CTC models is defined by a general joint distribution over ranking lists and consideration sets. Starting from the important result that the CTC and RUM classes are equivalent in terms of explanatory power, the authors characterize conditions under which CTC models become identified. Then, they propose expectation-maximization (EM) methods to solve the related estimation problem for different subclasses of CTC models, building from the provably convergent outer-approximation algorithm. Finally, subclasses of CTC models are tested on a synthetic data set and on two real data sets: one from a grocery chain and one from a peer-to-peer (P2P) car sharing platform. The results are consistent in assessing that CTC models tend to dominate RUM models with respect to prediction accuracy when the training data are noisy (i.e., transaction records do not necessarily reflect the physical inventory records) and when there is significant asymmetry between the training data set and the testing data set. These conditions are naturally verified in P2P sharing platforms and in retailers working on long-term forecasts (e.g., semester long) or geographical aggregate forecasts (e.g., forecasts at the distribution center level).","PeriodicalId":49809,"journal":{"name":"Military Operations Research","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2023-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Demand Estimation Under Uncertain Consideration Sets\",\"authors\":\"Srikanth Jagabathula, Dmitry Mitrofanov, Gustavo Vulcano\",\"doi\":\"10.1287/opre.2022.0006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In “Demand Estimation Under Uncertain Consideration Sets,” Jagabathula, Mitrofanov, and Vulcano investigate statistical properties of the consider-then-choose (CTC) models, which gained recent attention in the operations literature as an alternative to the classical random utility (RUM) models. The general class of CTC models is defined by a general joint distribution over ranking lists and consideration sets. Starting from the important result that the CTC and RUM classes are equivalent in terms of explanatory power, the authors characterize conditions under which CTC models become identified. Then, they propose expectation-maximization (EM) methods to solve the related estimation problem for different subclasses of CTC models, building from the provably convergent outer-approximation algorithm. Finally, subclasses of CTC models are tested on a synthetic data set and on two real data sets: one from a grocery chain and one from a peer-to-peer (P2P) car sharing platform. The results are consistent in assessing that CTC models tend to dominate RUM models with respect to prediction accuracy when the training data are noisy (i.e., transaction records do not necessarily reflect the physical inventory records) and when there is significant asymmetry between the training data set and the testing data set. These conditions are naturally verified in P2P sharing platforms and in retailers working on long-term forecasts (e.g., semester long) or geographical aggregate forecasts (e.g., forecasts at the distribution center level).\",\"PeriodicalId\":49809,\"journal\":{\"name\":\"Military Operations Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-09-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Military Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1287/opre.2022.0006\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Military Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/opre.2022.0006","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 3

摘要

在“不确定考虑集下的需求估计”一文中,Jagabathula、Mitrofanov和Vulcano研究了考虑-选择(CTC)模型的统计特性,该模型作为经典随机效用(RUM)模型的替代方案在操作文献中引起了最近的关注。CTC模型的一般类别由排名表和考虑集上的一般联合分布定义。从CTC和RUM类在解释力方面是等效的这一重要结果出发,作者描述了CTC模型被识别的条件。然后,他们提出了期望最大化(EM)方法,以可证明收敛的外逼近算法为基础,解决CTC模型不同子类的相关估计问题。最后,在一个合成数据集和两个真实数据集上测试了CTC模型的子类:一个来自杂货店连锁店,一个来自点对点(P2P)汽车共享平台。当训练数据有噪声时(即,交易记录不一定反映实际库存记录),当训练数据集和测试数据集之间存在显著的不对称性时,评估CTC模型在预测准确性方面往往优于RUM模型的结果是一致的。这些条件在P2P共享平台和从事长期预测(例如,学期)或地理汇总预测(例如,配送中心级别的预测)的零售商中自然得到验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Demand Estimation Under Uncertain Consideration Sets
In “Demand Estimation Under Uncertain Consideration Sets,” Jagabathula, Mitrofanov, and Vulcano investigate statistical properties of the consider-then-choose (CTC) models, which gained recent attention in the operations literature as an alternative to the classical random utility (RUM) models. The general class of CTC models is defined by a general joint distribution over ranking lists and consideration sets. Starting from the important result that the CTC and RUM classes are equivalent in terms of explanatory power, the authors characterize conditions under which CTC models become identified. Then, they propose expectation-maximization (EM) methods to solve the related estimation problem for different subclasses of CTC models, building from the provably convergent outer-approximation algorithm. Finally, subclasses of CTC models are tested on a synthetic data set and on two real data sets: one from a grocery chain and one from a peer-to-peer (P2P) car sharing platform. The results are consistent in assessing that CTC models tend to dominate RUM models with respect to prediction accuracy when the training data are noisy (i.e., transaction records do not necessarily reflect the physical inventory records) and when there is significant asymmetry between the training data set and the testing data set. These conditions are naturally verified in P2P sharing platforms and in retailers working on long-term forecasts (e.g., semester long) or geographical aggregate forecasts (e.g., forecasts at the distribution center level).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Military Operations Research
Military Operations Research 管理科学-运筹学与管理科学
CiteScore
1.00
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: Military Operations Research is a peer-reviewed journal of high academic quality. The Journal publishes articles that describe operations research (OR) methodologies and theories used in key military and national security applications. Of particular interest are papers that present: Case studies showing innovative OR applications Apply OR to major policy issues Introduce interesting new problems areas Highlight education issues Document the history of military and national security OR.
期刊最新文献
Optimal Routing Under Demand Surges: The Value of Future Arrival Rates Demand Estimation Under Uncertain Consideration Sets Optimal Routing to Parallel Servers in Heavy Traffic The When and How of Delegated Search A Data-Driven Approach to Beating SAA Out of Sample
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1