论文标题
多次购买的产品最大化产品排名
Product Ranking for Revenue Maximization with Multiple Purchases
论文作者
论文摘要
产品排名是最大化在线零售商的核心问题。为了设计适当的产品排名算法,提出了各种消费者选择模型,以表征消费者的行为。但是,现有作品假定每种消费者最多购买一种产品,或者在购买产品后将继续查看产品列表,这在实际情况下与常见实践不一致。在本文中,我们假设每个消费者都可以随意购买多种产品。为了建模消费者观看和购买的意愿,我们设定了一个随机的注意力跨度和购买预算,这决定了他/她/她观看和购买的最大产品。在此设置下,我们首先设计一个最佳的排名策略,当在线零售商可以精确地模拟消费者的行为时。基于该政策,我们进一步开发了带有$é(\ sqrt {t})$ the The Mutiver-purchase-budget UCB(MPB-UCB)算法,遗憾的是,估计消费者的行为并同时在在线设置中同时提高收入。合成和半合成数据集的实验证明了所提出的算法的有效性。
Product ranking is the core problem for revenue-maximizing online retailers. To design proper product ranking algorithms, various consumer choice models are proposed to characterize the consumers' behaviors when they are provided with a list of products. However, existing works assume that each consumer purchases at most one product or will keep viewing the product list after purchasing a product, which does not agree with the common practice in real scenarios. In this paper, we assume that each consumer can purchase multiple products at will. To model consumers' willingness to view and purchase, we set a random attention span and purchase budget, which determines the maximal amount of products that he/she views and purchases, respectively. Under this setting, we first design an optimal ranking policy when the online retailer can precisely model consumers' behaviors. Based on the policy, we further develop the Multiple-Purchase-with-Budget UCB (MPB-UCB) algorithms with $Õ(\sqrt{T})$ regret that estimate consumers' behaviors and maximize revenue simultaneously in online settings. Experiments on both synthetic and semi-synthetic datasets prove the effectiveness of the proposed algorithms.