Optimal pricing in e-commerce based on sparse and noisy data

作者:

Highlights:

• We propose a novel method for automated pricing in e-commerce allowing for the optimization of business metrics like profit

• Our method is designed to work on sparse and fluctuating data, as this is a common challenge in e-commerce applications

• Simulation and real-world experiments demonstrate the effectiveness of the method

摘要

In today's transparent markets, e-commerce providers often have to adjust their prices within short time intervals, e.g., to take frequently changing prices of competitors into account. Automating this task of determining an “optimal” price (e.g., in terms of profit or revenue) with a learning-based approach can however be challenging. Often, only few data points are available, making it difficult to reliably detect the relationships between a given price and the resulting revenue or profit. In this paper, we propose a novel machine-learning based framework for estimating optimal prices under such constraints. The framework is generic in terms of the optimality criterion and can be customized in different ways. At its core, it implements a novel algorithm based on Bayesian inference combined with bootstrap-based confidence estimation and kernel regression. Simulation experiments show that our method is favorable over existing dynamic pricing strategies. Furthermore, the method led to a significant increase in profit and revenue in a real-world evaluation.

论文关键词:Dynamic pricing,E-commerce,Machine learning,Data mining

论文评审过程:Received 21 May 2017, Revised 15 October 2017, Accepted 3 December 2017, Available online 14 December 2017, Version of Record 12 January 2018.

论文官网地址:https://doi.org/10.1016/j.dss.2017.12.002