arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.06199stat.MLcs.LG
收藏

基于上下文的在线聚类动态定价

Context-Based Dynamic Pricing with Online Clustering

McGill University(麦吉尔大学);New York University(纽约大学);University of Michigan(密歇根大学);Amazon(亚马逊);Alibaba Group(阿里巴巴集团)

Sentao Miao, Xi Chen, Xiuli Chao, Jiaxi Liu, Yidong Zhang

摘要:

我们考虑了一个基于上下文的在线产品的动态定价问题,其中有低销量。来自全球主要在线零售商阿里巴巴的销售数据说明了低价产品的普遍性。对于这些产品,现有的单产品动态定价算法由于数据样本不足而不能很好地工作。为了应对这一挑战,我们提出了定价政策,同时执行集群的产品需求,并设置个人的定价决策的飞行。通过对数据进行聚类并识别具有相似需求模式的产品,我们利用同一聚类中产品的销售数据来改进需求估计,从而做出更好的定价决策。我们使用后悔的算法进行评估,结果表明,当产品需求函数来自多个集群,我们的算法显着优于传统的单一产品定价策略。使用阿里巴巴的真实数据集进行的数值实验表明,与几个基准策略相比,所提出的策略增加了收入。结果表明,在线聚类是一种有效的方法来解决与低销售产品的动态定价问题。

英文摘要:

We consider a context-based dynamic pricing problem of online products, which have low sales. Sales data from Alibaba, a major global online retailer, illustrate the prevalence of low-sale products. For these products, existing single-product dynamic pricing algorithms do not work well due to insufficient data samples. To address this challenge, we propose pricing policies that concurrently perform clustering over product demand and set individual pricing decisions on the fly. By clustering data and identifying products that have similar demand patterns, we utilize sales data from products within the same cluster to improve demand estimation for better pricing decisions. We evaluate the algorithms using regret, and the result shows that when product demand functions come from multiple clusters, our algorithms significantly outperform traditional single-product pricing policies. Numerical experiments using a real dataset from Alibaba demonstrate that the proposed policies, compared with several benchmark policies, increase the revenue. The results show that online clustering is an effective approach to tackling dynamic pricing problems associated with low-sale products.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑