Graph Representation Learning for Merchant Incentive Optimization in Mobile Payment Marketing

• URL: http://arxiv.org/abs/2003.01515v1
• Date: Thu, 27 Feb 2020 18:48:55 GMT
• Title: Graph Representation Learning for Merchant Incentive Optimization in Mobile Payment Marketing
• Authors: Ziqi Liu, Dong Wang, Qianyu Yu, Zhiqiang Zhang, Yue Shen, Jian Ma, Wenliang Zhong, Jinjie Gu, Jun Zhou, Shuang Yang, Yuan Qi
• Abstract summary: We present a graph representation learning method atop of transaction networks for merchant incentive optimization in mobile payment marketing. We are able to model the sensitivity to incentive for each merchant, and spend the most budgets on those merchants that show strong sensitivities in the marketing campaign.
• Score: 26.154050518762457
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Mobile payment such as Alipay has been widely used in our daily lives. To further promote the mobile payment activities, it is important to run marketing campaigns under a limited budget by providing incentives such as coupons, commissions to merchants. As a result, incentive optimization is the key to maximizing the commercial objective of the marketing campaign. With the analyses of online experiments, we found that the transaction network can subtly describe the similarity of merchants' responses to different incentives, which is of great use in the incentive optimization problem. In this paper, we present a graph representation learning method atop of transaction networks for merchant incentive optimization in mobile payment marketing. With limited samples collected from online experiments, our end-to-end method first learns merchant representations based on an attributed transaction networks, then effectively models the correlations between the commercial objectives each merchant may achieve and the incentives under varying treatments. Thus we are able to model the sensitivity to incentive for each merchant, and spend the most budgets on those merchants that show strong sensitivities in the marketing campaign. Extensive offline and online experimental results at Alipay demonstrate the effectiveness of our proposed approach.

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)
• Enhancing Monotonic Modeling with Spatio-Temporal Adaptive Awareness in Diverse Marketing [15.024320284683215]
  OFOS platforms offer dynamic allocation incentives to users and merchants to encourage payments. We propose a Constrained Monotonic Adaptive Network (CoMAN) method for robustness-temporal perception within marketing pricing efficiency. Our experiments demonstrate the effectiveness of the proposed approach while outperforming the monotonic state-of-the-art method.
  arXiv  Detail & Related papers  (2024-06-20T09:21:09Z)
• A Bargaining-based Approach for Feature Trading in Vertical Federated Learning [54.51890573369637]
  We propose a bargaining-based feature trading approach in Vertical Federated Learning (VFL) to encourage economically efficient transactions. Our model incorporates performance gain-based pricing, taking into account the revenue-based optimization objectives of both parties.
  arXiv  Detail & Related papers  (2024-02-23T10:21:07Z)
• 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)
• ItemSage: Learning Product Embeddings for Shopping Recommendations at Pinterest [60.841761065439414]
  At Pinterest, we build a single set of product embeddings called ItemSage to provide relevant recommendations in all shopping use cases. This approach has led to significant improvements in engagement and conversion metrics, while reducing both infrastructure and maintenance cost.
  arXiv  Detail & Related papers  (2022-05-24T02:28:58Z)
• 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)
• Bidding via Clustering Ads Intentions: an Efficient Search Engine Marketing System for E-commerce [13.601308818833301]
  This paper introduces the end-to-end structure of the bidding system for search engine marketing for Walmart e-commerce. We exploit the natural language signals from the users' query and the contextual knowledge from the products to mitigate the sparsity issue. We analyze the online and offline performances of our approach and discuss how we find it as a production-efficient solution.
  arXiv  Detail & Related papers  (2021-06-24T00:12:07Z)
• A Cooperative-Competitive Multi-Agent Framework for Auto-bidding in Online Advertising [53.636153252400945]
  We propose a general Multi-Agent reinforcement learning framework for Auto-Bidding, namely MAAB, to learn the auto-bidding strategies. Our approach outperforms several baseline methods in terms of social welfare and guarantees the ad platform's revenue.
  arXiv  Detail & Related papers  (2021-06-11T08:07:14Z)
• 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)
• Heterogeneous Causal Learning for Effectiveness Optimization in User Marketing [2.752817022620644]
  We propose a treatment effect optimization methodology for user marketing. This algorithm learns from past experiments and utilizes novel optimization methods to optimize cost efficiency with respect to user selection. Our proposed constrained and direct optimization algorithms outperform by 24.6% compared with the best performing method in prior art and baseline methods.
  arXiv  Detail & Related papers  (2020-04-21T01:34:34Z)

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.