Dynamic selection of clarification channels in rumor propagation containment

Abstract

<abstract><p>Rumors refer to spontaneously formed false stories. As rumors have shown severe threats to human society, it is significant to curb rumor propagation. Rumor clarification is an effective countermeasure on controlling rumor propagation. In this process, anti-rumor messages can be published through multiple media channels, including but not limited to online social platforms, TV programs and offline face-to-face campaigns. As the efficiency and cost of releasing anti-rumor information can vary from media channel to media channel, provided that the total budget is limited and fixed, it is valuable to investigate how to periodically select a combination of media channels to publish anti-rumor information so as to maximize the efficiency (i.e., make as many individuals as possible know the anti-rumor information) with the lowest cost. We refer to this issue as the dynamic channel selection (DCS) problem and any solution as a DCS strategy. To address the DCS problem, our contributions are as follows. First, we propose a rumor propagation model to characterize the influences of DCS strategies on curbing rumors. On this basis, we establish a trade-off model to evaluate DCS strategies and reduce the DCS problem to a mathematical optimization model called the DCS model. Second, based on the genetic algorithm framework, we develop a numerical method called the DCS algorithm to solve the DCS model. Third, we perform a series of numerical experiments to verify the performance of the DCS algorithm. Results show that the DCS algorithm can efficiently yield a satisfactory DCS strategy.</p></abstract>