Inferring the reputation enhances the cooperation in the public goods game on interdependent lattices

Wang, Chengjiang; Wang, Li; Wang, Juan; Sun, Shiwen; Xia, Chengyi

doi:10.1016/j.amc.2016.06.026

Cited by 84 publications

(33 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This work builds on the premise that all nodes are homogeneous. It is valuable to study the rumor-containing problem based on the more realistic node heterogeneity assumption [64][65][66]. The rumor suppression under rumor spreading models with diffusion terms is an interesting topic [67,68].…”

Section: Discussionmentioning

confidence: 99%

An effective rumor-containing strategy

Pan

Yang

et al. 2018

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

False rumors can lead to huge economic losses or/and social instability. Hence, mitigating the impact of bogus rumors is of primary importance. This paper focuses on the problem of how to suppress a false rumor by use of the truth. Based on a set of rational hypotheses and a novel rumor-truth mixed spreading model, the effectiveness and cost of a rumor-containing strategy are quantified, respectively. On this basis, the original problem is modeled as a constrained optimization problem (the RC model), in which the independent variable and the objective function represent a rumor-containing strategy and the effectiveness of a rumor-containing strategy, respectively. The goal of the optimization problem is to find the most effective rumor-containing strategy subject to a limited rumor-containing budget. Some optimal rumor-containing strategies are given by solving their respective RC models. The influence of different factors on the highest cost effectiveness of a RC model is illuminated through computer experiments. The results obtained are instructive to develop effective rumor-containing strategies. equation. Due to the exact modeling and the perfect accommodation of the network topology, this model characterizes the SIS epidemics more accurately as compared with all previous SIS models. Moreover, this model is analytically tractable, resulting in profound conclusions. In recent years, this individual-based modeling approach has been widely applied to areas such as epidemic spreading [42][43][44], malware propagation [45][46][47][48][49][50][51][52], cyber security [53][54][55][56][57], and message transmission [58]. To our knowledge, to date the rumor-containing problem has not yet been studied under individual-level rumor spreading models.Clarifying rumors by releasing truths is a common way to inhibit rumors [59,60]. In this context, every individual may choose to believe the rumor or believe the truth or be uncertain. This paper focuses on the problem of how to inhibit a false rumor by use of the truth. Based on a novel individual-level rumor-truth mixed spreading model, the effectiveness and cost of a rumor-containing strategy are quantified. Thereby, the original problem is modeled as a constrained optimization problem (the rumor-containing (RC) model), in which the independent variable and the objective function represent a rumor-containing strategy and the effectiveness of a rumor-containing strategy, respectively. The goal of the optimization problem is to find the most effective rumor-containing strategy subject to a limited rumor-containing budget. Some optimal rumor-containing strategies are given by solving their respective RC models. The influence of different factors on the highest cost effectiveness of a RC model is uncovered through computer simulations. These results are condusive to the design of practical rumor-containing strategies. To our knowledge, this is the first time the rumor-containing problem is treated in this way.The subsequent materials of this work are organized in this fashion: ...

show abstract

Section: Discussionmentioning

confidence: 99%

An effective rumor-containing strategy

Pan

Yang

et al. 2018

Physica A: Statistical Mechanics and its Applications

View full text Add to dashboard Cite

show abstract

“…26. That is to say, minorities in the multiplex networks need more initial support to form the clusters at the steady state than minorities in single networks [51]. This might be understood by the fact that on a single network, one belief (the majority or minority) always tends to form clusters to keep the belief step by step.…”

Section: Multi-scale Abp Model On Multiplex Network With Different Dmentioning

confidence: 99%

Multi-scale asynchronous belief percolation model on multiplex networks

Wang

2019

New J. Phys.

View full text Add to dashboard Cite

The studies of multiplex networks are increasingly popular in recent years. Modeling multiple complex systems as a multiplex network has refreshed our understanding about the structure and dynamics of various real-world systems. As an important variant of the voter models, belief formation dynamics such as the asynchronous belief percolation (ABP) model has attracted much attention from statistical physics and network science communities. Existing studies of the ABP model mainly focus on the applications to single networks, whereas how the structure of multiplex networks affects its dynamical behavior is still not well understood. To close this gap, we propose a multi-scale ABP model that takes into account the differential velocities of belief propagation at different subnetworks within the multiplex network. Using extensive computer simulations, we find that (i) increasing the degree correlation between subnetworks can promote nodes with minority belief to form stable clusters and (ii) minority nodes require less initial supports to survive in multiplex networks with respect to single networks. Our conclusion is robust against the detailed topology of the subnetworks that constitute the multiplex network.

show abstract

“…Similarly, it represents a social dilemma. To investigate this issue, several novel approaches, besides studies addressing known rules [8], have been proposed to explain the appearance and survival of cooperation above so-called social dilemma, such as diversity [9][10][11][12], social influence [13][14][15], reputation [16][17][18][19], conformity [20],co-evolution [21][22][23][24], punishment [25,26], reward [27,28], rubust [29], spatial structure [30], to name but a few. Accordingly, spatial structure, referred to as network reciprocity, is known to have an impact on the evolution of cooperation [31][32][33][34].…”

Section: Introductionmentioning

confidence: 99%

Evolution of cooperation with individual diversity on interdependent weighted networks

2020

View full text Add to dashboard Cite

The social networks as a complex set of networks fully reflect internal relations of individual interactions between them. Individual as an integral part of networks can show different functions under different levels. In the vast majority of current research realm of spatial evolutionary game, individuals who are often treated as identical peers interact with the local neighbours on a single, isolated same network, even the independent networks extended the content of spatial reciprocity. However, the individual diversity, including gender, wealth and social status and so on, usually is presented within the population. Individual heterogeneity impacts on the evolution of cooperation amongst selfish individuals. With this motivation, here we consider that two forms including Prisoner's Dilemma (PD) and Snowdrift Game (SG) take place on interdependent weighted networks via the mixed-coupling in which individuals participate in different networks of interactions, cooperative behaviour can be maintained. Remarkably, the numerical analysis shows that, as the network interdependence considering individual diversity increases, cooperation thrives on one network joining in PD, the other engaging in SG may be plagued by defectors. Meanwhile, there exists an optimal region of mixed-coupling between networks to persist in cooperation of one network. Furthermore, individual diversity may be a link between non-trivial systems across the network connection, thus probing in how to schedule heterogeneous competitive tasks and services in complex manufacturing systems.

show abstract

Inferring the reputation enhances the cooperation in the public goods game on interdependent lattices

Cited by 84 publications

References 46 publications

An effective rumor-containing strategy

An effective rumor-containing strategy

Multi-scale asynchronous belief percolation model on multiplex networks

Evolution of cooperation with individual diversity on interdependent weighted networks

Contact Info

Product

Resources

About