首页 > 最新文献

M&som-Manufacturing & Service Operations Management最新文献

英文 中文
Logistics Performance, Ratings, and Its Impact on Customer Purchasing Behavior and Sales in E-Commerce Platforms 电子商务平台中物流绩效、评级及其对客户购买行为和销售的影响
3区 管理学 Q1 MANAGEMENT Pub Date : 2023-05-01 DOI: 10.1287/msom.2021.1045
Vinayak Deshpande, Pradeep K. Pendem
Problem definition: We examine the impact of logistics performance metrics such as delivery time and customer’s requested delivery speed on logistics service ratings and third-party sellers’ sales on an e-commerce platform. Academic/practical relevance: Although e-commerce retailers like Amazon have recently invested heavily in their logistics networks to provide faster delivery to customers, there is scant academic literature that tests and quantifies the premise that convenient and fast delivery will drive sales. In this paper, we provide empirical evidence on whether this relationship holds in practice by analyzing a mechanism that connects delivery performance to sales through logistics ratings. Prior academic work on online ratings in e-commerce platforms has mostly analyzed customers’ response to product functional performance and biases that exist within. Our study contributes to this stream of literature by examining customer experience from a service quality perspective by analyzing logistics service performance, logistics ratings, and its impact on customer purchase probability and sales. Methodology: Using an extensive data set of more than 15 million customer orders on the Tmall platform and Cainiao network (logistics arm of Alibaba), we use the Heckman ordered regression model to explain the variation in customers’ rating of logistics performance and the likelihood of customers posting a logistics rating. Next, we develop a generic customer choice model that links the customer’s likelihood of making a purchase to the logistics ratings provided by prior customers. We implement a two-step estimation of the choice model to quantify the impact of logistics ratings on customer purchase probability and third-party seller sales. Results: We surprisingly find that even customers with no promise on delivery speed are likely to post lower logistics ratings for delivery times longer than two days. Although these customers are not promised an explicit delivery deadline, they seem to have a mental threshold of two days and expect deliveries to be made within that time. Similarly, we find that priority customers (those with two-day and one-day promise speed) provide lower logistics ratings for delivery times longer than their anticipated delivery date. We estimate that reducing the delivery time of all three-day delivered orders on this platform (which makeup [Formula: see text] 35% of the total orders) to two days would improve the average daily third-party seller sales by 13.3% on this platform. The impact of delivery time performance on sales is more significant for sellers with a higher percentage of three-day delivered orders and a higher spend per order. Managerial implications: Our study emphasizes that delivery performance and logistics ratings, which measure service quality, are essential drivers of the customer purchase decision on e-commerce platforms. Furthermore, by quantifying the impact of delivery time performance on sales, our stu
问题定义:我们研究物流绩效指标(如交货时间和客户要求的交货速度)对物流服务评级和第三方卖家在电子商务平台上的销售的影响。学术/实践相关性:虽然像亚马逊这样的电子商务零售商最近在他们的物流网络上投入了大量资金,以便为客户提供更快的送货服务,但很少有学术文献对方便快捷的送货会推动销售这一前提进行测试和量化。在本文中,我们通过分析一种通过物流评级将交付绩效与销售联系起来的机制,提供了这种关系在实践中是否成立的经验证据。之前关于电子商务平台在线评级的学术工作主要是分析客户对产品功能性能的反应和存在的偏见。我们的研究通过分析物流服务绩效、物流评级及其对客户购买概率和销售的影响,从服务质量的角度考察客户体验,为这一文献流做出了贡献。研究方法:使用天猫平台和菜鸟网络(阿里巴巴的物流部门)上超过1500万客户订单的广泛数据集,我们使用Heckman有序回归模型来解释客户对物流绩效评级的变化以及客户发布物流评级的可能性。接下来,我们开发了一个通用的客户选择模型,该模型将客户购买的可能性与先前客户提供的物流评级联系起来。我们实现了选择模型的两步估计,以量化物流评级对客户购买概率和第三方卖家销售的影响。结果:我们惊讶地发现,即使客户没有交付速度的承诺,可能会张贴较低的物流评级,交付时间超过两天。虽然这些客户没有得到明确的交货期限承诺,但他们似乎有一个两天的心理门槛,并期望在这段时间内交货。同样,我们发现优先客户(那些有两天和一天承诺速度的客户)在交付时间超过预期交付日期时提供的物流评级较低。我们估计,将该平台上所有三天交货订单(占总订单的35%)的交货时间减少到两天,该平台上第三方卖家的平均日销售额将提高13.3%。配送时间对销售额的影响对于那些三天送达订单比例较高、单笔支出较高的卖家来说更为显著。管理启示:我们的研究强调,衡量服务质量的配送绩效和物流评级是电子商务平台上客户购买决策的重要驱动因素。此外,通过量化交货时间绩效对销售的影响,我们的研究还为在线零售商提供了一个框架,以评估由于物流绩效的改善而增加的销售是否可以抵消更快交货所需的额外基础设施成本的增加。我们的研究见解与旨在提高长期在线客户流量和销售的第三方卖家和电子商务平台经理相关。历史:本文已被接受为2018年MSOM数据驱动研究挑战赛的一部分。补充材料:在线附录可在https://doi.org/10.1287/msom.2021.1045上获得。
{"title":"Logistics Performance, Ratings, and Its Impact on Customer Purchasing Behavior and Sales in E-Commerce Platforms","authors":"Vinayak Deshpande, Pradeep K. Pendem","doi":"10.1287/msom.2021.1045","DOIUrl":"https://doi.org/10.1287/msom.2021.1045","url":null,"abstract":"Problem definition: We examine the impact of logistics performance metrics such as delivery time and customer’s requested delivery speed on logistics service ratings and third-party sellers’ sales on an e-commerce platform. Academic/practical relevance: Although e-commerce retailers like Amazon have recently invested heavily in their logistics networks to provide faster delivery to customers, there is scant academic literature that tests and quantifies the premise that convenient and fast delivery will drive sales. In this paper, we provide empirical evidence on whether this relationship holds in practice by analyzing a mechanism that connects delivery performance to sales through logistics ratings. Prior academic work on online ratings in e-commerce platforms has mostly analyzed customers’ response to product functional performance and biases that exist within. Our study contributes to this stream of literature by examining customer experience from a service quality perspective by analyzing logistics service performance, logistics ratings, and its impact on customer purchase probability and sales. Methodology: Using an extensive data set of more than 15 million customer orders on the Tmall platform and Cainiao network (logistics arm of Alibaba), we use the Heckman ordered regression model to explain the variation in customers’ rating of logistics performance and the likelihood of customers posting a logistics rating. Next, we develop a generic customer choice model that links the customer’s likelihood of making a purchase to the logistics ratings provided by prior customers. We implement a two-step estimation of the choice model to quantify the impact of logistics ratings on customer purchase probability and third-party seller sales. Results: We surprisingly find that even customers with no promise on delivery speed are likely to post lower logistics ratings for delivery times longer than two days. Although these customers are not promised an explicit delivery deadline, they seem to have a mental threshold of two days and expect deliveries to be made within that time. Similarly, we find that priority customers (those with two-day and one-day promise speed) provide lower logistics ratings for delivery times longer than their anticipated delivery date. We estimate that reducing the delivery time of all three-day delivered orders on this platform (which makeup [Formula: see text] 35% of the total orders) to two days would improve the average daily third-party seller sales by 13.3% on this platform. The impact of delivery time performance on sales is more significant for sellers with a higher percentage of three-day delivered orders and a higher spend per order. Managerial implications: Our study emphasizes that delivery performance and logistics ratings, which measure service quality, are essential drivers of the customer purchase decision on e-commerce platforms. Furthermore, by quantifying the impact of delivery time performance on sales, our stu","PeriodicalId":49901,"journal":{"name":"M&som-Manufacturing & Service Operations Management","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135270519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Go Wide or Go Deep? Assortment Strategy and Order Fulfillment in Online Retail 拓展还是深入?在线零售中的分类策略与订单履行
3区 管理学 Q1 MANAGEMENT Pub Date : 2023-05-01 DOI: 10.1287/msom.2022.1156
Sanjith Gopalakrishnan, Moksh Matta, Mona Imanpoor Yourdshahy, Vivek Choudhary
Problem definition: Expansions in product assortment by online retailers often engender operational challenges. In undertaking such expansions, retailers exercise a strategic choice between expanding assortment width or depth. Our understanding of how this choice affects the order fulfillment process is limited. Thus, we examine the impact of these dimensions of assortment strategy on order delivery timeliness. Academic/practical relevance: Order delivery timeliness is a critical measure of operational success in online retail. We contribute to theory and practice by adopting a multidimensional perspective of retailer assortment strategy and studying the relative impact of assortment width and depth on order delivery timeliness. Methodology: Employing a data set comprising more than 200 million orders, we study the effects of assortment strategy on delivery timeliness using an instrumental variable approach. We then utilize a two-stage model to estimate the impact of delivery performance on sales. Further, we employ a matched difference-in-differences and a novel Bayesian structural time-series model to confirm this relationship. Results: We find that assortment width has a greater negative impact on order delivery timeliness compared with assortment depth. A one-standard-deviation increase in assortment width increases average delivery times by 0.55 days. Further, we find this effect to be positively moderated (i.e., worsened) by the average size of orders and to be negatively moderated (i.e., improved) by the logistic service provider’s (LSP) experience. Finally, a one-day increase in delivery times for 10% of the orders results in a 2.7% reduction in sales. Managerial implications: Our findings suggest that online retailers focused on ensuring timely deliveries should be wary of widening product assortments, especially when facing larger average order sizes. We also find that experienced logistic service providers can help mitigate the dilatory effects of assortment width expansions. However, the benefits of experienced LSPs are limited for retailers deepening their assortments. History: This paper has been accepted as part of the 2018 MSOM Data Driven Research Challenge. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2022.1156 .
问题定义:在线零售商在产品分类上的扩张常常会带来运营上的挑战。在进行这种扩张时,零售商需要在扩大商品种类的宽度和深度之间做出战略选择。我们对这种选择如何影响订单履行过程的理解是有限的。因此,我们研究了分类策略的这些维度对订单交付及时性的影响。学术/实践相关性:订单交付及时性是衡量在线零售业务成功与否的关键指标。本文采用零售商分类策略的多维视角,研究分类宽度和深度对订单交付时效性的相对影响,为理论和实践提供了有益的借鉴。方法:采用包含超过2亿订单的数据集,我们使用工具变量方法研究分类策略对交付及时性的影响。然后,我们利用两阶段模型来估计交付绩效对销售的影响。此外,我们采用了一个匹配的差中差和一个新的贝叶斯结构时间序列模型来证实这种关系。结果:与分类深度相比,分类宽度对订单交付及时性的负向影响更大。分类宽度每增加一个标准差,平均交货时间就会增加0.55天。此外,我们发现这种影响被订单的平均规模正向调节(即恶化),并被物流服务提供商(LSP)的经验负向调节(即改善)。最后,10%的订单每增加一天的交货时间,销售额就会减少2.7%。管理启示:我们的研究结果表明,专注于确保及时交货的在线零售商应该警惕不断扩大的产品种类,特别是当面临更大的平均订单规模时。我们还发现,经验丰富的物流服务提供商可以帮助缓解分类宽度扩展的延迟效应。然而,经验丰富的lsp的好处是有限的零售商深化他们的分类。历史:本文已被接受为2018年MSOM数据驱动研究挑战赛的一部分。补充材料:在线附录可在https://doi.org/10.1287/msom.2022.1156上获得。
{"title":"Go Wide or Go Deep? Assortment Strategy and Order Fulfillment in Online Retail","authors":"Sanjith Gopalakrishnan, Moksh Matta, Mona Imanpoor Yourdshahy, Vivek Choudhary","doi":"10.1287/msom.2022.1156","DOIUrl":"https://doi.org/10.1287/msom.2022.1156","url":null,"abstract":"Problem definition: Expansions in product assortment by online retailers often engender operational challenges. In undertaking such expansions, retailers exercise a strategic choice between expanding assortment width or depth. Our understanding of how this choice affects the order fulfillment process is limited. Thus, we examine the impact of these dimensions of assortment strategy on order delivery timeliness. Academic/practical relevance: Order delivery timeliness is a critical measure of operational success in online retail. We contribute to theory and practice by adopting a multidimensional perspective of retailer assortment strategy and studying the relative impact of assortment width and depth on order delivery timeliness. Methodology: Employing a data set comprising more than 200 million orders, we study the effects of assortment strategy on delivery timeliness using an instrumental variable approach. We then utilize a two-stage model to estimate the impact of delivery performance on sales. Further, we employ a matched difference-in-differences and a novel Bayesian structural time-series model to confirm this relationship. Results: We find that assortment width has a greater negative impact on order delivery timeliness compared with assortment depth. A one-standard-deviation increase in assortment width increases average delivery times by 0.55 days. Further, we find this effect to be positively moderated (i.e., worsened) by the average size of orders and to be negatively moderated (i.e., improved) by the logistic service provider’s (LSP) experience. Finally, a one-day increase in delivery times for 10% of the orders results in a 2.7% reduction in sales. Managerial implications: Our findings suggest that online retailers focused on ensuring timely deliveries should be wary of widening product assortments, especially when facing larger average order sizes. We also find that experienced logistic service providers can help mitigate the dilatory effects of assortment width expansions. However, the benefits of experienced LSPs are limited for retailers deepening their assortments. History: This paper has been accepted as part of the 2018 MSOM Data Driven Research Challenge. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2022.1156 .","PeriodicalId":49901,"journal":{"name":"M&som-Manufacturing & Service Operations Management","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135702916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Operational Transparency: Showing When Work Gets Done 操作透明度:显示工作何时完成
3区 管理学 Q1 MANAGEMENT Pub Date : 2023-05-01 DOI: 10.1287/msom.2020.0899
Robert L. Bray
Problem definition: Do the benefits of operational transparency depend on when the work is done? Academic/practical relevance: This work connects the operations management literature on operational transparency with the psychology literature on the peak-end effect. Methodology: This study examines how customers respond to operational transparency with parcel delivery data from the Cainiao Network, the logistics arm of Alibaba. The sample comprises 4.68 million deliveries. Each delivery has between 4 and 10 track-package activities, which customers can check in real time, and a delivery service score, which customers leave after receiving the package. Instrumental-variable regressions quantify the causal effect of track-package-activity times on delivery scores. Results: The regressions suggest that customers punish early idleness less than late idleness, leaving higher delivery service scores when track-package activities cluster toward the end of the shipping horizon. For example, if a shipment takes 100 hours, then delaying the time of the average action from hour 20 to hour 80 increases the expected delivery score by approximately the same amount as expediting the arrival time from hour 100 to hour 73. Managerial implications: Memory limitations make customers especially sensitive to how service operations end. History: This paper has been accepted as part of the 2018 MSOM Data Driven Research Challenge.
问题定义:操作透明度的好处是否取决于工作何时完成?学术/实践相关性:本研究将运营透明度的运营管理文献与峰端效应的心理学文献联系起来。研究方法:本研究通过阿里巴巴旗下物流公司菜鸟网络的包裹递送数据,考察客户对运营透明度的反应。样本包括468万次交付。每次送货都有4到10个跟踪包裹的活动,顾客可以实时查看这些活动,还有一个送货服务评分,顾客在收到包裹后会留下评分。工具变量回归量化了跟踪包裹活动时间对递送分数的因果影响。结果:回归表明,顾客对早期闲置的惩罚比对后期闲置的惩罚要少,当跟踪包裹活动聚集在运输地平线的末端时,配送服务得分更高。例如,如果发货需要100个小时,那么将平均动作的时间从20小时延迟到80小时将增加预期交付分数,其数量与将到达时间从100小时加快到73小时大致相同。管理含义:内存限制使客户对服务操作如何结束特别敏感。历史:本文已被接受为2018年MSOM数据驱动研究挑战赛的一部分。
{"title":"Operational Transparency: Showing When Work Gets Done","authors":"Robert L. Bray","doi":"10.1287/msom.2020.0899","DOIUrl":"https://doi.org/10.1287/msom.2020.0899","url":null,"abstract":"Problem definition: Do the benefits of operational transparency depend on when the work is done? Academic/practical relevance: This work connects the operations management literature on operational transparency with the psychology literature on the peak-end effect. Methodology: This study examines how customers respond to operational transparency with parcel delivery data from the Cainiao Network, the logistics arm of Alibaba. The sample comprises 4.68 million deliveries. Each delivery has between 4 and 10 track-package activities, which customers can check in real time, and a delivery service score, which customers leave after receiving the package. Instrumental-variable regressions quantify the causal effect of track-package-activity times on delivery scores. Results: The regressions suggest that customers punish early idleness less than late idleness, leaving higher delivery service scores when track-package activities cluster toward the end of the shipping horizon. For example, if a shipment takes 100 hours, then delaying the time of the average action from hour 20 to hour 80 increases the expected delivery score by approximately the same amount as expediting the arrival time from hour 100 to hour 73. Managerial implications: Memory limitations make customers especially sensitive to how service operations end. History: This paper has been accepted as part of the 2018 MSOM Data Driven Research Challenge.","PeriodicalId":49901,"journal":{"name":"M&som-Manufacturing & Service Operations Management","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135270522","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
MSOM Society Student Paper Competition: Abstracts of 2022 Winners MSOM协会学生论文竞赛:2022年获奖者摘要
3区 管理学 Q1 MANAGEMENT Pub Date : 2023-05-01 DOI: 10.1287/msom.2023.1220
The journal is pleased to publish the abstracts of the six finalists of the 2022 Manufacturing and Service Operations Management Society’s student paper competition. The 2022 prize committee was chaired by Florin Ciocan (INSEAD), Ersin Korpeoglu (University College London), and Nikos Trichakis (Massachusetts Institute of Technology). The judges were Adam Elmachtoub, Adem Orsdemir, Agni Orfanoudaki, Alp Akcay, Alper Nakkas, Amrita Kundu, Amy Pan, Andrew Wu, Antoine DESIR, Anyan Qi, Arian Aflaki, Ashish Kabra, Auyon Siddiq, Bilal Gokpinar, Bob Batt, Bora Keskin, Can Zhang, Dan Iancu, Dan Iancu, Daniel Freund, Daniel Lin, Daniela Saban, David Drake, Dawson Kaaua, Ekaterina Astashkina, Elena Belavina, Elodie Adida, Emre Nadar, Fabian Sting, Fanyin Zheng, Fei Gao, Georgina Hall, Gizem Korpeoglu, Gonzalo Romero, Guoming Lai, Hessam Bavafa, Hummy Song, Ioannis (Yannis) Bellos, Ioannis Stamatopoulos, Iris Wang, Itir Karaesmen, Jiankun Sun, Jiankun Sun, Jiaru Bai, Jiayi Joey Yu, Jing Wu, Joel Wooten, John Silberholz, Jonathan Helm, Jose Guajardo, Karen Zheng, Ken Moon, Kenan Arifoglu, Kimon Drakopoulos, Kostas Bimpikis, Lennart Baardman, Lina Song, Luyi Gui, Luyi Yang, Miao Bai, Mika Sumida, Ming Hu, Mumin Kurtulus, Nazli Sonmez, Negin Golrezaei, Nektarios Oraiopoulos, Nil Karacaoglu, Nitin Bakshi, Nitish Jain, Nur Sunar, Olga Perdikaki, Ovunc Yilmaz, Ozan Candogan, Panos Markou, Pengyi Shi, Philip Zhang, Philipp Cornelius, Qi (George) Chen, Qiuping Yu, Ruslan Momot, Ruth Beer, S. Alex Yang, Saed Alizamir, Safak Yucel, Sanjith Gopalakrishnan, Santiago Gallino, Sarah Yini Gao, Scott Rodilitz, Sebastien Martin, Sheng Liu, Shouqiang Wang, Simone Marinesi, Sina Khorasani, So Yeon CHUN, Somya Singhvi, Soo-Haeng Cho, Soroush Saghafian, Sriram Dasu, Stefanus Jasin, Stephen Leider, Tian Chan, Tim Kraft, Tom Tan, Vasiliki Kostami, Velibor Misic, Vishal Agrawal, Xiaojia Guo, Xiaoshan Peng, Xiaoshuai Fan, Xiaoyang Long, Yangfang (Helen) Zhou, Yasemin Limon, Yehua Wei, Ying-Ju Chen, Yonatan Gur, Yuqian Xu, Zhaohui (Zoey) Jiang, Zhaowei She, and Zumbul Atan.
该杂志很高兴地发表了2022年制造和服务运营管理协会学生论文竞赛的六位决赛选手的摘要。2022年诺贝尔奖委员会由Florin Ciocan(欧洲工商管理学院)、Ersin Korpeoglu(伦敦大学学院)和Nikos Trichakis(麻省理工学院)担任主席。评委是Adam Elmachtoub, Adem Orsdemir, Agni Orfanoudaki, Alp akday, Alper Nakkas, Amrita Kundu, Amy Pan, Andrew Wu, Antoine DESIR, Anyan Qi, Arian Aflaki, Ashish Kabra, Auyon Siddiq, Bilal Gokpinar, Bob Batt, Bora Keskin, Zhang, Dan Iancu, Dan Iancu, Daniel Freund, Daniel Lin, Daniela Saban, David Drake, Dawson Kaaua, Ekaterina Astashkina, Elena Belavina, Elodie Adida, Emre Nadar, Fabian Sting, Fanyin Zheng, Fei Gao, Georgina Hall, Gizem Korpeoglu, Gonzalo Romero, Alper Nakkas, Amrita Kundu, Amy Pan, Andrew WuHessam Bavafa, Hummy Song, Ioannis (Yannis) Bellos, Ioannis Stamatopoulos, Ioannis (Yannis) Bellos, Ioannis Stamatopoulos, Itir Karaesmen,孙建坤,孙建坤,白家茹,俞家怡,吴静,Joel Wooten, John Silberholz, Jonathan Helm, Jose Guajardo, Karen Zheng, Ken Moon, Kenan Arifoglu, Kimon Drakopoulos, Kostas Bimpikis, Lennart Baardman, Lina Song, Luyi Gui, Luyi Yang, Miao Bai, Mika Sumida, Ming Hu, Mumin Kurtulus, Nazli Sonmez, Nektarios Oraiopoulos, Nil Karacaoglu, Nitin Bakshi, Nitish Jain,Nur Sunar, Olga Perdikaki, Ovunc Yilmaz, Ozan Candogan, Panos Markou, Shi Pengyi, Philip Zhang, Philipp Cornelius, Qi (George) Chen, Qi (George) Yang, Saed Alizamir, Safak Yucel, Sanjith Gopalakrishnan, Santiago Gallino, Sarah Yini Gao, Scott Rodilitz, Sebastien Martin, Liu Sheng, Wang shouhaeng, Simone Marinesi, Sina Khorasani, So Yeon CHUN, Somya Singhvi, Soo-Haeng Cho, Soroush Saghafian, Sriram Dasu, Stefanus Jasin, Stephen Leider, Tian Chan, Tim Kraft,Tom Tan, Vasiliki Kostami, Velibor Misic, Vishal Agrawal,郭晓佳,彭晓山,范晓帅,龙晓阳,周阳芳,Yasemin Limon,韦叶华,陈英菊,Gur Yonatan,徐玉倩,蒋朝晖,舍朝伟,Zumbul Atan。
{"title":"MSOM Society Student Paper Competition: Abstracts of 2022 Winners","authors":"","doi":"10.1287/msom.2023.1220","DOIUrl":"https://doi.org/10.1287/msom.2023.1220","url":null,"abstract":"The journal is pleased to publish the abstracts of the six finalists of the 2022 Manufacturing and Service Operations Management Society’s student paper competition. The 2022 prize committee was chaired by Florin Ciocan (INSEAD), Ersin Korpeoglu (University College London), and Nikos Trichakis (Massachusetts Institute of Technology). The judges were Adam Elmachtoub, Adem Orsdemir, Agni Orfanoudaki, Alp Akcay, Alper Nakkas, Amrita Kundu, Amy Pan, Andrew Wu, Antoine DESIR, Anyan Qi, Arian Aflaki, Ashish Kabra, Auyon Siddiq, Bilal Gokpinar, Bob Batt, Bora Keskin, Can Zhang, Dan Iancu, Dan Iancu, Daniel Freund, Daniel Lin, Daniela Saban, David Drake, Dawson Kaaua, Ekaterina Astashkina, Elena Belavina, Elodie Adida, Emre Nadar, Fabian Sting, Fanyin Zheng, Fei Gao, Georgina Hall, Gizem Korpeoglu, Gonzalo Romero, Guoming Lai, Hessam Bavafa, Hummy Song, Ioannis (Yannis) Bellos, Ioannis Stamatopoulos, Iris Wang, Itir Karaesmen, Jiankun Sun, Jiankun Sun, Jiaru Bai, Jiayi Joey Yu, Jing Wu, Joel Wooten, John Silberholz, Jonathan Helm, Jose Guajardo, Karen Zheng, Ken Moon, Kenan Arifoglu, Kimon Drakopoulos, Kostas Bimpikis, Lennart Baardman, Lina Song, Luyi Gui, Luyi Yang, Miao Bai, Mika Sumida, Ming Hu, Mumin Kurtulus, Nazli Sonmez, Negin Golrezaei, Nektarios Oraiopoulos, Nil Karacaoglu, Nitin Bakshi, Nitish Jain, Nur Sunar, Olga Perdikaki, Ovunc Yilmaz, Ozan Candogan, Panos Markou, Pengyi Shi, Philip Zhang, Philipp Cornelius, Qi (George) Chen, Qiuping Yu, Ruslan Momot, Ruth Beer, S. Alex Yang, Saed Alizamir, Safak Yucel, Sanjith Gopalakrishnan, Santiago Gallino, Sarah Yini Gao, Scott Rodilitz, Sebastien Martin, Sheng Liu, Shouqiang Wang, Simone Marinesi, Sina Khorasani, So Yeon CHUN, Somya Singhvi, Soo-Haeng Cho, Soroush Saghafian, Sriram Dasu, Stefanus Jasin, Stephen Leider, Tian Chan, Tim Kraft, Tom Tan, Vasiliki Kostami, Velibor Misic, Vishal Agrawal, Xiaojia Guo, Xiaoshan Peng, Xiaoshuai Fan, Xiaoyang Long, Yangfang (Helen) Zhou, Yasemin Limon, Yehua Wei, Ying-Ju Chen, Yonatan Gur, Yuqian Xu, Zhaohui (Zoey) Jiang, Zhaowei She, and Zumbul Atan.","PeriodicalId":49901,"journal":{"name":"M&som-Manufacturing & Service Operations Management","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135050716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Analysis of Incentive Schemes for Participant Retention in Clinical Studies 临床研究中参与者保留的激励机制分析
3区 管理学 Q1 MANAGEMENT Pub Date : 2023-05-01 DOI: 10.1287/msom.2022.1184
Xueze Song, Mili Mehrotra, Tharanga Rajapakshe
Problem definition: Participant retention is one of the significant issues faced by clinical studies. This paper analyzes the economic impact of combining two mechanisms (monetary payments to participants and effort exerted during a clinical study) observed in practice to improve retention. Methodology/results: Given an incentive scheme, under full information and information asymmetry regarding participants’ characteristics, we model the problem of identifying optimal payment and effort to improve retention for a clinical study using a nonlinear integer program. We propose polynomial-time algorithms to solve the problem under full information for a participant-specific linear payment scheme and two commonly observed incentive schemes: Fixed Payment (FP) and Logistics Reimbursement (RE). We also provide exact methods to solve the problem under information asymmetry for the FP and RE schemes. We conduct a comprehensive computational study to gain insights into the relative performance of these schemes. Under full information, the participant-specific scheme can reduce the retention cost by about 46%, on average, compared with that under the RE and FP schemes. Information asymmetry causes the RE scheme to be more favorable than the FP scheme in a wider variety of clinical studies. Further, the value of acquiring participants’ characteristics information is significant under the FP scheme compared with that under the RE scheme. Managerial implications: The determination of monetary payments is ad hoc in practice. Further, an economic analysis of the two mechanisms for improving retention in clinical studies is absent. Given the participants and the clinical study characteristics under full information and information asymmetry, our analysis enables a decision maker to identify an optimum incentive scheme, monetary payment, and effort level for improving retention. Further, our analysis allows a clinical study decision maker to assess budget requirements to improve retention and adapt the incentive payments to Institutional Review Board guidelines, if any. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.1184 .
问题定义:受试者保留是临床研究面临的重要问题之一。本文分析了在实践中观察到的两种机制(向参与者支付货币和在临床研究中付出的努力)相结合对提高保留率的经济影响。方法/结果:给定一个激励方案,在关于参与者特征的充分信息和信息不对称的情况下,我们使用非线性整数程序对临床研究中确定最佳支付和努力以提高保留率的问题进行建模。我们提出了多项式时间算法来解决参与者特定的线性支付方案和两种常见的激励方案:固定支付(FP)和物流报销(RE)的充分信息下的问题。我们还给出了FP和RE方案在信息不对称情况下的精确求解方法。我们进行了全面的计算研究,以深入了解这些方案的相对性能。在充分信息条件下,与可再生资源和计划生育方案相比,参与者特定方案平均可降低约46%的保留成本。信息不对称导致RE方案在更广泛的临床研究中比FP方案更有利。此外,与RE方案相比,FP方案获取参与者特征信息的价值显著。管理影响:货币支付的确定在实践中是临时的。此外,在临床研究中,缺乏对两种改善留置机制的经济分析。在充分信息和信息不对称的情况下,我们的分析使决策者能够确定最佳的激励方案、货币支付和努力水平,以提高保留率。此外,我们的分析允许临床研究决策者评估预算需求,以提高保留率,并根据机构审查委员会的指导方针(如果有的话)调整激励支付。补充材料:在线附录可在https://doi.org/10.1287/msom.2022.1184上获得。
{"title":"An Analysis of Incentive Schemes for Participant Retention in Clinical Studies","authors":"Xueze Song, Mili Mehrotra, Tharanga Rajapakshe","doi":"10.1287/msom.2022.1184","DOIUrl":"https://doi.org/10.1287/msom.2022.1184","url":null,"abstract":"Problem definition: Participant retention is one of the significant issues faced by clinical studies. This paper analyzes the economic impact of combining two mechanisms (monetary payments to participants and effort exerted during a clinical study) observed in practice to improve retention. Methodology/results: Given an incentive scheme, under full information and information asymmetry regarding participants’ characteristics, we model the problem of identifying optimal payment and effort to improve retention for a clinical study using a nonlinear integer program. We propose polynomial-time algorithms to solve the problem under full information for a participant-specific linear payment scheme and two commonly observed incentive schemes: Fixed Payment (FP) and Logistics Reimbursement (RE). We also provide exact methods to solve the problem under information asymmetry for the FP and RE schemes. We conduct a comprehensive computational study to gain insights into the relative performance of these schemes. Under full information, the participant-specific scheme can reduce the retention cost by about 46%, on average, compared with that under the RE and FP schemes. Information asymmetry causes the RE scheme to be more favorable than the FP scheme in a wider variety of clinical studies. Further, the value of acquiring participants’ characteristics information is significant under the FP scheme compared with that under the RE scheme. Managerial implications: The determination of monetary payments is ad hoc in practice. Further, an economic analysis of the two mechanisms for improving retention in clinical studies is absent. Given the participants and the clinical study characteristics under full information and information asymmetry, our analysis enables a decision maker to identify an optimum incentive scheme, monetary payment, and effort level for improving retention. Further, our analysis allows a clinical study decision maker to assess budget requirements to improve retention and adapt the incentive payments to Institutional Review Board guidelines, if any. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.1184 .","PeriodicalId":49901,"journal":{"name":"M&som-Manufacturing & Service Operations Management","volume":"350 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135563152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Detecting Customer Trends for Optimal Promotion Targeting 检测客户趋势,优化促销目标
3区 管理学 Q1 MANAGEMENT Pub Date : 2023-03-01 DOI: 10.1287/msom.2020.0893
Lennart Baardman, Setareh Borjian Boroujeni, Tamar Cohen-Hillel, Kiran Panchamgam, Georgia Perakis
Problem definition: Retailers have become increasingly interested in personalizing their products and services such as promotions. For this, we need new personalized demand models. Unfortunately, social data are not available to many retailers because of cost and privacy issues. Thus, we focus on the problem of detecting customer relationships from transactional data and using them to target promotions to the right customers. Academic/practical relevance: From an academic point of view, this paper solves the novel problem of jointly detecting customer trends and using them for optimal promotion targeting. Notably, we estimate the causal customer-to-customer trend effect solely from transactional data and target promotions for multiple items and time periods. In practice, we provide a new tool for Oracle Retail clients that personalizes promotions. Methodology: We develop a novel customer trend demand model distinguishing between a base purchase probability, capturing factors such as price and seasonality, and a customer trend probability, capturing customer-to-customer trend effects. The estimation procedure is based on regularized bounded variables least squares and instrumental variable methods. The resulting customer trend estimates feed into the dynamic promotion targeting optimization problem, formulated as a nonlinear mixed-integer optimization model. Though it is nondeterministic polynomial-time hard, we propose a greedy algorithm. Results: We prove that our customer-to-customer trend estimates are statistically consistent and that the greedy optimization algorithm is provably good. Having access to Oracle Retail fashion client data, we show that our demand model reduces the weighted-mean absolute percentage error by 11% on average. Also, we provide evidence of the causality of our estimates. Finally, we demonstrate that the optimal policy increases profits by 3%–11%. Managerial implications: The demand model with customer trend and the optimization model for targeted promotions form a decision-support tool for promotion planning. Next to general planning, it also helps to find important customers and target them to generate additional sales. History: This paper has been accepted as part of the 2019 Manufacturing & Service Operations Management Practice-Based Research Competition. Funding: This work was supported by the U.S. National Science Foundation [Grant CMMI-156334]. Funding from the Oracle Corporation through an ERO grant is also gratefully acknowledged. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2020.0893 .
问题定义:零售商对个性化产品和服务(如促销)越来越感兴趣。为此,我们需要新的个性化需求模型。不幸的是,由于成本和隐私问题,许多零售商无法获得社交数据。因此,我们关注的问题是从交易数据中检测客户关系,并利用它们向合适的客户进行定向促销。学术/实践相关性:从学术角度出发,本文解决了共同检测客户趋势并利用其进行最优促销定位的新问题。值得注意的是,我们仅从交易数据和多个项目和时间段的目标促销来估计因果客户对客户的趋势效应。在实践中,我们为Oracle Retail客户提供了一种新的工具来个性化促销。方法:我们开发了一种新的客户趋势需求模型,区分基本购买概率(捕获诸如价格和季节性等因素)和客户趋势概率(捕获客户对客户趋势影响)。估计过程是基于正则化有界变量最小二乘和工具变量方法。由此产生的客户趋势估计将输入到动态促销目标优化问题中,该问题被表述为一个非线性混合整数优化模型。虽然这是一个不确定的多项式时间难题,但我们提出了一个贪心算法。结果:我们证明了我们的客户对客户趋势估计在统计上是一致的,并且证明了贪婪优化算法是好的。通过访问Oracle Retail时尚客户数据,我们发现我们的需求模型将加权平均绝对百分比误差平均降低了11%。此外,我们还提供了我们估计的因果关系的证据。最后,我们证明了最优政策使利润增加了3%-11%。管理意义:具有顾客趋势的需求模型和针对性促销的优化模型构成了促销计划的决策支持工具。除了总体规划,它还有助于找到重要的客户,并针对他们产生额外的销售。历史:本文已被接受为2019年制造业&服务营运管理实务研究比赛。资助:这项工作由美国国家科学基金会[Grant CMMI-156334]支持。Oracle公司通过ERO赠款提供的资金也得到了感谢。补充材料:在线附录可在https://doi.org/10.1287/msom.2020.0893上获得。
{"title":"Detecting Customer Trends for Optimal Promotion Targeting","authors":"Lennart Baardman, Setareh Borjian Boroujeni, Tamar Cohen-Hillel, Kiran Panchamgam, Georgia Perakis","doi":"10.1287/msom.2020.0893","DOIUrl":"https://doi.org/10.1287/msom.2020.0893","url":null,"abstract":"Problem definition: Retailers have become increasingly interested in personalizing their products and services such as promotions. For this, we need new personalized demand models. Unfortunately, social data are not available to many retailers because of cost and privacy issues. Thus, we focus on the problem of detecting customer relationships from transactional data and using them to target promotions to the right customers. Academic/practical relevance: From an academic point of view, this paper solves the novel problem of jointly detecting customer trends and using them for optimal promotion targeting. Notably, we estimate the causal customer-to-customer trend effect solely from transactional data and target promotions for multiple items and time periods. In practice, we provide a new tool for Oracle Retail clients that personalizes promotions. Methodology: We develop a novel customer trend demand model distinguishing between a base purchase probability, capturing factors such as price and seasonality, and a customer trend probability, capturing customer-to-customer trend effects. The estimation procedure is based on regularized bounded variables least squares and instrumental variable methods. The resulting customer trend estimates feed into the dynamic promotion targeting optimization problem, formulated as a nonlinear mixed-integer optimization model. Though it is nondeterministic polynomial-time hard, we propose a greedy algorithm. Results: We prove that our customer-to-customer trend estimates are statistically consistent and that the greedy optimization algorithm is provably good. Having access to Oracle Retail fashion client data, we show that our demand model reduces the weighted-mean absolute percentage error by 11% on average. Also, we provide evidence of the causality of our estimates. Finally, we demonstrate that the optimal policy increases profits by 3%–11%. Managerial implications: The demand model with customer trend and the optimization model for targeted promotions form a decision-support tool for promotion planning. Next to general planning, it also helps to find important customers and target them to generate additional sales. History: This paper has been accepted as part of the 2019 Manufacturing & Service Operations Management Practice-Based Research Competition. Funding: This work was supported by the U.S. National Science Foundation [Grant CMMI-156334]. Funding from the Oracle Corporation through an ERO grant is also gratefully acknowledged. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2020.0893 .","PeriodicalId":49901,"journal":{"name":"M&som-Manufacturing & Service Operations Management","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135544216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Disclosing Product Availability in Online Retail 在线零售中披露产品可用性
3区 管理学 Q1 MANAGEMENT Pub Date : 2023-03-01 DOI: 10.1287/msom.2020.0882
Eduard Calvo, Ruomeng Cui, Laura Wagner
Problem definition: Online retailers disclose product availability to influence customer decisions as a form of pressure selling designed to compel customers to rush into a purchase. Can the revelation of this information drive sales and profitability? We study the effect of disclosing product availability on market outcomes—product sales and returns—and identify the contexts where this effect is most powerful. Academic/practical relevance: Increasing sell-out is key for online retailers to remain profitable in the presence of thin margins and complex operations. We provide insights into how their information-disclosure policy—something they can tailor at virtually no cost—can contribute to this important objective. Methodology: We collaborate with an online retailer to procure a year of transaction data on 190,696 products that span 1,290 brands and 472,980 customers. To causally identify our results, we use a generalized difference-in-differences design with matching that exploits one policy of the firm: it discloses product availability only for the last five units. Results: The disclosure of low product availability increases hourly sales—they grow by 13.6%—but these products are more likely to be returned—product return rates increase by 17.0%. Because returns are costly, we also study net sales—product hourly sales minus hourly returns—which increase by 12.5% after the retailer reveals low availability. Managerial implications: The positive effects on sales and profitability amplify over wide assortments and when low-availability signals are abundantly visible and disclosed for deeply discounted products whose sales season is about to end. In addition, we propose a data-driven policy that exploits these results by using machine learning to prescribe the timing of disclosure of scarcity signals in order to boost sales without spiking returns. History: This paper has been accepted as part of the 2019 Manufacturing & Service Operations Management Practice-Based Research Competition.
问题定义:在线零售商披露产品的可用性,以影响客户的决定,作为一种压力销售的形式,旨在迫使客户急于购买。这些信息的披露能否推动销售和盈利?我们研究了披露产品可用性对市场结果(产品销售和退货)的影响,并确定了这种影响最强大的环境。学术/实践意义:在利润微薄和运营复杂的情况下,提高售罄率是在线零售商保持盈利的关键。我们提供了他们的信息披露政策(他们可以在几乎没有成本的情况下进行调整)如何有助于实现这一重要目标的见解。方法:我们与一家在线零售商合作,获取190,696种产品的一年交易数据,涉及1,290个品牌和472,980名客户。为了确定我们的结果,我们使用了一种通用的差异中差异设计,该设计利用了公司的一项政策:它只披露了最后五个单位的产品可用性。结果:低可用性产品的披露增加了每小时的销售额——他们增长了13.6%——但这些产品更有可能被退货——产品退货率增加了17.0%。由于退货成本很高,我们还研究了净销售额——产品每小时销售额减去每小时退货——在零售商披露低可用性后,净销售额增加12.5%。管理意义:对销售和盈利能力的积极影响在广泛的分类中被放大,当低可用性信号非常明显时,销售季节即将结束的大折扣产品就会被披露。此外,我们提出了一种数据驱动的策略,通过使用机器学习来规定披露稀缺信号的时间,从而在不增加回报的情况下促进销售,从而利用这些结果。历史:本文已被接受为2019年制造业&服务营运管理实务研究比赛。
{"title":"Disclosing Product Availability in Online Retail","authors":"Eduard Calvo, Ruomeng Cui, Laura Wagner","doi":"10.1287/msom.2020.0882","DOIUrl":"https://doi.org/10.1287/msom.2020.0882","url":null,"abstract":"Problem definition: Online retailers disclose product availability to influence customer decisions as a form of pressure selling designed to compel customers to rush into a purchase. Can the revelation of this information drive sales and profitability? We study the effect of disclosing product availability on market outcomes—product sales and returns—and identify the contexts where this effect is most powerful. Academic/practical relevance: Increasing sell-out is key for online retailers to remain profitable in the presence of thin margins and complex operations. We provide insights into how their information-disclosure policy—something they can tailor at virtually no cost—can contribute to this important objective. Methodology: We collaborate with an online retailer to procure a year of transaction data on 190,696 products that span 1,290 brands and 472,980 customers. To causally identify our results, we use a generalized difference-in-differences design with matching that exploits one policy of the firm: it discloses product availability only for the last five units. Results: The disclosure of low product availability increases hourly sales—they grow by 13.6%—but these products are more likely to be returned—product return rates increase by 17.0%. Because returns are costly, we also study net sales—product hourly sales minus hourly returns—which increase by 12.5% after the retailer reveals low availability. Managerial implications: The positive effects on sales and profitability amplify over wide assortments and when low-availability signals are abundantly visible and disclosed for deeply discounted products whose sales season is about to end. In addition, we propose a data-driven policy that exploits these results by using machine learning to prescribe the timing of disclosure of scarcity signals in order to boost sales without spiking returns. History: This paper has been accepted as part of the 2019 Manufacturing & Service Operations Management Practice-Based Research Competition.","PeriodicalId":49901,"journal":{"name":"M&som-Manufacturing & Service Operations Management","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135479574","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Understanding the Value of Fulfillment Flexibility in an Online Retailing Environment 了解在线零售环境中履行灵活性的价值
3区 管理学 Q1 MANAGEMENT Pub Date : 2023-03-01 DOI: 10.1287/msom.2021.0981
Levi DeValve, Yehua Wei, Di Wu, Rong Yuan
Problem definition: Fulfillment flexibility, the ability of distribution centers (DCs) to fulfill demand originating from other DCs, can help e-retailers reduce lost sales and improve service quality. Because the cost of full flexibility is prohibitive, we seek to understand the value of partially flexible fulfillment networks under simple and effective fulfillment policies. Academic/practical relevance: We propose a general method for understanding the practical value of (partial) fulfillment flexibility using a data-driven model, theoretical analysis, and numerical simulations. Our method applies to settings with local fulfillment (i.e., order fulfillment from the originating DC) prioritization and possible customer abandonment, two features that are new to the fulfillment literature. We then apply this method for a large e-retailer. We also introduce a new class of spillover limit fulfillment policies with attractive theoretical and practical features. Methodology: Our analysis uses dynamic and stochastic optimization, applied probability, and numerical simulations. Results: We derive optimal fulfillment policies in stylized settings, as well as bounds on the performance under an optimal policy using theoretical analysis, to provide guidelines on which policies to test in numerical simulations. We then use simulations to estimate for our industrial partner that a proposed fulfillment network with additional flexibility equates to a profit improvement on the order of tens of millions of U.S. dollars. Managerial implications: We provide an approach for e-retailers to understand when fulfillment flexibility is most valuable. We find that fulfillment flexibility provides the most benefit for our collaborator when gross profits are high relative to fulfillment costs or centrally held inventory is low. Also, we identify the risks of myopic fulfillment with additional flexibility and demonstrate that an effective spillover limit policy mitigates these risks. History: This paper has been accepted as part of the 2019 Manufacturing & Service Operations Management Practice-Based Research Competition. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2021.0981 .
问题定义:配送灵活性,配送中心(dc)满足来自其他dc的需求的能力,可以帮助电子零售商减少销售损失,提高服务质量。由于完全灵活的成本是令人望而却步的,我们试图了解在简单有效的履行政策下部分灵活的履行网络的价值。学术/实践相关性:我们通过数据驱动模型、理论分析和数值模拟,提出了一种理解(部分)履行灵活性的实用价值的一般方法。我们的方法适用于具有本地履行(即,来自原始数据中心的订单履行)优先级和可能的客户放弃的设置,这是履行文献中的两个新特性。然后,我们将此方法应用于大型电子零售商。本文还介绍了一类新的具有理论和实践特点的溢出限制履行政策。方法:我们的分析使用动态和随机优化,应用概率和数值模拟。结果:我们在程式化设置中推导出最优的履行策略,以及使用理论分析在最优策略下的性能界限,为在数值模拟中测试哪些策略提供指导。然后,我们使用模拟来为我们的工业合作伙伴估计,一个具有额外灵活性的拟议履行网络相当于数千万美元的利润改进。管理启示:我们为电子零售商提供了一种方法来了解何时履行灵活性是最有价值的。我们发现,当毛利润相对于履行成本较高或集中库存较低时,履行灵活性为我们的合作者提供了最大的利益。此外,我们以额外的灵活性识别短视履行的风险,并证明有效的溢出限制政策可以减轻这些风险。历史:本文已被接受为2019年制造业&服务营运管理实务研究比赛。补充材料:在线附录可在https://doi.org/10.1287/msom.2021.0981上获得。
{"title":"Understanding the Value of Fulfillment Flexibility in an Online Retailing Environment","authors":"Levi DeValve, Yehua Wei, Di Wu, Rong Yuan","doi":"10.1287/msom.2021.0981","DOIUrl":"https://doi.org/10.1287/msom.2021.0981","url":null,"abstract":"Problem definition: Fulfillment flexibility, the ability of distribution centers (DCs) to fulfill demand originating from other DCs, can help e-retailers reduce lost sales and improve service quality. Because the cost of full flexibility is prohibitive, we seek to understand the value of partially flexible fulfillment networks under simple and effective fulfillment policies. Academic/practical relevance: We propose a general method for understanding the practical value of (partial) fulfillment flexibility using a data-driven model, theoretical analysis, and numerical simulations. Our method applies to settings with local fulfillment (i.e., order fulfillment from the originating DC) prioritization and possible customer abandonment, two features that are new to the fulfillment literature. We then apply this method for a large e-retailer. We also introduce a new class of spillover limit fulfillment policies with attractive theoretical and practical features. Methodology: Our analysis uses dynamic and stochastic optimization, applied probability, and numerical simulations. Results: We derive optimal fulfillment policies in stylized settings, as well as bounds on the performance under an optimal policy using theoretical analysis, to provide guidelines on which policies to test in numerical simulations. We then use simulations to estimate for our industrial partner that a proposed fulfillment network with additional flexibility equates to a profit improvement on the order of tens of millions of U.S. dollars. Managerial implications: We provide an approach for e-retailers to understand when fulfillment flexibility is most valuable. We find that fulfillment flexibility provides the most benefit for our collaborator when gross profits are high relative to fulfillment costs or centrally held inventory is low. Also, we identify the risks of myopic fulfillment with additional flexibility and demonstrate that an effective spillover limit policy mitigates these risks. History: This paper has been accepted as part of the 2019 Manufacturing & Service Operations Management Practice-Based Research Competition. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2021.0981 .","PeriodicalId":49901,"journal":{"name":"M&som-Manufacturing & Service Operations Management","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135479576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Off-Platform Threats in On-Demand Services 按需服务中的平台外威胁
3区 管理学 Q1 MANAGEMENT Pub Date : 2023-03-01 DOI: 10.1287/msom.2022.1179
Eryn Juan He, Sergei Savin, Joel Goh, Chung-Piaw Teo
Problem definition: Online platforms that provide on-demand services are often threatened by the phenomenon of leakage, where customer-provider pairs may decide to transact “off-platform” to avoid paying commissions to the platform. This paper investigates properties of services that make them vulnerable or resistant to leakage. Academic/practical relevance: In practice, much attention has been given to platform leakage, with platforms experimenting with multiple approaches to alleviate leakage and maintain their customer and provider bases. Yet, there is a current dearth of studies in the operations literature that systematically analyze the key factors behind platform leakage. Our work fills this gap and answers practical questions regarding the sustainability of platform. Methodology: We develop two game-theoretical models that capture service providers’ and customers’ decisions whether to conduct transactions on or off the platform. In the first (“perfect information”) model, we assume that customers are equipped with information to select their desired providers on the platform, whereas in the second (“imperfect information”) model, we assume customers are randomly matched with available providers by the platform. Results: For profit maximizing platforms, we show that leakage occurs if and only if the value of the counterparty risk from off-platform transactions exceeds a threshold. Across both models, platforms tend to be more immunized against leakage as provider pool sizes increase, customer valuations for service increase, their waiting costs decrease, or variability in service times are reduced. Finally, by comparing the degree of leakage between both settings, we find that neither model dominates the other across all parameter combinations. Managerial implications: Our results provide guidance to existing platform managers or entrepreneurs who are considering “platforming” their services. Namely, based on a few key features of the operating environment, managers can assess the severity of the threat of platform leakage for their specific business context. Our results also suggest how redesigning the waiting process, reducing service time variability, upskilling providers can reduce the threat of leakage. They also suggest the conditions under which revealing provider quality information to customers can help to curb leakage. Funding: J. Goh’s work was supported by a National University of Singapore Start-Up [Grant R-314-000-110-133] and a 2021 Humanities and Social Sciences Fellowship from the National University of Singapore. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2022.1179 .
问题定义:提供按需服务的在线平台经常受到泄漏现象的威胁,客户-供应商对可能会决定进行“场外”交易,以避免向平台支付佣金。本文研究使服务易受泄漏或抵抗泄漏的属性。学术/实践相关性:在实践中,人们对平台泄漏给予了很大的关注,平台尝试了多种方法来减轻泄漏并维护其客户和提供商基础。然而,目前运营文献中缺乏系统分析平台泄漏背后关键因素的研究。我们的工作填补了这一空白,并回答了有关平台可持续性的实际问题。方法论:我们开发了两个博弈论模型,捕捉服务提供商和客户是否在平台上进行交易的决定。在第一个(“完全信息”)模型中,我们假设客户有信息来选择他们想要的平台供应商,而在第二个(“不完全信息”)模型中,我们假设客户是由平台随机匹配到可用的供应商的。结果:对于利润最大化平台,我们表明,当且仅当场外交易的交易对手风险价值超过阈值时,泄漏才会发生。在这两种模式中,随着提供商池规模的增加、客户对服务的估值的增加、等待成本的降低或服务时间的可变性的减少,平台往往更容易免受泄漏的影响。最后,通过比较两种设置之间的泄漏程度,我们发现在所有参数组合中,任何一个模型都不优于另一个模型。管理启示:我们的研究结果为现有的平台管理者或正在考虑将其服务“平台化”的企业家提供了指导。也就是说,基于操作环境的几个关键特征,管理人员可以针对其特定的业务环境评估平台泄漏威胁的严重程度。我们的研究结果还表明,如何重新设计等待过程,减少服务时间的变化,提高供应商的技能,可以减少泄漏的威胁。他们还提出了向客户披露供应商质量信息有助于遏制泄漏的条件。资助:J. Goh的工作得到了新加坡国立大学创业基金(Grant r - 314000 -110-133)和新加坡国立大学2021年人文社会科学奖学金的支持。补充材料:在线附录可在https://doi.org/10.1287/msom.2022.1179上获得。
{"title":"Off-Platform Threats in On-Demand Services","authors":"Eryn Juan He, Sergei Savin, Joel Goh, Chung-Piaw Teo","doi":"10.1287/msom.2022.1179","DOIUrl":"https://doi.org/10.1287/msom.2022.1179","url":null,"abstract":"Problem definition: Online platforms that provide on-demand services are often threatened by the phenomenon of leakage, where customer-provider pairs may decide to transact “off-platform” to avoid paying commissions to the platform. This paper investigates properties of services that make them vulnerable or resistant to leakage. Academic/practical relevance: In practice, much attention has been given to platform leakage, with platforms experimenting with multiple approaches to alleviate leakage and maintain their customer and provider bases. Yet, there is a current dearth of studies in the operations literature that systematically analyze the key factors behind platform leakage. Our work fills this gap and answers practical questions regarding the sustainability of platform. Methodology: We develop two game-theoretical models that capture service providers’ and customers’ decisions whether to conduct transactions on or off the platform. In the first (“perfect information”) model, we assume that customers are equipped with information to select their desired providers on the platform, whereas in the second (“imperfect information”) model, we assume customers are randomly matched with available providers by the platform. Results: For profit maximizing platforms, we show that leakage occurs if and only if the value of the counterparty risk from off-platform transactions exceeds a threshold. Across both models, platforms tend to be more immunized against leakage as provider pool sizes increase, customer valuations for service increase, their waiting costs decrease, or variability in service times are reduced. Finally, by comparing the degree of leakage between both settings, we find that neither model dominates the other across all parameter combinations. Managerial implications: Our results provide guidance to existing platform managers or entrepreneurs who are considering “platforming” their services. Namely, based on a few key features of the operating environment, managers can assess the severity of the threat of platform leakage for their specific business context. Our results also suggest how redesigning the waiting process, reducing service time variability, upskilling providers can reduce the threat of leakage. They also suggest the conditions under which revealing provider quality information to customers can help to curb leakage. Funding: J. Goh’s work was supported by a National University of Singapore Start-Up [Grant R-314-000-110-133] and a 2021 Humanities and Social Sciences Fellowship from the National University of Singapore. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2022.1179 .","PeriodicalId":49901,"journal":{"name":"M&som-Manufacturing & Service Operations Management","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136173852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Precommitments in Two-Sided Market Competition 双边市场竞争中的预先承诺
3区 管理学 Q1 MANAGEMENT Pub Date : 2023-03-01 DOI: 10.1287/msom.2022.1173
Ming Hu, Yan Liu
Problem definition: We consider a two-sided market competition problem where two platforms, such as Uber and Lyft, compete on both supply and demand sides and study the impact of precommitments in a variety of practically motivated instruments on the equilibrium outcomes. Academic/practical relevance: We extend a set of classic oligopoly pricing results to account for two-sided competition under demand uncertainty. Methodology: We investigate multi-stage competition games. Results: We start with a sufficiently low demand uncertainty. First, we show that a precommitment made on the less competitive (demand or supply) side (on price or wage) has a less intense outcome than no commitment (i.e., spot-market price and wage competition). Then we show that, somewhat surprisingly, if the competition intensities of both sides are sufficiently close, the commission precommitment, where the platforms first compete in setting their commission rates and then their prices, is less profitable than no precommitment at all, and vice versa. Furthermore, we show that the capacity precommitment, in which the platforms first commit to a matching capacity and then set price and wage simultaneously subject to the precommitted capacity, leads to the most profitable outcome of all competition modes and extends the celebrated Kreps-Scheinkman equivalency to the two-sided market (without demand uncertainty). Then we extend the comparisons of various competition modes to account for a relatively high demand uncertainty. We show that the comparison between the spot-market price and wage competition and the commission precommitment stays the same as that with a sufficiently low demand uncertainty. In addition, the more flexible competition modes, such as no commitment and commission precommitment, benefit from higher demand uncertainty (with a fixed mean demand) because of their operational flexibility in response to the market changes. Further, a relatively high demand uncertainty may undermine or enhance the value of the wage precommitment, as opposed to no commitment. Finally, we also account for platforms with asymmetric parameters and matching friction and find that our main insights tend to be robust. Managerial implications: Our results caution platforms that a precommitment to the wrong instrument can be worse than no commitment at all. Moreover, the regulation of classifying gig workers as employees, despite many of its benefits to workers, may lead to a less competitive market outcome and, surprisingly, hurt gig workers by paying them lower wages. Funding: M. Hu was supported by the Natural Sciences and Engineering Research Council of Canada [Grants RGPIN-2015-06757, RGPIN-2021-04295]. Y. Liu was supported by the Hong Kong Research Grants Council, Direct Allocation Grant [Project ID P0036818]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2022.1173 .
问题定义:我们考虑一个双边市场竞争问题,其中两个平台,如Uber和Lyft,在供需双方竞争,并研究各种实际激励工具中的预承诺对均衡结果的影响。学术/实践相关性:我们扩展了一组经典的寡头垄断定价结果,以解释需求不确定性下的双边竞争。方法:研究多阶段竞争博弈。结果:我们从一个足够低的需求不确定性开始。首先,我们表明,在竞争力较弱(需求或供给)方面(价格或工资)做出的预先承诺比没有承诺(即现货市场价格和工资竞争)的结果更不强烈。然后我们显示,如果双方的竞争强度足够接近,佣金预承诺,即平台首先在设定佣金率和价格方面进行竞争,比没有预承诺更有利可图,反之亦然。此外,我们证明了产能预承诺,即平台首先承诺匹配的产能,然后根据预承诺的产能同时设定价格和工资,导致所有竞争模式中最有利可图的结果,并将著名的克雷普斯-谢克曼等价扩展到双边市场(没有需求不确定性)。然后,我们扩展了各种竞争模式的比较,以解释相对较高的需求不确定性。我们表明,现货市场价格和工资竞争与佣金预承诺之间的比较与需求不确定性足够低时保持相同。此外,更灵活的竞争模式,如无承诺和佣金预承诺,由于其应对市场变化的操作灵活性,因此受益于更高的需求不确定性(平均需求固定)。此外,相对较高的需求不确定性可能会破坏或提高工资预先承诺的价值,而不是没有承诺。最后,我们还考虑了具有不对称参数和匹配摩擦的平台,并发现我们的主要见解往往是稳健的。管理意义:我们的结果提醒平台,预先承诺错误的工具可能比根本没有承诺更糟糕。此外,尽管对工人有很多好处,但将零工工人归类为雇员的监管可能会导致市场竞争减弱,令人惊讶的是,零工工人的工资会降低,从而损害他们的利益。资助:胡m .受加拿大自然科学与工程研究委员会资助[Grants RGPIN-2015-06757, RGPIN-2021-04295]。刘毅获香港研究资助局直接拨款资助[项目编号P0036818]。补充材料:在线附录可在https://doi.org/10.1287/msom.2022.1173上获得。
{"title":"Precommitments in Two-Sided Market Competition","authors":"Ming Hu, Yan Liu","doi":"10.1287/msom.2022.1173","DOIUrl":"https://doi.org/10.1287/msom.2022.1173","url":null,"abstract":"Problem definition: We consider a two-sided market competition problem where two platforms, such as Uber and Lyft, compete on both supply and demand sides and study the impact of precommitments in a variety of practically motivated instruments on the equilibrium outcomes. Academic/practical relevance: We extend a set of classic oligopoly pricing results to account for two-sided competition under demand uncertainty. Methodology: We investigate multi-stage competition games. Results: We start with a sufficiently low demand uncertainty. First, we show that a precommitment made on the less competitive (demand or supply) side (on price or wage) has a less intense outcome than no commitment (i.e., spot-market price and wage competition). Then we show that, somewhat surprisingly, if the competition intensities of both sides are sufficiently close, the commission precommitment, where the platforms first compete in setting their commission rates and then their prices, is less profitable than no precommitment at all, and vice versa. Furthermore, we show that the capacity precommitment, in which the platforms first commit to a matching capacity and then set price and wage simultaneously subject to the precommitted capacity, leads to the most profitable outcome of all competition modes and extends the celebrated Kreps-Scheinkman equivalency to the two-sided market (without demand uncertainty). Then we extend the comparisons of various competition modes to account for a relatively high demand uncertainty. We show that the comparison between the spot-market price and wage competition and the commission precommitment stays the same as that with a sufficiently low demand uncertainty. In addition, the more flexible competition modes, such as no commitment and commission precommitment, benefit from higher demand uncertainty (with a fixed mean demand) because of their operational flexibility in response to the market changes. Further, a relatively high demand uncertainty may undermine or enhance the value of the wage precommitment, as opposed to no commitment. Finally, we also account for platforms with asymmetric parameters and matching friction and find that our main insights tend to be robust. Managerial implications: Our results caution platforms that a precommitment to the wrong instrument can be worse than no commitment at all. Moreover, the regulation of classifying gig workers as employees, despite many of its benefits to workers, may lead to a less competitive market outcome and, surprisingly, hurt gig workers by paying them lower wages. Funding: M. Hu was supported by the Natural Sciences and Engineering Research Council of Canada [Grants RGPIN-2015-06757, RGPIN-2021-04295]. Y. Liu was supported by the Hong Kong Research Grants Council, Direct Allocation Grant [Project ID P0036818]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2022.1173 .","PeriodicalId":49901,"journal":{"name":"M&som-Manufacturing & Service Operations Management","volume":"703 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135957656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
期刊
M&som-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