首页 > 最新文献

Manufacturing & Service Operations Management最新文献

英文 中文
Erratum: Correction of Affiliation 勘误:隶属关系更正
Pub Date : 2022-06-23 DOI: 10.1287/msom.2022.1121
{"title":"Erratum: Correction of Affiliation","authors":"","doi":"10.1287/msom.2022.1121","DOIUrl":"https://doi.org/10.1287/msom.2022.1121","url":null,"abstract":"","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128374893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MSOM Society Student Paper Competition: Abstracts of 2021 Winners MSOM协会学生论文竞赛:2021年获奖者摘要
Pub Date : 2022-05-01 DOI: 10.1287/msom.2013.0467
Ashish Kabra, D. Sabán, Fei Gao, Tugce G. Martagan, Hummy Song, Şafak Yücel
The journal is pleased to publish the abstracts of the six finalists of the 2021 Manufacturing and Service Operations Management Society’s student paper competition. The 2021 prize committee was chaired by Vishal Agrawal (Georgetown University), Florin Ciocan (INSEAD), and Yanchong Zheng (Massachusetts Institute of Technology). The judges were Adam Elmachtoub, Adem Orsdemir, Amrita Kundu, Antoine Desir, Anyan Qi, Arian Aflaki, Arzum Akkas, Ashish Kabra, Bin Hu, Bora Keskin, Brent Moritz, Can Zhang, Chloe Kim Glaeser, Dan Iancu, Daniel Freund, Daniel Lin, Daniela Saban, David F. Drake, Dawson Kaaua, Divya Singhvi, Ekaterina Astashkina, Elena Belavina, Elodie Adida, Enis Kayis, Ersin Korpeoglu, Evgeny Kagan, Fabian Sting, Fanyin Zheng, Fei Gao, Fernanda Bravo, Francisco Castro, Georgina Hall, Gonzalo Romero, Guangwen Kong, Guoming Lai, Hamsa Bastani, Hessam Bavafa, Hummy Song, Ioannis (Yannis) Stamatopoulos, Ioannis Bellos, Iris Wang, Jake Feldman, Jason Acimovic, Jiankun Sun, Jiaru Bai, John Silberholz, Joline Uichanco, Jonas Oddur Jonasson, Jose Guajardo, Kaitlin Daniels, Kenan Arifoglu, Lennart Baardman, Leon Valdes, Lesley Meng, Luyi Gui, Luyi Yang, Mary Parkinson, Mazhar Arikan, Mehmet Ayvaci, Miao Bai, Michael Freeman, Ming Hu, Morvarid Rahmani, Mumin Kurtulus, Nan Yang, Nektarios Oraiopoulos, Nikhil Garg, Nil Karacaoglu, Nitin Bakshi, Nur Sunar, Olga Perdikaki, Ovunc Yilmaz, Ozan Candogan, Ozge Sahin, Panos Markou, Pascale Crama, Pengyi Shi, Pnina Feldman, Qiuping Yu, Renyu Zhang, Ruslan Momot, Ruth Beer, Ruxian Wang, Saed Alizamir, Safak Yucel, Samantha Keppler, Sanjith Gopalakrishnan, Santiago Gallino, Sarah Yini Gao, Sebastien Martin, Serdar Simsek, Seyed Emadi, Shima Nassiri, Shouqiang Wang, Siddharth Singh, Simone Marinesi, So Yeon Chun, Somya Singhvi, Song-Hee Kim, Soo-Haeng Cho, Soroush Saghafian, Sriram Dasu, Stefanus Jasin, Stephen Leider, Suresh Muthulingam, Suvrat Dhanorkar, Tian Chan, Tim Kraft, Tom TAN, Tugce Martagan, Velibor Misic, Vishal Gupta, Weiming Zhu, Xiajun Amy Pan, Xiaoshan Peng, Xiaoyang Long, Yangfang (Helen) Zhou, Yehua Wei, Yiangos Papanastasiou, Ying-Ju Chen, Yinghao Zhang, Yoni Gur, Yuqian Xu, Zhaohui (Zoey) Jiang, Zumbul Atan.
该杂志很高兴地发表了2021年制造和服务运营管理学会学生论文竞赛的六名决赛选手的摘要。2021年的评奖委员会由Vishal Agrawal(乔治城大学)、Florin Ciocan(欧洲工商管理学院)和郑岩冲(麻省理工学院)担任主席。评委有Adam Elmachtoub, Adem Orsdemir, Amrita Kundu, Antoine Desir, Anyan Qi, Arian Aflaki, Arzum Akkas, Ashish Kabra, Bin Hu, Bora Keskin, Brent Moritz, Can Zhang, Chloe Kim Glaeser, Dan Iancu, Daniel Freund, Daniel Lin, Daniela Saban, David F. Drake, Dawson Kaaua, Divya Singhvi, Ekaterina Astashkina, Elena Belavina, Elodie Adida, Enis Kayis, Ersin Korpeoglu, Evgeny Kagan, Fabian Sting, Fanyin Zheng, Fei Gao, Fernanda Bravo, Francisco Castro, Georgina Hall, Gonzalo Romero,孔光文、莱国明、Hamsa Bastani、Hessam Bavafa、Hummy Song、Ioannis (Yannis) Stamatopoulos、Ioannis Bellos、Iris Wang、Jake Feldman、Jason Acimovic、孙建坤、白家如、John Silberholz、Joline uicanco、Jonas Oddur Jonasson、Jose Guajardo、Kaitlin Daniels、Kenan Arifoglu、Lennart Baardman、Leon Valdes、Lesley Meng、Luyi Gui、Luyi Yang、Mary Parkinson、Mazhar Arikan、Mehmet Ayvaci、Miao Bai、Michael Freeman、Ming Hu、Morvarid Rahmani、Mumin Kurtulus、Nan Yang、Nektarios Oraiopoulos、Nikhil Garg、Nil Karacaoglu、Nitin Bakshi、Nur Sunar、Olga Perdikaki、Ovunc Yilmaz、Ozan Candogan、Ozge Sahin、Panos Markou、Pascale Crama、Pnina Feldman、于秋平、张仁宇、Ruslan Momot、Ruth Beer、王如贤、Saed Alizamir、Safak yuel、Samantha Keppler、Sanjith Gopalakrishnan、Santiago Gallino、Sarah Yini Gao、Sebastien Martin、Serdar Simsek、Seyed Emadi、Shima Nassiri、王守强、Siddharth Singh、Simone Marinesi、So Yeon Chun、Somya Singhvi、Kim Song-Hee, Cho Soo-Haeng, Soroush Saghafian, Sriram Dasu, Stefanus Jasin, Stephen Leider, Suresh Muthulingam, Suvrat Dhanorkar, Chan Tian, Tim Kraft, Tom TAN, Tugce Martagan, Velibor Misic, Vishal Gupta,朱伟明,潘夏君,彭晓山,龙晓阳,周阳芳,Wei Yehua, Yiangos Papanastasiou,陈英居,张英豪,Gur Yoni,徐玉倩,蒋朝辉,Zumbul Atan。
{"title":"MSOM Society Student Paper Competition: Abstracts of 2021 Winners","authors":"Ashish Kabra, D. Sabán, Fei Gao, Tugce G. Martagan, Hummy Song, Şafak Yücel","doi":"10.1287/msom.2013.0467","DOIUrl":"https://doi.org/10.1287/msom.2013.0467","url":null,"abstract":"The journal is pleased to publish the abstracts of the six finalists of the 2021 Manufacturing and Service Operations Management Society’s student paper competition. The 2021 prize committee was chaired by Vishal Agrawal (Georgetown University), Florin Ciocan (INSEAD), and Yanchong Zheng (Massachusetts Institute of Technology). The judges were Adam Elmachtoub, Adem Orsdemir, Amrita Kundu, Antoine Desir, Anyan Qi, Arian Aflaki, Arzum Akkas, Ashish Kabra, Bin Hu, Bora Keskin, Brent Moritz, Can Zhang, Chloe Kim Glaeser, Dan Iancu, Daniel Freund, Daniel Lin, Daniela Saban, David F. Drake, Dawson Kaaua, Divya Singhvi, Ekaterina Astashkina, Elena Belavina, Elodie Adida, Enis Kayis, Ersin Korpeoglu, Evgeny Kagan, Fabian Sting, Fanyin Zheng, Fei Gao, Fernanda Bravo, Francisco Castro, Georgina Hall, Gonzalo Romero, Guangwen Kong, Guoming Lai, Hamsa Bastani, Hessam Bavafa, Hummy Song, Ioannis (Yannis) Stamatopoulos, Ioannis Bellos, Iris Wang, Jake Feldman, Jason Acimovic, Jiankun Sun, Jiaru Bai, John Silberholz, Joline Uichanco, Jonas Oddur Jonasson, Jose Guajardo, Kaitlin Daniels, Kenan Arifoglu, Lennart Baardman, Leon Valdes, Lesley Meng, Luyi Gui, Luyi Yang, Mary Parkinson, Mazhar Arikan, Mehmet Ayvaci, Miao Bai, Michael Freeman, Ming Hu, Morvarid Rahmani, Mumin Kurtulus, Nan Yang, Nektarios Oraiopoulos, Nikhil Garg, Nil Karacaoglu, Nitin Bakshi, Nur Sunar, Olga Perdikaki, Ovunc Yilmaz, Ozan Candogan, Ozge Sahin, Panos Markou, Pascale Crama, Pengyi Shi, Pnina Feldman, Qiuping Yu, Renyu Zhang, Ruslan Momot, Ruth Beer, Ruxian Wang, Saed Alizamir, Safak Yucel, Samantha Keppler, Sanjith Gopalakrishnan, Santiago Gallino, Sarah Yini Gao, Sebastien Martin, Serdar Simsek, Seyed Emadi, Shima Nassiri, Shouqiang Wang, Siddharth Singh, Simone Marinesi, So Yeon Chun, Somya Singhvi, Song-Hee Kim, Soo-Haeng Cho, Soroush Saghafian, Sriram Dasu, Stefanus Jasin, Stephen Leider, Suresh Muthulingam, Suvrat Dhanorkar, Tian Chan, Tim Kraft, Tom TAN, Tugce Martagan, Velibor Misic, Vishal Gupta, Weiming Zhu, Xiajun Amy Pan, Xiaoshan Peng, Xiaoyang Long, Yangfang (Helen) Zhou, Yehua Wei, Yiangos Papanastasiou, Ying-Ju Chen, Yinghao Zhang, Yoni Gur, Yuqian Xu, Zhaohui (Zoey) Jiang, Zumbul Atan.","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131080720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Acknowledgment to Editors and Reviewers (2021) 对编辑和审稿人的感谢(2021)
Pub Date : 2022-05-01 DOI: 10.1287/msom.2017.0632
The continued success of Manufacturing & Service Operations Management (M&SOM) relies on the support of authors and reviewers. On behalf of M&SOM, I would like to express my sincere appreciation to the department editors, guest editors, associate editors, guest associate editors, and reviewers who provided expert counsel and guidance on a voluntary basis. The following list acknowledges those who served from January to December 2021. Through their efforts, the journal was able to provide submitting authors with timely, thoughtful, and constructive reviews. I hereby acknowledge their service for the journal and gratefully appreciate their contributions for our profession. Georgia Perakis, M&SOM editor
制造与服务运营管理(M&SOM)的持续成功依赖于作者和审稿人的支持。在此,我谨代表M&SOM向自愿提供专家咨询和指导的部门编辑、客座编辑、副编辑、客座副编辑和审稿人表示衷心的感谢。以下名单承认在2021年1月至12月期间服役的人员。通过他们的努力,该杂志能够为投稿作者提供及时、周到和建设性的评论。我在此感谢他们对杂志的服务,感谢他们对我们职业的贡献。Georgia Perakis, M&SOM编辑
{"title":"Acknowledgment to Editors and Reviewers (2021)","authors":"","doi":"10.1287/msom.2017.0632","DOIUrl":"https://doi.org/10.1287/msom.2017.0632","url":null,"abstract":"The continued success of Manufacturing & Service Operations Management (M&SOM) relies on the support of authors and reviewers. On behalf of M&SOM, I would like to express my sincere appreciation to the department editors, guest editors, associate editors, guest associate editors, and reviewers who provided expert counsel and guidance on a voluntary basis. The following list acknowledges those who served from January to December 2021. Through their efforts, the journal was able to provide submitting authors with timely, thoughtful, and constructive reviews. I hereby acknowledge their service for the journal and gratefully appreciate their contributions for our profession. Georgia Perakis, M&SOM editor","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130953870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Demand Learning and Pricing for Varying Assortments 不同分类的需求学习与定价
Pub Date : 2022-03-14 DOI: 10.1287/msom.2022.1080
K. Ferreira, Emily Mower
Problem definition: We consider the problem of demand learning and pricing for retailers who offer assortments of substitutable products that change frequently, for example, due to limited inventory, perishable or time-sensitive products, or the retailer’s desire to frequently offer new styles. Academic/practical relevance: We are one of the first to consider the demand learning and pricing problem for retailers who offer product assortments that change frequently, and we propose and implement a learn-then-earn algorithm for use in this setting. Our algorithm prioritizes a short learning phase, an important practical characteristic that is only considered by few other algorithms. Methodology: We develop a novel demand learning and pricing algorithm that learns quickly in an environment with varying assortments and limited price changes by adapting the commonly used marketing technique of conjoint analysis to our setting. We partner with Zenrez, an e-commerce company that partners with fitness studios to sell excess capacity of fitness classes, to implement our algorithm in a controlled field experiment to evaluate its effectiveness in practice using the synthetic control method. Results: Relative to a control group, our algorithm led to an expected initial dip in revenue during the learning phase, followed by a sustained and significant increase in average daily revenue of 14%–18% throughout the earning phase, illustrating that our algorithmic contributions can make a significant impact in practice. Managerial implications: The theoretical benefit of demand learning and pricing algorithms is well understood—they allow retailers to optimally match supply and demand in the face of uncertain preseason demand. However, most existing demand learning and pricing algorithms require substantial sales volume and the ability to change prices frequently for each product. Our work provides retailers who do not have this luxury a powerful demand learning and pricing algorithm that has been proven in practice.
问题定义:我们考虑零售商的需求学习和定价问题,这些零售商提供频繁变化的可替代产品,例如,由于库存有限,易腐烂或时间敏感的产品,或者零售商希望经常提供新款式。学术/实践相关性:对于提供频繁变化的产品分类的零售商,我们是第一个考虑需求学习和定价问题的人之一,我们提出并实现了一个用于此设置的先学习后学习算法。我们的算法优先考虑短学习阶段,这是其他算法很少考虑的重要实用特征。方法:我们开发了一种新的需求学习和定价算法,该算法通过将常用的联合分析营销技术应用于我们的设置,在不同种类和有限价格变化的环境中快速学习。我们与Zenrez(一家与健身工作室合作销售健身课程过剩容量的电子商务公司)合作,在控制现场实验中实施我们的算法,使用综合控制方法评估其在实践中的有效性。结果:与对照组相比,我们的算法在学习阶段导致预期的初始收入下降,随后在整个盈利阶段平均每日收入持续显著增长14%-18%,这表明我们的算法贡献可以在实践中产生重大影响。管理意义:需求学习和定价算法的理论好处是很容易理解的——它们允许零售商在面对不确定的季前需求时最佳地匹配供需。然而,大多数现有的需求学习和定价算法需要大量的销售量和对每种产品频繁更改价格的能力。我们的工作为那些没有这种奢侈品的零售商提供了一个强大的需求学习和定价算法,该算法已经在实践中得到了证明。
{"title":"Demand Learning and Pricing for Varying Assortments","authors":"K. Ferreira, Emily Mower","doi":"10.1287/msom.2022.1080","DOIUrl":"https://doi.org/10.1287/msom.2022.1080","url":null,"abstract":"Problem definition: We consider the problem of demand learning and pricing for retailers who offer assortments of substitutable products that change frequently, for example, due to limited inventory, perishable or time-sensitive products, or the retailer’s desire to frequently offer new styles. Academic/practical relevance: We are one of the first to consider the demand learning and pricing problem for retailers who offer product assortments that change frequently, and we propose and implement a learn-then-earn algorithm for use in this setting. Our algorithm prioritizes a short learning phase, an important practical characteristic that is only considered by few other algorithms. Methodology: We develop a novel demand learning and pricing algorithm that learns quickly in an environment with varying assortments and limited price changes by adapting the commonly used marketing technique of conjoint analysis to our setting. We partner with Zenrez, an e-commerce company that partners with fitness studios to sell excess capacity of fitness classes, to implement our algorithm in a controlled field experiment to evaluate its effectiveness in practice using the synthetic control method. Results: Relative to a control group, our algorithm led to an expected initial dip in revenue during the learning phase, followed by a sustained and significant increase in average daily revenue of 14%–18% throughout the earning phase, illustrating that our algorithmic contributions can make a significant impact in practice. Managerial implications: The theoretical benefit of demand learning and pricing algorithms is well understood—they allow retailers to optimally match supply and demand in the face of uncertain preseason demand. However, most existing demand learning and pricing algorithms require substantial sales volume and the ability to change prices frequently for each product. Our work provides retailers who do not have this luxury a powerful demand learning and pricing algorithm that has been proven in practice.","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115033843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Robust and Heterogenous Odds Ratio: Estimating Price Sensitivity for Unbought Items 稳健性和异质性优势比:估计未购买物品的价格敏感性
Pub Date : 2021-06-21 DOI: 10.1287/msom.2022.1118
J. Pauphilet
Problem definition: Mining for heterogeneous responses to an intervention is a crucial step for data-driven operations, for instance, to personalize treatment or pricing. We investigate how to estimate price sensitivity from transaction-level data. In causal inference terms, we estimate heterogeneous treatment effects when (a) the response to treatment (here, whether a customer buys a product) is binary, and (b) treatment assignments are partially observed (here, full information is only available for purchased items). Methodology/Results: We propose a recursive partitioning procedure to estimate heterogeneous odds ratio, a widely used measure of treatment effect in medicine and social sciences. We integrate an adversarial imputation step to allow for robust estimation even in presence of partially observed treatment assignments. We validate our methodology on synthetic data and apply it to three case studies from political science, medicine, and revenue management. Managerial implications: Our robust heterogeneous odds ratio estimation method is a simple and intuitive tool to quantify heterogeneity in patients or customers and personalize interventions, while lifting a central limitation in many revenue management data.
问题定义:挖掘对干预措施的异构响应是数据驱动操作的关键步骤,例如,个性化治疗或定价。我们研究如何从交易级数据估计价格敏感性。在因果推理方面,当(a)对处理的反应(这里,客户是否购买产品)是二元的,以及(b)处理分配是部分观察到的(这里,完整的信息仅适用于购买的物品),我们估计异质处理效果。方法/结果:我们提出了一个递归分割程序来估计异质性优势比,这是医学和社会科学中广泛使用的治疗效果衡量标准。我们整合了一个对抗的估算步骤,即使在部分观察到的治疗分配存在的情况下,也允许稳健的估计。我们在综合数据上验证了我们的方法,并将其应用于政治学、医学和收入管理的三个案例研究。管理意义:我们稳健的异质性优势比估计方法是一种简单直观的工具,可以量化患者或客户的异质性,并个性化干预措施,同时消除了许多收入管理数据中的核心限制。
{"title":"Robust and Heterogenous Odds Ratio: Estimating Price Sensitivity for Unbought Items","authors":"J. Pauphilet","doi":"10.1287/msom.2022.1118","DOIUrl":"https://doi.org/10.1287/msom.2022.1118","url":null,"abstract":"Problem definition: Mining for heterogeneous responses to an intervention is a crucial step for data-driven operations, for instance, to personalize treatment or pricing. We investigate how to estimate price sensitivity from transaction-level data. In causal inference terms, we estimate heterogeneous treatment effects when (a) the response to treatment (here, whether a customer buys a product) is binary, and (b) treatment assignments are partially observed (here, full information is only available for purchased items). Methodology/Results: We propose a recursive partitioning procedure to estimate heterogeneous odds ratio, a widely used measure of treatment effect in medicine and social sciences. We integrate an adversarial imputation step to allow for robust estimation even in presence of partially observed treatment assignments. We validate our methodology on synthetic data and apply it to three case studies from political science, medicine, and revenue management. Managerial implications: Our robust heterogeneous odds ratio estimation method is a simple and intuitive tool to quantify heterogeneity in patients or customers and personalize interventions, while lifting a central limitation in many revenue management data.","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123655151","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Multi-purchase Behavior: Modeling, Estimation, and Optimization 多重购买行为:建模、估计和优化
Pub Date : 2020-06-14 DOI: 10.1287/msom.2020.0238
Theja Tulabandhula, Deeksha Sinha, Saketh Reddy Karra, Prasoon Patidar
Problem definition: We study the problem of modeling purchase of multiple products and using it to display optimized recommendations for online retailers and e-commerce platforms. Rich modeling of users and fast computation of optimal products to display given these models can lead to significantly higher revenues and simultaneously enhance the user experience. Methodology/results: We present a parsimonious multi-purchase family of choice models called the BundleMVL-K family and develop a binary search based iterative strategy that efficiently computes optimized recommendations for this model. We establish the hardness of computing optimal recommendation sets and derive several structural properties of the optimal solution that aid in speeding up computation. This is one of the first attempts at operationalizing multi-purchase class of choice models. We show one of the first quantitative links between modeling multiple purchase behavior and revenue gains. The efficacy of our modeling and optimization techniques compared with competing solutions is shown using several real-world data sets on multiple metrics such as model fitness, expected revenue gains, and run-time reductions. For example, the expected revenue benefit of taking multiple purchases into account is observed to be [Formula: see text] in relative terms for the Ta Feng and UCI shopping data sets compared with the multinomial choice model for instances with ∼1,500 products. Additionally, across six real-world data sets, the test log-likelihood fits of our models are on average 17% better in relative terms. Managerial implications: Our work contributes to the study of multi-purchase decisions, analyzing consumer demand, and the retailers optimization problem. The simplicity of our models and the iterative nature of our optimization technique allows practitioners meet stringent computational constraints while increasing their revenues in practical recommendation applications at scale, especially in e-commerce platforms and other marketplaces. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2020.0238 .
问题定义:我们研究了多种产品购买的建模问题,并使用它来显示在线零售商和电子商务平台的优化推荐。丰富的用户建模和基于这些模型的最佳产品展示的快速计算可以显著提高收入,同时增强用户体验。方法/结果:我们提出了一个简约的多购买选择模型族,称为BundleMVL-K族,并开发了一个基于二进制搜索的迭代策略,有效地计算该模型的优化推荐。我们建立了计算最优推荐集的硬度,并推导了最优解的几个结构性质,有助于加快计算速度。这是将多购买类选择模型操作化的第一次尝试之一。我们展示了建模多重购买行为和收益收益之间的第一个定量联系。与竞争解决方案相比,我们的建模和优化技术的有效性通过多个度量指标(如模型适应度、预期收入增长和运行时间减少)的几个真实数据集来展示。例如,与具有~ 1,500种产品的多项选择模型相比,将多次购买考虑在内的预期收入效益在Ta Feng和UCI购物数据集中被观察到为[公式:见文本]。此外,在六个真实世界的数据集中,我们模型的测试对数似然拟合相对而言平均好17%。管理启示:我们的工作有助于研究多重购买决策,分析消费者需求,以及零售商优化问题。我们模型的简单性和优化技术的迭代性使从业者能够满足严格的计算约束,同时在大规模的实际推荐应用中增加收入,特别是在电子商务平台和其他市场中。补充材料:在线附录可在https://doi.org/10.1287/msom.2020.0238上获得。
{"title":"Multi-purchase Behavior: Modeling, Estimation, and Optimization","authors":"Theja Tulabandhula, Deeksha Sinha, Saketh Reddy Karra, Prasoon Patidar","doi":"10.1287/msom.2020.0238","DOIUrl":"https://doi.org/10.1287/msom.2020.0238","url":null,"abstract":"Problem definition: We study the problem of modeling purchase of multiple products and using it to display optimized recommendations for online retailers and e-commerce platforms. Rich modeling of users and fast computation of optimal products to display given these models can lead to significantly higher revenues and simultaneously enhance the user experience. Methodology/results: We present a parsimonious multi-purchase family of choice models called the BundleMVL-K family and develop a binary search based iterative strategy that efficiently computes optimized recommendations for this model. We establish the hardness of computing optimal recommendation sets and derive several structural properties of the optimal solution that aid in speeding up computation. This is one of the first attempts at operationalizing multi-purchase class of choice models. We show one of the first quantitative links between modeling multiple purchase behavior and revenue gains. The efficacy of our modeling and optimization techniques compared with competing solutions is shown using several real-world data sets on multiple metrics such as model fitness, expected revenue gains, and run-time reductions. For example, the expected revenue benefit of taking multiple purchases into account is observed to be [Formula: see text] in relative terms for the Ta Feng and UCI shopping data sets compared with the multinomial choice model for instances with ∼1,500 products. Additionally, across six real-world data sets, the test log-likelihood fits of our models are on average 17% better in relative terms. Managerial implications: Our work contributes to the study of multi-purchase decisions, analyzing consumer demand, and the retailers optimization problem. The simplicity of our models and the iterative nature of our optimization technique allows practitioners meet stringent computational constraints while increasing their revenues in practical recommendation applications at scale, especially in e-commerce platforms and other marketplaces. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2020.0238 .","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132611411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
How Advance Sales Can Reduce Profits: When to Buy, When to Sell, and What Price to Charge 提前销售如何降低利润:什么时候买,什么时候卖,收取什么价格
Pub Date : 2019-12-05 DOI: 10.1287/msom.2023.1218
A. Glazer, Refael Hassin, Irit Nowik
Problem definition: Consider consumers who prefer to consume a good later rather than earlier. If the price is constant, then we would expect consumers to wait to buy the good. That does not hold if consumers are concerned that others will buy the good early, so that a shortage will later occur. When will consumers arrive when they fear a shortage? What is the profit-maximizing policy of a monopolist? Might the firm lose profits by offering advance sales? The timing of consumer arrivals is much studied. Little consideration, however, has addressed how anticipated shortages affect arrival times. The application is important: managers want to know when consumers will arrive, when they should make the product available, and what price to charge to maximize profits. Methodology/results: We use game theory. We analyze analytically outcomes when a single item is for sale: we give closed solutions for the equilibrium customer behavior and profit-maximizing firm strategy and conduct sensitivity analysis. For generalization concerning more than one unit, we give some analytical results and provide many numerical solutions. When the price is constant over time, then even with no operating cost of doing so, offering advance sales reduces profits. If, however, the firm must offer both advance sales and later sales, then the profit-maximizing price induces all arrivals at the same time (either early or late, depending on the parameters). An increase in the number of units offered for sale increases the profit-maximizing price and increases the firm’s expected profit. The equilibrium strategy of consumers can generate some unexpected behavior. The arrival rate may increase with the price of the good. For a given price, an increase in the number of units for sale increases the number of consumers who arrive early. Managerial implications: The firm should offer the good only at the time consumers most desire it, and not earlier. Additionally, the profit-maximizing price can be derived from our analysis. This price is not the price which maximizes the expected number of arrivals. Funding: This work was supported by the Israel Science Foundation [Grant 852/22]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.1218 .
问题定义:考虑那些喜欢晚消费而不是早消费的消费者。如果价格不变,那么我们可以预期消费者会等待购买商品。如果消费者担心其他人会提前购买商品,这样就会出现短缺,那么这种说法就站不住脚了。当消费者担心短缺时,他们什么时候会来?垄断者的利润最大化政策是什么?公司是否会因为提前销售而损失利润?消费者到达的时间得到了很多研究。然而,很少有人考虑到预期的短缺会如何影响到达时间。这个应用很重要:管理者想知道消费者什么时候会来,他们什么时候应该提供产品,以及收取什么价格才能使利润最大化。方法/结果:我们使用博弈论。我们分析单个商品出售时的分析结果:我们给出均衡顾客行为和利润最大化企业战略的封闭解,并进行敏感性分析。对于多单位的推广,我们给出了一些解析结果,并给出了许多数值解。如果价格在一段时间内保持不变,那么即使这样做没有运营成本,提前销售也会减少利润。然而,如果公司必须同时提供提前销售和后期销售,那么利润最大化的价格会导致所有人同时到达(或早或晚,取决于参数)。销售单位数量的增加增加了利润最大化的价格,增加了公司的预期利润。消费者的均衡策略会产生一些意想不到的行为。到货率可能随着商品价格的增加而增加。对于给定的价格,销售数量的增加会增加提前到达的消费者数量。管理启示:公司应该只在消费者最需要的时候提供产品,而不是更早。此外,从我们的分析中可以得出利润最大化的价格。这个价格并不是使预期到达人数最大化的价格。资助:本研究由以色列科学基金会资助[Grant 852/22]。补充材料:在线附录可在https://doi.org/10.1287/msom.2023.1218上获得。
{"title":"How Advance Sales Can Reduce Profits: When to Buy, When to Sell, and What Price to Charge","authors":"A. Glazer, Refael Hassin, Irit Nowik","doi":"10.1287/msom.2023.1218","DOIUrl":"https://doi.org/10.1287/msom.2023.1218","url":null,"abstract":"Problem definition: Consider consumers who prefer to consume a good later rather than earlier. If the price is constant, then we would expect consumers to wait to buy the good. That does not hold if consumers are concerned that others will buy the good early, so that a shortage will later occur. When will consumers arrive when they fear a shortage? What is the profit-maximizing policy of a monopolist? Might the firm lose profits by offering advance sales? The timing of consumer arrivals is much studied. Little consideration, however, has addressed how anticipated shortages affect arrival times. The application is important: managers want to know when consumers will arrive, when they should make the product available, and what price to charge to maximize profits. Methodology/results: We use game theory. We analyze analytically outcomes when a single item is for sale: we give closed solutions for the equilibrium customer behavior and profit-maximizing firm strategy and conduct sensitivity analysis. For generalization concerning more than one unit, we give some analytical results and provide many numerical solutions. When the price is constant over time, then even with no operating cost of doing so, offering advance sales reduces profits. If, however, the firm must offer both advance sales and later sales, then the profit-maximizing price induces all arrivals at the same time (either early or late, depending on the parameters). An increase in the number of units offered for sale increases the profit-maximizing price and increases the firm’s expected profit. The equilibrium strategy of consumers can generate some unexpected behavior. The arrival rate may increase with the price of the good. For a given price, an increase in the number of units for sale increases the number of consumers who arrive early. Managerial implications: The firm should offer the good only at the time consumers most desire it, and not earlier. Additionally, the profit-maximizing price can be derived from our analysis. This price is not the price which maximizes the expected number of arrivals. Funding: This work was supported by the Israel Science Foundation [Grant 852/22]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.1218 .","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127994190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Manufacturing & Service Operations Management
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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