A k-hop Collaborate Game Model: Extended to Community Budgets and Adaptive Non-Submodularity

04/02/2020
by   Jianxiong Guo, et al.
0

Revenue maximization (RM) is one of the most important problems on online social networks (OSNs), which attempts to find a small subset of users in OSNs that makes the expected revenue maximized. It has been researched intensively before. However, most of exsiting literatures were based on non-adaptive seeding strategy and on simple information diffusion model, such as IC/LT-model. It considered the single influenced user as a measurement unit to quantify the revenue. Until Collaborate Game model appeared, it considered activity as a basic object to compute the revenue. An activity initiated by a user can only influence those users whose distance are within k-hop from the initiator. Based on that, we adopt adaptive seed strategy and formulate the Revenue Maximization under the Size Budget (RMSB) problem. If taking into account the product's promotion, we extend RMSB to the Revenue Maximization under the Community Budget (RMCB) problem, where the influence can be distributed over the whole network. The objective function of RMSB and RMCB is adatpive monotone and not adaptive submodular, but in some special cases, it is adaptive submodular. We study the RMSB and RMCB problem under both the speical submodular cases and general non-submodular cases, and propose RMSBSolver and RMCBSolver to solve them with strong theoretical guarantees, respectively. Especially, we give a data-dependent approximation ratio for RMSB problem under the general non-submodular cases. Finally, we evaluate our proposed algorithms by conducting experiments on real datasets, and show the effectiveness and accuracy of our solutions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/09/2019

A k-hop Collaborate Game Model: Adaptive Strategy to Maximize Total Revenue

In Online Social Networks (OSNs), interpersonal communication and inform...
research
09/30/2021

Submodular Optimization Beyond Nonnegativity: Adaptive Seed Selection in Incentivized Social Advertising

The idea of social advertising (or social promotion) is to select a grou...
research
04/12/2020

Continuous Profit Maximization: A Study of Unconstrained Dr-submodular Maximization

Profit maximization (PM) is to select a subset of users as seeds for vir...
research
03/08/2018

A Bayesian and Machine Learning approach to estimating Influence Model parameters for IM-RO

The rise of Online Social Networks (OSNs) has caused an insurmountable a...
research
07/09/2020

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint

Constrained submodular maximization problems encompass a wide variety of...
research
02/28/2018

Stochastic Dynamic Programming Heuristics for Influence Maximization-Revenue Optimization

The well-known Influence Maximization (IM) problem has been actively stu...
research
07/11/2021

Efficient and Effective Algorithms for Revenue Maximization in Social Advertising

We consider the revenue maximization problem in social advertising, wher...

Please sign up or login with your details

Forgot password? Click here to reset