Optimizing Item-based Marketing Promotion Efficiency in C2C Marketplace with Dynamic Sequential Coupon Allocation Framework
- URL: http://arxiv.org/abs/2409.08609v1
- Date: Fri, 13 Sep 2024 07:52:45 GMT
- Title: Optimizing Item-based Marketing Promotion Efficiency in C2C Marketplace with Dynamic Sequential Coupon Allocation Framework
- Authors: Jie Yang, Padunna Valappil Krishnaraj Sekhar, Sho Sekine, Yilin Li,
- Abstract summary: We introduce a Dynamic Sequential Coupon Allocation Framework (DSCAF) to optimize item coupon allocation strategies across a series of promotions.
DSCAF provides sequential recommendations for coupon configurations and timing to target items.
It integrates two predictors for estimating the sale propensity in the current and subsequent rounds of coupon allocation, and a decision-making process to determine the coupon allocation solution.
- Score: 4.664065531235124
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In e-commerce platforms, coupons play a crucial role in boosting transactions. In the customer-to-customer (C2C) marketplace, ensuring the satisfaction of both buyers and sellers is essential. While buyer-focused marketing strategies often receive more attention, addressing the needs of sellers is equally important. Additionally, the existing strategies tend to optimize each promotion independently, resulting in a lack of continuity between promotions and unnecessary costs in the pursuit of short-term impact within each promotion period. We introduce a Dynamic Sequential Coupon Allocation Framework (DSCAF) to optimize item coupon allocation strategies across a series of promotions. DSCAF provides sequential recommendations for coupon configurations and timing to target items. In cases where initial suggestions do not lead to sales, it dynamically adjusts the strategy and offers subsequent solutions. It integrates two predictors for estimating the sale propensity in the current and subsequent rounds of coupon allocation, and a decision-making process to determine the coupon allocation solution. It runs iteratively until the item is sold. The goal of the framework is to maximize Return on Investment (ROI) while ensuring lift Sell-through Rate (STR) remains above a specified threshold. DSCAF aims to optimize sequential coupon efficiency with a long-term perspective rather than solely focusing on the lift achieved in each individual promotion. It has been applied for item coupon allocation in Mercari.
Related papers
- Procurement Auctions via Approximately Optimal Submodular Optimization [53.93943270902349]
We study procurement auctions, where an auctioneer seeks to acquire services from strategic sellers with private costs.
Our goal is to design computationally efficient auctions that maximize the difference between the quality of the acquired services and the total cost of the sellers.
arXiv Detail & Related papers (2024-11-20T18:06:55Z) - 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) - 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) - No-Regret Learning in Two-Echelon Supply Chain with Unknown Demand
Distribution [48.27759561064771]
We consider the two-echelon supply chain model introduced in [Cachon and Zipkin, 1999] under two different settings.
We design algorithms that achieve favorable guarantees for both regret and convergence to the optimal inventory decision in both settings.
Our algorithms are based on Online Gradient Descent and Online Newton Step, together with several new ingredients specifically designed for our problem.
arXiv Detail & Related papers (2022-10-23T08:45:39Z) - Personalized Promotion Decision Making Based on Direct and Enduring
Effect Predictions [5.50110172922112]
We propose a framework of multiple treatment promotion decision making by modeling each customer's direct and enduring response.
First, we propose a customer direct and enduring effect (CDEE) model which predicts the customer direct and enduring response.
With the help of the CDEE, we personalize incentive allocation to optimize the enduring effect while keeping the cost under the budget.
arXiv Detail & Related papers (2022-07-23T07:13:57Z) - 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) - E-Commerce Promotions Personalization via Online Multiple-Choice
Knapsack with Uplift Modeling [1.027974860479791]
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.
arXiv Detail & Related papers (2021-08-11T15:09:16Z) - 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) - 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)
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.