Optimizing Spread of Influence in Social Networks via Partial Incentives

DOI10.1007/978-3-319-25258-2_9zbMath1471.91391arXiv1512.06372OpenAlexW2288648090MaRDI QIDQ3460711

Gennaro Cordasco, Adele A. Rescigno, Ugo Vaccaro, Luisa Gargano

Publication date: 8 January 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items

Dual domination problems in graphs, Discovering small target sets in social networks: a fast and effective algorithm, Weighted target set selection on trees and cycles, Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives, A branch‐and‐cut approach for the least cost influence problem on social networks, Active influence spreading in social networks, Target set selection for conservative populations, On some tractable and hard instances for partial incentives and target set selection, How to choose friends strategically, Whom to befriend to influence people, Fast and frugal targeting with incentives, Least-Cost Influence Maximization on Social Networks

Uses Software

• SNAP

Cites Work

• Unnamed Item
• Unnamed Item
• On dynamic monopolies of graphs with general thresholds
• Combinatorial model and bounds for target set selection
• Treewidth governs the complexity of target set selection
• Irreversible conversion of graphs
• On time versus size for monotone dynamic monopolies in regular topologies
• Some results on the target set selection problem
• Spread of influence in weighted networks under time and budget constraints
• Latency-bounded target set selection in social networks
• Influence Diffusion in Social Networks under Time Window Constraints
• On the Approximability of Influence in Social Networks
• Constant Thresholds Can Make Target Set Selection Tractable
• Parameterized Approximability of Maximizing the Spread of Influence in Networks
• Target Set Selection Problem for Honeycomb Networks
• Contagious Sets in Expanders
• Automata, Languages and Programming
• Variants of Spreading Messages