Assortment Optimization under the Multi-Purchase Multinomial Logit Choice Model

Jacob B. Feldman, D. Segev, Huseyin Topaloglu, Laura Wagner, Yicheng Bai
{"title":"Assortment Optimization under the Multi-Purchase Multinomial Logit Choice Model","authors":"Jacob B. Feldman, D. Segev, Huseyin Topaloglu, Laura Wagner, Yicheng Bai","doi":"10.2139/ssrn.3866734","DOIUrl":null,"url":null,"abstract":"Updating a Classic: Assortment Optimization under the Multi-Purchase MNL Model In the paper “Updating a Classic: Assortment Optimization under the Multi-Purchase MNL Model,” our primary contribution resides in proposing the first multi-purchase choice model that can be fully operationalized. Our main algorithmic results consist of two distinct polynomial time approximation schemes (PTAS); the first, and simpler of the two, caters to a setting where each customer may buy only a constant number of products, whereas the second, more nuanced algorithm applies to our multi-purchase model in its general form. Additionally, we study the revenue potential of making assortment decisions that account for multi-purchase behavior in comparison with those that overlook this phenomenon. In particular, we relate both the structure and revenue performance of the optimal assortment under a traditional single-purchase model to that of the optimal assortment in the multi-purchase setting.","PeriodicalId":363330,"journal":{"name":"Computation Theory eJournal","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computation Theory eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3866734","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Updating a Classic: Assortment Optimization under the Multi-Purchase MNL Model In the paper “Updating a Classic: Assortment Optimization under the Multi-Purchase MNL Model,” our primary contribution resides in proposing the first multi-purchase choice model that can be fully operationalized. Our main algorithmic results consist of two distinct polynomial time approximation schemes (PTAS); the first, and simpler of the two, caters to a setting where each customer may buy only a constant number of products, whereas the second, more nuanced algorithm applies to our multi-purchase model in its general form. Additionally, we study the revenue potential of making assortment decisions that account for multi-purchase behavior in comparison with those that overlook this phenomenon. In particular, we relate both the structure and revenue performance of the optimal assortment under a traditional single-purchase model to that of the optimal assortment in the multi-purchase setting.
多重购买多项式Logit选择模型下的分类优化
在“更新经典:多购买MNL模型下的分类优化”这篇论文中,我们的主要贡献在于提出了第一个可以完全操作的多购买选择模型。我们的主要算法结果包括两种不同的多项式时间近似方案(PTAS);第一个算法是两个算法中比较简单的,它适用于每个顾客只购买固定数量的产品的情况,而第二个算法更细致,适用于我们的多购买模型的一般形式。此外,我们还研究了考虑多次购买行为的分类决策与忽视这一现象的分类决策的收入潜力。特别地,我们将传统单次采购模型下的最优分类的结构和收益绩效与多次采购设置下的最优分类的结构和收益绩效联系起来。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信