arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2105.08313cs.AI
收藏

电子商业生鲜零售降价行为的反事实预测与多阶段优化方法

Markdowns in E-Commerce Fresh Retail: A Counterfactual Prediction and Multi-Period Optimization Approach

Alibaba Group(阿里巴巴集团)

Junhao Hua, Ling Yan, Huan Xu, Cheng Yang

摘要:

在本文中,通过利用丰富的观测交易数据,我们提出了一种新的数据驱动和可解释的降价定价方法,包括反事实预测和多阶段价格优化。首先,我们建立了一个半参数结构模型来学习个体价格弹性和预测反事实需求。这种半参数模型既利用了非参数机器学习模型的可预测性,又利用了经济模型的可解释性。其次,我们提出了一个多阶段的动态定价算法,以最大限度地提高总利润的易逝品在其有限的销售期限。与传统的确定性需求预测方法不同,由于反事实需求在预测过程中不可避免地具有随机性,本文对反事实需求的不确定性进行了建模。在随机模型的基础上,利用马尔可夫决策过程推导出了一种序列定价策略,并设计了一个两阶段算法来求解,该算法是非常有效的。它将时间复杂度从指数降低到多项式。实验结果验证了该定价算法的有效性,并成功应用于电子商业生鲜零售场景--鲜河马。

英文摘要:

In this paper, by leveraging abundant observational transaction data, we propose a novel data-driven and interpretable pricing approach for markdowns, consisting of counterfactual prediction and multi-period price optimization. Firstly, we build a semi-parametric structural model to learn individual price elasticity and predict counterfactual demand. This semi-parametric model takes advantage of both the predictability of nonparametric machine learning model and the interpretability of economic model. Secondly, we propose a multi-period dynamic pricing algorithm to maximize the overall profit of a perishable product over its finite selling horizon. Different with the traditional approaches that use the deterministic demand, we model the uncertainty of counterfactual demand since it inevitably has randomness in the prediction process. Based on the stochastic model, we derive a sequential pricing strategy by Markov decision process, and design a two-stage algorithm to solve it. The proposed algorithm is very efficient. It reduces the time complexity from exponential to polynomial. Experimental results show the advantages of our pricing algorithm, and the proposed framework has been successfully deployed to the well-known e-commerce fresh retail scenario - Freshippo.

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

↑