@article{Becker_Corò_D’Angelo_Gilbert_2020, title={Balancing Spreads of Influence in a Social Network}, volume={34}, url={https://ojs.aaai.org/index.php/AAAI/article/view/5327}, DOI={10.1609/aaai.v34i01.5327}, abstractNote={<p>The personalization of our news consumption on social media has a tendency to reinforce our pre-existing beliefs instead of balancing our opinions. To tackle this issue, Garimella et al. (NIPS’17) modeled the spread of these viewpoints, also called campaigns, using the independent cascade model introduced by Kempe, Kleinberg and Tardos (KDD’03) and studied an optimization problem that aims to balance information exposure when two opposing campaigns propagate in a network. This paper investigates a natural generalization of this optimization problem in which μ different campaigns propagate in the network and we aim to maximize the expected number of nodes that are reached by at least ν or none of the campaigns, where <em>μ</em> ≥ <em>ν</em> ≥ 2. Following Garimella et al., despite this general setting, we also investigate a simplified one, in which campaigns propagate in a correlated manner. While for the simplified setting, we show that the problem can be approximated within a constant factor for any constant μ and ν, for the general setting, we give reductions leading to several approximation hardness results when <em>ν</em> ≥ 3. For instance, assuming the gap exponential time hypothesis to hold, we obtain that the problem cannot be approximated within a factor of <em>n</em><sup>−<em>g</em>(<em>n</em>)</sup> for any <em>g</em>(<em>n</em>) = <em>o</em>(1) where <em>n</em> is the number of nodes in the network. We complement our hardness results with an Ω(<em>n</em><sup>−1/2</sup>)-approximation algorithm for the general setting when <em>ν</em> = 3 and μ is arbitrary.</p>}, number={01}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Becker, Ruben and Corò, Federico and D’Angelo, Gianlorenzo and Gilbert, Hugo}, year={2020}, month={Apr.}, pages={3-10} }