Maximizing Influence-based Group Shapley Centrality

03/17/2020
by   Ruben Becker, et al.
0

One key problem in network analysis is the so-called influence maximization problem, which consists in finding a set S of at most k seed users, in a social network, maximizing the spread of information from S. This paper studies a related but slightly different problem: We want to find a set S of at most k seed users that maximizes the spread of information, when S is added to an already pre-existing - but unknown - set of seed users T. We consider such scenario to be very realistic. Assume a central entity wants to spread a piece of news, while having a budget to influence k users. This central authority may know that some users are already aware of the information and are going to spread it anyhow. The identity of these users being however completely unknown. We model this optimization problem using the Group Shapley value, a well-founded concept from cooperative game theory. While the standard influence maximization problem is easy to approximate within a factor 1-1/e-ϵ for any ϵ>0, assuming common computational complexity conjectures, we obtain strong hardness of approximation results for the problem at hand in this paper. Maybe most prominently, we show that it cannot be approximated within 1/n^o(1) under the Gap Exponential Time Hypothesis. Hence, it is unlikely to achieve anything better than a polynomial factor approximation. Nevertheless, we show that a greedy algorithm can achieve a factor of 1-1/e/k-ϵ for any ϵ>0, showing that not all is lost in settings where k is bounded.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/20/2020

VAIM: Visual Analytics for Influence Maximization

In social networks, individuals' decisions are strongly influenced by re...
research
04/05/2021

A CoOperative Game Theoretic Approach for the Budgeted Influence Maximization Problem

Given a social network of users with selection cost, the Budgeted Influe...
research
10/25/2021

Dynamic Influence Maximization

We initiate a systematic study on 𝑑𝑦𝑛𝑎𝑚𝑖𝑐 𝑖𝑛𝑓𝑙𝑢𝑒𝑛𝑐𝑒 𝑚𝑎𝑥𝑖𝑚𝑖𝑧𝑎𝑡𝑖𝑜𝑛 (DIM). ...
research
05/31/2019

Balancing spreads of influence in a social network

The personalization of our news consumption on social media has a tenden...
research
02/27/2015

Influence Maximization with Bandits

We consider the problem of influence maximization, the problem of maximi...
research
05/10/2019

Seeding with Costly Network Information

The spread of behavior over social networks depends on the contact struc...
research
11/11/2018

Coverage Centrality Maximization in Undirected Networks

Centrality metrics are among the main tools in social network analysis. ...

Please sign up or login with your details

Forgot password? Click here to reset