scholarly journals Evolutionary Game Model of Public Opinion Information Propagation in Online Social Networks

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 127732-127747 ◽  
Author(s):  
Jiakun Wang ◽  
Xinhua Wang ◽  
Li Fu
2021 ◽  
Vol 33 (1) ◽  
pp. 47-70
Author(s):  
Santhoshkumar Srinivasan ◽  
Dhinesh Babu L. D.

Online social networks (OSNs) are used to connect people and propagate information around the globe. Along with information propagation, rumors also penetrate across the OSNs in a massive order. Controlling the rumor propagation is utmost important to reduce the damage it causes to society. Educating the individual participants of OSNs is one of the effective ways to control the rumor faster. To educate people in OSNs, this paper proposes a defensive rumor control approach that spreads anti-rumors by the inspiration from the immunization strategies of social insects. In this approach, a new information propagation model is defined to study the defensive nature of true information against rumors. Then, an anti-rumor propagation method with a set of influential spreaders is employed to defend against the rumor. The proposed approach is compared with the existing rumor containment approaches and the results indicate that the proposed approach works well in controlling the rumors.


2019 ◽  
Vol 30 (11) ◽  
pp. 1950094 ◽  
Author(s):  
Jianye Yu ◽  
Junjie Lv ◽  
Yuanzhuo Wang ◽  
Jingyuan Li

Information dissemination groups, especially those disseminating the same kind of information such as advertising, product promotion, etc., compete with each other when their information spread on social networks. Most of the existing methods analyze the dissemination mechanism mainly upon the information itself without considering human characteristics, e.g. relation networks, cooperation/defection, etc. In this paper, we introduce a framework of social evolutionary game (SEG) to investigate the influence of human behaviors in competitive information dissemination. Coordination game is applied to represent human behaviors in the competition of asynchronous information diffusion. We perform a series of simulations through a specific game model to analyze the mechanism and factors of information diffusion, and show that when the benefits of competitive information is around 1.2 times of the original one, it can compensate the loss of reputation caused by the change of strategy. Furthermore, through experiments on a dataset of two films on Sina Weibo, we described the mechanism of competition evolution over real data of social network, and validated the effectiveness of our model.


2020 ◽  
Author(s):  
Sarah Gelper ◽  
Ralf van der Lans ◽  
Gerrit van Bruggen

Many firms try to leverage consumers’ interactions on social platforms as part of their communication strategies. However, information on online social networks only propagates if it receives consumers’ attention. This paper proposes a seeding strategy to maximize information propagation while accounting for competition for attention. The theory of exchange networks serves as the framework for identifying the optimal seeding strategy and recommends seeding people that have many friends, who, in turn, have only a few friends. There is little competition for the attention of those seeds’ friends, and these friends are therefore responsive to the messages they receive. Using a game-theoretic model, we show that it is optimal to seed people with the highest Bonacich centrality. Importantly, in contrast to previous seeding literature that assumed a fixed and nonnegative connectivity parameter of the Bonacich measure, we demonstrate that this connectivity parameter is negative and needs to be estimated. Two independent empirical validations using a total of 34 social media campaigns on two different large online social networks show that the proposed seeding strategy can substantially increase a campaign’s reach. The second study uses the activity network of messages exchanged to confirm that the effects are driven by competition for attention. This paper was accepted by Anandhi Bharadwaj, information systems.


2016 ◽  
Vol 43 (3) ◽  
pp. 342-355 ◽  
Author(s):  
Liyuan Sun ◽  
Yadong Zhou ◽  
Xiaohong Guan

Understanding information propagation in online social networks is important in many practical applications and is of great interest to many researchers. The challenge with the existing propagation models lies in the requirement of complete network structure, topic-dependent model parameters and topic isolated spread assumption, etc. In this paper, we study the characteristics of multi-topic information propagation based on the data collected from Sina Weibo, one of the most popular microblogging services in China. We find that the daily total amount of user resources is finite and users’ attention transfers from one topic to another. This shows evidence on the competitions between multiple dynamical topics. According to these empirical observations, we develop a competition-based multi-topic information propagation model without social network structure. This model is built based on general mechanisms of resource competitions, i.e. attracting and distracting users’ attention, and considers the interactions of multiple topics. Simulation results show that the model can effectively produce topics with temporal popularity similar to the real data. The impact of model parameters is also analysed. It is found that topic arrival rate reflects the strength of competitions, and topic fitness is significant in modelling the small scale topic propagation.


2020 ◽  
Vol 102 ◽  
pp. 14-29 ◽  
Author(s):  
Eric Ke Wang ◽  
Chien-Ming Chen ◽  
Siu Ming Yiu ◽  
Mohammad Mehedi Hassan ◽  
Majed Alrubaian ◽  
...  

2011 ◽  
Vol 32 (3) ◽  
pp. 589-608 ◽  
Author(s):  
Jichang Zhao ◽  
Junjie Wu ◽  
Xu Feng ◽  
Hui Xiong ◽  
Ke Xu

Sign in / Sign up

Export Citation Format

Share Document