Blocking adversarial influence in social networks

DOI10.1007/978-3-030-64793-3_14zbMATH Open1484.91346arXiv2011.01346OpenAlexW3095662505MaRDI QIDQ2056948FDOQ2056948

Authors: Yanyan Li 

Publication date: 8 December 2021

Abstract: While social networks are widely used as a media for information diffusion, attackers can also strategically employ analytical tools, such as influence maximization, to maximize the spread of adversarial content through the networks. We investigate the problem of limiting the diffusion of negative information by blocking nodes and edges in the network. We formulate the interaction between the defender and the attacker as a Stackelberg game where the defender first chooses a set of nodes to block and then the attacker selects a set of seeds to spread negative information from. This yields an extremely complex bi-level optimization problem, particularly since even the standard influence measures are difficult to compute. Our approach is to approximate the attacker's problem as the maximum node domination problem. To solve this problem, we first develop a method based on integer programming combined with constraint generation. Next, to improve scalability, we develop an approximate solution method that represents the attacker's problem as an integer program, and then combines relaxation with duality to yield an upper bound on the defender's objective that can be computed using mixed integer linear programming. Finally, we propose an even more scalable heuristic method that prunes nodes from the consideration set based on their degree. Extensive experiments demonstrate the efficacy of our approaches.

Full work available at URL: https://arxiv.org/abs/2011.01346

Recommendations

• Negative influence blocking maximization with uncertain sources under the independent cascade model
• Information diffusion blocking model of node influence-oriented in online social network
• Influence maximization in social networks with privacy protection
• Community-based rumor blocking maximization in social networks
• Influence Maximization in Social Networks
• Community-based rumor blocking maximization in social networks: algorithms and analysis

zbMATH Keywords

Stackelberg gameinfluence maximizationinfluence blocking

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Hierarchical games (including Stackelberg games) (91A65)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Collective dynamics of `small-world' networks
• Machine Learning: ECML 2004
• Title not available (Why is that?)
• Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters

Cited In (7)

• Detecting bots and assessing their impact in social networks
• Identifying structural hole spanners to maximally block information propagation
• Maximizing convergence time in network averaging dynamics subject to edge removal
• Detecting organization-targeted socialbots by monitoring social network profiles
• Negative influence blocking maximization with uncertain sources under the independent cascade model
• Defending against fake VIP in scant-transparency information systems with QoS differentiation
• Game theory on attack graph for cyber deception

This page was built for publication: Blocking adversarial influence in social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056948)