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