Abstract

In social networks, to increase the number of followers, media express their opinions through posts, articles, and published content to cater to public preferences. Meanwhile, the evolution of public opinions is affected by both the media and peers. In this work, we investigate how the interactions between media affect the dynamics of public opinions in social networks. We propose a reinforcement learning framework to model the interactions between the public (gossipers) and media agents. We model each gossiper as an individually rational agent, which updates its opinion using the bounded confidence model (BCM). Media agents are interested in maximizing the number of following gossipers competitively, and an algorithm, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i.e</i> ., WoLS-CALA, is proposed to achieve that goal. We analyze and experimentally verify that WoLS-CALA can learn Nash equilibria (NE) for games with continuous action space. In addition, the opinion dynamics of gossipers are theoretically analyzed, which shows that the existence of media will strengthen the consistency of gossipers' opinions. We then evaluate the framework in two synthetic networks, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i.e</i> ., a fully connected network and a small-world network, and one real data network from Facebook. Extensive empirical simulation reveals that our framework facilitates the consensus of opinions and confirms the theoretical analysis.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.