{"title":"Personalized Assortment Optimization under Consumer Choice Models with Local Network Effects","authors":"Tong Xie, Zizhuo Wang","doi":"10.2139/ssrn.3788880","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce a consumer choice model in which each consumer's utility is affected by the purchase probabilities of his/her neighbors in a network. Such a consumer choice model is a general model to characterize consumer choice under network effect. We first characterize the choice probabilities under such a choice model. Then we consider the associated personalized assortment optimization problem. Particularly, the seller is allowed to offer a personalized assortment to each consumer, and the consumer chooses among the products according to the proposed choice model. We show that the problem is NP-hard even if the consumers form a star network. Despite of the complexity of the problem, we show that if the consumers form a star network, then the optimal assortment to the central consumer cannot be strictly larger than that without network effects; and the optimal assortment to each peripheral consumer must be a revenue-ordered assortment that is a subset of the optimal assortment without network effect. We also present a condition when revenue-ordered assortments can achieve a provable performance. Then in view of the fact that each node in a network can represent a group of consumers, we propose a novel idea in which the sellers are allowed to offer \"randomized assortments\" to each node in the network. We show that allowing for randomized assortments may further increase the revenue, and under a mild condition, the optimal assortment for the central consumer must be a combination of two adjacent revenue-ordered assortments and thus efficient algorithm can be developed. Finally, we extend the results to directed acyclic graphs (DAGs), showing that a mixture of adjacent revenue-ordered assortments is optimal under certain conditions.","PeriodicalId":176300,"journal":{"name":"Microeconomics: Intertemporal Consumer Choice & Savings eJournal","volume":"137 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Microeconomics: Intertemporal Consumer Choice & Savings eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3788880","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we introduce a consumer choice model in which each consumer's utility is affected by the purchase probabilities of his/her neighbors in a network. Such a consumer choice model is a general model to characterize consumer choice under network effect. We first characterize the choice probabilities under such a choice model. Then we consider the associated personalized assortment optimization problem. Particularly, the seller is allowed to offer a personalized assortment to each consumer, and the consumer chooses among the products according to the proposed choice model. We show that the problem is NP-hard even if the consumers form a star network. Despite of the complexity of the problem, we show that if the consumers form a star network, then the optimal assortment to the central consumer cannot be strictly larger than that without network effects; and the optimal assortment to each peripheral consumer must be a revenue-ordered assortment that is a subset of the optimal assortment without network effect. We also present a condition when revenue-ordered assortments can achieve a provable performance. Then in view of the fact that each node in a network can represent a group of consumers, we propose a novel idea in which the sellers are allowed to offer "randomized assortments" to each node in the network. We show that allowing for randomized assortments may further increase the revenue, and under a mild condition, the optimal assortment for the central consumer must be a combination of two adjacent revenue-ordered assortments and thus efficient algorithm can be developed. Finally, we extend the results to directed acyclic graphs (DAGs), showing that a mixture of adjacent revenue-ordered assortments is optimal under certain conditions.