Price Optimization in Fashion E-commerce

• URL: http://arxiv.org/abs/2007.05216v2
• Date: Mon, 24 Aug 2020 10:18:53 GMT
• Title: Price Optimization in Fashion E-commerce
• Authors: Sajan Kedia, Samyak Jain, Abhishek Sharma
• Abstract summary: We propose a novel machine learning and optimization technique to find the optimal price point at an individual product level. According to the AB test result, our model is improving the revenue by 1 percent and gross margin by 0.81 percent.
• Score: 4.974165555396548
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the rapid growth in the fashion e-commerce industry, it is becoming extremely challenging for the E-tailers to set an optimal price point for all the products on the platform. By establishing an optimal price point, they can maximize overall revenue and profit for the platform. In this paper, we propose a novel machine learning and optimization technique to find the optimal price point at an individual product level. It comprises three major components. Firstly, we use a demand prediction model to predict the next day demand for each product at a certain discount percentage. Next step, we use the concept of price elasticity of demand to get the multiple demand values by varying the discount percentage. Thus we obtain multiple price demand pairs for each product and we have to choose one of them for the live platform. Typically fashion e-commerce has millions of products, so there can be many permutations. Each permutation will assign a unique price point for all the products, which will sum up to a unique revenue number. To choose the best permutation which gives maximum revenue, a linear programming optimization technique is used. We have deployed the above methods in the live production environment and conducted several AB tests. According to the AB test result, our model is improving the revenue by 1 percent and gross margin by 0.81 percent.

Related papers

• A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
  We address the problem of dynamically pricing complementary items that are sequentially displayed to customers. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
  arXiv  Detail & Related papers  (2024-07-08T09:55:31Z)
• Decoding-Time Language Model Alignment with Multiple Objectives [116.42095026960598]
  Existing methods primarily focus on optimizing LMs for a single reward function, limiting their adaptability to varied objectives. Here, we propose $textbfmulti-objective decoding (MOD)$, a decoding-time algorithm that outputs the next token from a linear combination of predictions. We show why existing approaches can be sub-optimal even in natural settings and obtain optimality guarantees for our method.
  arXiv  Detail & Related papers  (2024-06-27T02:46:30Z)
• Fair Allocation in Dynamic Mechanism Design [57.66441610380448]
  We consider a problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds. The auctioneer aims to maximize their discounted overall revenue while adhering to a fairness constraint that guarantees a minimum average allocation for each group.
  arXiv  Detail & Related papers  (2024-05-31T19:26:05Z)
• Online Prompt Pricing based on Combinatorial Multi-Armed Bandit and Hierarchical Stackelberg Game [29.95198837731957]
  Our pricing mechanism considers the profits of the consumer, platform, and seller, simultaneously achieving the profit satisfaction of these three participants. Unlike the existing fixed pricing mode, the PBT pricing mechanism we propose is more flexible and diverse, which is more in accord with the transaction needs of real-world scenarios.
  arXiv  Detail & Related papers  (2024-05-24T02:13:46Z)
• Dynamic Pricing and Learning with Long-term Reference Effects [16.07344044662994]
  We study a simple and novel reference price mechanism where reference price is the average of the past prices offered by the seller. We show that under this mechanism, a markdown policy is near-optimal irrespective of the parameters of the model. We then consider a more challenging dynamic pricing and learning problem, where the demand model parameters are apriori unknown.
  arXiv  Detail & Related papers  (2024-02-19T21:36:54Z)
• Dynamic Pricing with Volume Discounts in Online Settings [102.00782184214326]
  This paper focuses on pricing in e-commerce when objective function is profit and only transaction data are available. Our work aims to find a pricing strategy that allows defining optimal prices at different volume thresholds to serve different classes of users. We design a two-phase online learning algorithm, namely-B- capable of exploiting the data in an online fashion.
  arXiv  Detail & Related papers  (2022-11-17T16:01:06Z)
• Product Ranking for Revenue Maximization with Multiple Purchases [29.15026863056805]
  We propose an optimal ranking policy when the online retailer can precisely model consumers' behaviors. We develop the Multiple-Purchase-with-Budget UCB algorithms with $O(sqrtT)$ regret. Experiments on both synthetic and semi-synthetic datasets prove the effectiveness of the proposed algorithms.
  arXiv  Detail & Related papers  (2022-10-15T11:59:45Z)
• Price DOES Matter! Modeling Price and Interest Preferences in Session-based Recommendation [55.0391061198924]
  Session-based recommendation aims to predict items that an anonymous user would like to purchase based on her short behavior sequence. It is nontrivial to incorporate price preferences for session-based recommendation. We propose a novel method Co-guided Heterogeneous Hypergraph Network (CoHHN) for session-based recommendation.
  arXiv  Detail & Related papers  (2022-05-09T10:47:15Z)
• Towards Revenue Maximization with Popular and Profitable Products [69.21810902381009]
  A common goal for companies marketing is to maximize the return revenue/profit by utilizing the various effective marketing strategies. Finding credible and reliable information on products' profitability is difficult since most products tends to peak at certain times. This paper proposes a general profit-oriented framework to address the problem of revenue based on economic behavior, and conducting the 0n-shelf Popular and most Profitable Products (OPPPs) for the targeted marketing.
  arXiv  Detail & Related papers  (2022-02-26T02:07:25Z)
• Demand Prediction Using Machine Learning Methods and Stacked Generalization [0.0]
  We propose a new approach for demand prediction on an e-commerce web site. The business model used in the e-commerce web site includes many sellers that sell the same product at the same time at different prices.
  arXiv  Detail & Related papers  (2020-09-21T10:58:07Z)
• Studying Product Competition Using Representation Learning [7.01269741110576]
  We introduce Product2Vec, a method based on the representation learning algorithm Word2Vec to study product-level competition. The proposed model takes shopping baskets as inputs and, for every product, generates a low-dimensional embedding that preserves important product information. We show that, compared with state-of-the-art models, our approach is faster, and can produce more accurate demand forecasts and price elasticities.
  arXiv  Detail & Related papers  (2020-05-21T00:36:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.