E-Commerce Promotions Personalization via Online Multiple-Choice Knapsack with Uplift Modeling

• URL: http://arxiv.org/abs/2108.13298v2
• Date: Tue, 31 Aug 2021 19:36:07 GMT
• Title: E-Commerce Promotions Personalization via Online Multiple-Choice Knapsack with Uplift Modeling
• Authors: Javier Albert, Dmitri Goldenberg
• Abstract summary: We study the Online Constrained Multiple-Choice Promotions Personalization Problem. Our work formalizes the problem as an Online Multiple Choice Knapsack Problem. We provide a real-time adaptive method that guarantees budget constraints compliance.
• Score: 1.027974860479791
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Promotions and discounts are essential components of modern e-commerce platforms, where they are often used to incentivize customers towards purchase completion. Promotions also affect revenue and may incur a monetary loss that is often limited by a dedicated promotional budget. We study the Online Constrained Multiple-Choice Promotions Personalization Problem, where the optimization goal is to select for each customer which promotion to present in order to maximize purchase completions, while also complying with global budget limitations. Our work formalizes the problem as an Online Multiple Choice Knapsack Problem and extends the existent literature by addressing cases with negative weights and values. We provide a real-time adaptive method that guarantees budget constraints compliance and achieves above 99.7% of the optimal promotional impact on various datasets. Our method is evaluated on a large-scale experimental study at one of the leading online travel platforms in the world.

Related papers

• End-to-End Cost-Effective Incentive Recommendation under Budget Constraint with Uplift Modeling [12.160403526724476]
  We propose a novel End-to-End Cost-Effective Incentive Recommendation (E3IR) model under budget constraints. Specifically, our methods consist of two modules, i.e., the uplift prediction module and the differentiable allocation module. Our E3IR improves allocation performance compared to existing two-stage approaches.
  arXiv  Detail & Related papers  (2024-08-21T13:48:00Z)
• 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)
• Learning to Cover: Online Learning and Optimization with Irreversible Decisions [50.5775508521174]
  We find that regret grows sub-linearly at a rate $Thetaleft(mfrac12cdotfrac11-2-Tright)$, thus converging exponentially fast to $Theta(sqrtm)$. These findings underscore the benefits of limited online learning and optimization, in that even a few rounds can provide significant benefits as compared to a no-learning baseline.
  arXiv  Detail & Related papers  (2024-06-20T23:00:25Z)
• Emulating Full Client Participation: A Long-Term Client Selection Strategy for Federated Learning [48.94952630292219]
  We propose a novel client selection strategy designed to emulate the performance achieved with full client participation. In a single round, we select clients by minimizing the gradient-space estimation error between the client subset and the full client set. In multi-round selection, we introduce a novel individual fairness constraint, which ensures that clients with similar data distributions have similar frequencies of being selected.
  arXiv  Detail & Related papers  (2024-05-22T12:27:24Z)
• Learning Personalized Decision Support Policies [56.949897454209186]
  $texttModiste$ is an interactive tool to learn personalized decision support policies. We find that personalized policies outperform offline policies, and, in the cost-aware setting, reduce the incurred cost with minimal degradation to performance.
  arXiv  Detail & Related papers  (2023-04-13T17:53:34Z)
• A Profit-Maximizing Strategy for Advertising on the e-Commerce Platforms [1.565361244756411]
  The proposed model aims to find the optimal set of features to maximize the probability of converting targeted audiences into actual buyers. We conduct an empirical study featuring real-world data from Tmall to show that our proposed method can effectively optimize the advertising strategy with budgetary constraints.
  arXiv  Detail & Related papers  (2022-10-31T01:45:42Z)
• Offer Personalization using Temporal Convolution Network and Optimization [0.0]
  Increase in online shopping and high market competition has led to an increase in promotional expenditure for online retailers. We propose our approach to solve the offer optimization problem at the intersection of consumer, item and time in retail setting.
  arXiv  Detail & Related papers  (2020-10-14T10:59:34Z)
• Free Lunch! Retrospective Uplift Modeling for Dynamic Promotions Recommendation within ROI Constraints [9.733174472837275]
  For online travel platforms (OTPs), popular promotions include room upgrades, free meals and transportation services. Promotions usually incur a cost that, if uncontrolled, can become unsustainable. For a promotion to be viable, its associated costs must be balanced by incremental revenue within set financial constraints. This paper introduces a novel uplift modeling technique, relying on the Knapsack Problem formulation.
  arXiv  Detail & Related papers  (2020-08-14T11:13:58Z)
• Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising [52.3825928886714]
  We formulate the sequential advertising strategy optimization as a dynamic knapsack problem. We propose a theoretically guaranteed bilevel optimization framework, which significantly reduces the solution space of the original optimization space. To improve the exploration efficiency of reinforcement learning, we also devise an effective action space reduction approach.
  arXiv  Detail & Related papers  (2020-06-29T18:50:35Z)
• MoTiAC: Multi-Objective Actor-Critics for Real-Time Bidding [47.555870679348416]
  We propose a Multi-ecTive Actor-Critics algorithm named MoTiAC for the problem of bidding optimization with various goals. Unlike previous RL models, the proposed MoTiAC can simultaneously fulfill multi-objective tasks in complicated bidding environments.
  arXiv  Detail & Related papers  (2020-02-18T07:16:39Z)

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.