GAC: A Deep Reinforcement Learning Model Toward User Incentivization in Unknown Social Networks

• URL: http://arxiv.org/abs/2203.09578v1
• Date: Thu, 17 Mar 2022 19:41:49 GMT
• Title: GAC: A Deep Reinforcement Learning Model Toward User Incentivization in Unknown Social Networks
• Authors: Shiqing Wu, Weihua Li, Quan Bai
• Abstract summary: We propose an end-to-end reinforcement learning-based framework, named Geometric Actor-Critic (GAC), to discover effective incentive allocation policies. We use three real-world social network datasets to evaluate the performance of the proposed GAC.
• Score: 3.3946853660795884
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In recent years, providing incentives to human users for attracting their attention and engagement has been widely adopted in many applications. To effectively incentivize users, most incentive mechanisms determine incentive values based on users' individual attributes, such as preferences. These approaches could be ineffective when such information is unavailable. Meanwhile, due to the budget limitation, the number of users who can be incentivized is also restricted. In this light, we intend to utilize social influence among users to maximize the incentivization. By directly incentivizing influential users in the social network, their followers and friends could be indirectly incentivized with fewer incentives or no incentive. However, it is difficult to identify influential users beforehand in the social network, as the influence strength between each pair of users is typically unknown. In this work, we propose an end-to-end reinforcement learning-based framework, named Geometric Actor-Critic (GAC), to discover effective incentive allocation policies under limited budgets. More specifically, the proposed approach can extract information from a high-level network representation for learning effective incentive allocation policies. The proposed GAC only requires the topology of the social network and does not rely on any prior information about users' attributes. We use three real-world social network datasets to evaluate the performance of the proposed GAC. The experimental results demonstrate the effectiveness of the proposed approach.

Related papers

• Fractional Budget Allocation for Influence Maximization under General Marketing Strategies [15.985300892420137]
  We consider the fractional influence problem, i.e., identifying users on a social network to be incentivized with potentially partial discounts. The larger the discount given to a user, the higher the likelihood of its activation, who then attempts to activate its neighboring users. Our goal is to devise efficient algorithms that assign initial discounts to the network's users to maximize the total number of activated users.
  arXiv  Detail & Related papers  (2024-07-08T07:09:11Z)
• Incentivized Truthful Communication for Federated Bandits [61.759855777522255]
  We propose an incentive compatible (i.e., truthful) communication protocol, named Truth-FedBan. We show that Truth-FedBan still guarantees the sub-linear regret and communication cost without any overheads.
  arXiv  Detail & Related papers  (2024-02-07T00:23:20Z)
• Decoding the Silent Majority: Inducing Belief Augmented Social Graph with Large Language Model for Response Forecasting [74.68371461260946]
  SocialSense is a framework that induces a belief-centered graph on top of an existent social network, along with graph-based propagation to capture social dynamics. Our method surpasses existing state-of-the-art in experimental evaluations for both zero-shot and supervised settings.
  arXiv  Detail & Related papers  (2023-10-20T06:17:02Z)
• Incentivized Communication for Federated Bandits [67.4682056391551]
  We introduce an incentivized communication problem for federated bandits, where the server shall motivate clients to share data by providing incentives. We propose the first incentivized communication protocol, namely, Inc-FedUCB, that achieves near-optimal regret with provable communication and incentive cost guarantees.
  arXiv  Detail & Related papers  (2023-09-21T00:59:20Z)
• A Spreader Ranking Algorithm for Extremely Low-budget Influence Maximization in Social Networks using Community Bridge Nodes [12.691905338833372]
  The aim of Influence Maximisation (IM) is to identify certain nodes in the network which can help maximize the spread of certain information. We propose a community structures-based approach, which employs a K-Shell algorithm in order to generate a score for the connections between seed nodes and communities. We choose the Independent Cascade (IC) model to simulate information spread and evaluate it on four evaluation metrics.
  arXiv  Detail & Related papers  (2022-11-17T16:53:47Z)
• Knowledge-aware Coupled Graph Neural Network for Social Recommendation [29.648300580880683]
  We propose a Knowledge-aware Coupled Graph Neural Network (KCGN) that injects the inter-dependent knowledge across items and users into the recommendation framework. KCGN enables the high-order user- and item-wise relation encoding by exploiting the mutual information for global graph structure awareness. We further augment KCGN with the capability of capturing dynamic multi-typed user-item interactive patterns.
  arXiv  Detail & Related papers  (2021-10-08T09:13:51Z)
• A framework for massive scale personalized promotion [18.12992386307048]
  Technology companies building consumer-facing platforms may have access to massive-scale user population. Promotion with quantifiable incentive has become a popular approach for increasing active users on such platforms. This paper proposes a practical two-stage framework that can optimize the ROI of various massive-scale promotion campaigns.
  arXiv  Detail & Related papers  (2021-08-27T03:03:18Z)
• Identifying Influential Users in Unknown Social Networks for Adaptive Incentive Allocation Under Budget Restriction [24.793013471521924]
  Incentivization has been proven to be a more proactive way to affect users' behaviors. We propose a novel algorithm for exploring influential users in unknown networks. We design an adaptive incentive allocation approach that determines incentive values based on users' preferences and their influence ability.
  arXiv  Detail & Related papers  (2021-07-13T11:20:10Z)
• Incentive Mechanism Design for Resource Sharing in Collaborative Edge Learning [106.51930957941433]
  In 5G and Beyond networks, Artificial Intelligence applications are expected to be increasingly ubiquitous. This necessitates a paradigm shift from the current cloud-centric model training approach to the Edge Computing based collaborative learning scheme known as edge learning.
  arXiv  Detail & Related papers  (2020-05-31T12:45:06Z)
• Empowering Active Learning to Jointly Optimize System and User Demands [70.66168547821019]
  We propose a new active learning approach that jointly optimize the active learning system (training efficiently) and the user (receiving useful instances) We study our approach in an educational application, which particularly benefits from this technique as the system needs to rapidly learn to predict the appropriateness of an exercise to a particular user. We evaluate multiple learning strategies and user types with data from real users and find that our joint approach better satisfies both objectives when alternative methods lead to many unsuitable exercises for end users.
  arXiv  Detail & Related papers  (2020-05-09T16:02:52Z)
• DiffNet++: A Neural Influence and Interest Diffusion Network for Social Recommendation [50.08581302050378]
  Social recommendation has emerged to leverage social connections among users for predicting users' unknown preferences. We propose a preliminary work of a neural influence diffusion network (i.e., DiffNet) for social recommendation (Diffnet) In this paper, we propose DiffNet++, an improved algorithm of Diffnet that models the neural influence diffusion and interest diffusion in a unified framework.
  arXiv  Detail & Related papers  (2020-01-15T08:45: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.