Explore the vast range of titles available.

More than two centuries ago Henri de Saint-Simon envisaged physical laws to describe human societies. Driven by advances in statistical physics, network science, data analysis, and information technology, this vision is becoming a reality. Many of the grandest challenges of our time are of a societal nature, and methods of physics are increasingly playing a central role in improving our understanding of these challenges, and helping us to find innovative solutions. The Social physics Collection at Scientific Reports is dedicated to this research.

Economic experiments have shown that punishment can increase public goods game contributions over time. However, the effectiveness of punishment is challenged by second-order free-riding and antisocial punishment. The latter implies that noncooperators punish cooperators, while the former implies unwillingness to shoulder the cost of punishment. Here, we extend the theory of cooperation in the spatial public goods game by considering four competing strategies, which are traditional cooperators and defectors, as well as cooperators who punish defectors and defectors who punish cooperators. We show that if the synergistic effects are high enough to sustain cooperation based on network reciprocity alone, antisocial punishment does not deter public cooperation. Conversely, if synergistic effects are low and punishment is actively needed to sustain cooperation, antisocial punishment does is viable, but only if the cost-to-fine ratio is low. If the costs are relatively high, cooperation again dominates as a result of spatial pattern formation. Counterintuitively, defectors who do not punish cooperators, and are thus effectively second-order free-riding on antisocial punishment, form an active layer around punishing cooperators, which protects them against defectors that punish cooperators. A stable three-strategy phase that is sustained by the spontaneous emergence of cyclic dominance is also possible via the same route. The microscopic mechanism behind the reported evolutionary outcomes can be explained by the comparison of invasion rates that determine the stability of subsystem solutions. Our results reveal an unlikely evolutionary escape from adverse effects of antisocial punishment, and they provide a rationale for why second-order free-riding is not always an impediment to the evolutionary stability of punishment.

Multiplayer games on graphs are at the heart of theoretical descriptions of key evolutionary processes that govern vital social and natural systems. However, a comprehensive theoretical framework for solving multiplayer games with an arbitrary number of strategies on graphs is still missing. Here, we solve this by drawing an analogy with the Balls-and-Boxes problem, based on which we show that the local configuration of multiplayer games on graphs is equivalent to distributing k identical co-players among n distinct strategies. We use this to derive the replicator equation for any n -strategy multiplayer game under weak selection, which can be solved in polynomial time. As an example, we revisit the second-order free-riding problem, where costly punishment cannot truly resolve social dilemmas in a well-mixed population. Yet, in structured populations, we derive an accurate threshold for the punishment strength, beyond which punishment can either lead to the extinction of defection or transform the system into a rock-paper-scissors-like cycle. The analytical solution also qualitatively agrees with the phase diagrams that were previously obtained for non-marginal selection strengths. Our framework thus allows an exploration of any multi-strategy multiplayer game on regular graphs. Evolutionary multiplayer games in structured populations illustrate a variety of phenomena in natural and social systems. This research provides a mathematical framework to analyze multiplayer games with an arbitrary number of strategies on regular graphs.

Recent years have seen multilayer networks taking the helm at network science research. Diffusion dynamics and information spreading in multilayer networks are thereby two of the most explored topics, with numerous applications in social, technological, and biological systems. Almost a decade ago, groundbreaking research has shown that even small and seemingly unimportant changes in one network layer can have catastrophic consequences in many other network layers. Such failure cascades across different network layers can, for example, shut down power grids, arrest traffic, idle virality, or impair cooperation. Different spreading processes are often the common denominator of such phenomena, and in the light of their importance, we here present a brief overview of this subject.

According to the fundamental principle of evolutionary game theory, the more successful strategy in a population should spread. Hence, during a strategy imitation process a player compares its payoff value to the payoff value held by a competing strategy. But this information is not always accurate. To avoid ambiguity a learner may therefore decide to collect a more reliable statistics by averaging the payoff values of its opponents in the neighborhood, and makes a decision afterwards. This simple alteration of the standard microscopic protocol significantly improves the cooperation level in a population. Furthermore, the positive impact can be strengthened by increasing the role of the environment and the size of the evaluation circle. The mechanism that explains this improvement is based on a self-organizing process which reveals the detrimental consequence of defector aggregation that remains partly hidden during face-to-face comparisons. Notably, the reported phenomenon is not limited to lattice populations but remains valid also for systems described by irregular interaction networks.

Although empirical and theoretical studies affirm that punishment can elevate collaborative efforts, its emergence and stability remain elusive. By peer-punishment the sanctioning is something an individual elects to do depending on the strategies in its neighborhood. The consequences of unsustainable efforts are therefore local. By pool-punishment, on the other hand, where resources for sanctioning are committed in advance and at large, the notion of sustainability has greater significance. In a population with free-riders, punishers must be strong in numbers to keep the “punishment pool” from emptying. Failure to do so renders the concept of institutionalized sanctioning futile. We show that pool-punishment in structured populations is sustainable, but only if second-order free-riders are sanctioned as well and to a such degree that they cannot prevail. A discontinuous phase transition leads to an outbreak of sustainability when punishers subvert second-order free-riders in the competition against defectors.

Simplicial complexes describe the simple fact that in social networks a link can connect more than two individuals. As we show here, this has far-reaching consequences for epidemic spreading, in particular in the context of a multilayer network model, where one layer is a virtual social network and the other one is a physical contact network. The social network layer is responsible for the transmission of information via pairwise or higher order 2-simplex interactions among individuals, while the physical layer is responsible for the epidemic spreading. We use the microscopic Markov chain approach to derive the probability transition equations and to determine epidemic outbreak thresholds. We further support these results with Monte Carlo simulations, which are in good agreement, thus confirming the analytical tractability of the proposed model. We find that information transmission rates are frequently low when actual disease transmission rates in the physical network are low or medium, and we show that this can be mitigated effectively by introducing 2-simplex interactions in the social network. The relative ease of introducing higher-order interactions in virtual social networks means that this could be exploited to inhibit epidemic outbreaks.

To be the fittest is central to proliferation in evolutionary games. Individuals thus adopt the strategies of better performing players in the hope of successful reproduction. In structured populations the array of those that are eligible to act as strategy sources is bounded to the immediate neighbors of each individual. But which one of these strategy sources should potentially be copied? Previous research dealt with this question either by selecting the fittest or by selecting one player uniformly at random. Here we introduce a parameter u that interpolates between these two extreme options. Setting u equal to zero returns the random selection of the opponent, while positive u favor the fitter players. In addition, we divide the population into two groups. Players from group A select their opponents as dictated by the parameter u, while players from group B do so randomly irrespective of u. We denote the fraction of players contained in groups A and B by v and 1 - v, respectively. The two parameters u and v allow us to analyze in detail how aspirations in the context of the prisoner’s dilemma game influence the evolution of cooperation. We find that for sufficiently positive values of u there exist a robust intermediate v ≈ 0.5 for which cooperation thrives best. The robustness of this observation is tested against different levels of uncertainty in the strategy adoption process K and for different interaction networks. We also provide complete phase diagrams depicting the dependence of the impact of u and v for different values of K, and contrast the validity of our conclusions by means of an alternative model where individual aspiration levels are subject to evolution as well. Our study indicates that heterogeneity in aspirations may be key for the sustainability of cooperation in structured populations.

Spatial coexistence of coherent and incoherent dynamics in network of coupled oscillators is called a chimera state. We study such chimera states in a network of neurons without any direct interactions but connected through another medium of neurons, forming a multilayer structure. The upper layer is thus made up of uncoupled neurons and the lower layer plays the role of a medium through which the neurons in the upper layer share information among each other. Hindmarsh-Rose neurons with square wave bursting dynamics are considered as nodes in both layers. In addition, we also discuss the existence of chimera states in presence of inter layer heterogeneity. The neurons in the bottom layer are globally connected through electrical synapses, while across the two layers chemical synapses are formed. According to our research, the competing effects of these two types of synapses can lead to chimera states in the upper layer of uncoupled neurons. Remarkably, we find a density-dependent threshold for the emergence of chimera states in uncoupled neurons, similar to the quorum sensing transition to a synchronized state. Finally, we examine the impact of both homogeneous and heterogeneous inter-layer information transmission delays on the observed chimera states over a wide parameter space.

Networks form the backbone of many complex systems, ranging from the Internet to human societies. Accordingly, not only is the range of our interactions limited and thus best described and modeled by networks, it is also a fact that the networks that are an integral part of such models are often interdependent or even interconnected. Networks of networks or multilayer networks are therefore a more apt description of social systems. This colloquium is devoted to evolutionary games on multilayer networks, and in particular to the evolution of cooperation as one of the main pillars of modern human societies. We first give an overview of the most significant conceptual differences between single-layer and multilayer networks, and we provide basic definitions and a classification of the most commonly used terms. Subsequently, we review fascinating and counterintuitive evolutionary outcomes that emerge due to different types of interdependencies between otherwise independent populations. The focus is on coupling through the utilities of players, through the flow of information, as well as through the popularity of different strategies on different network layers. The colloquium highlights the importance of pattern formation and collective behavior for the promotion of cooperation under adverse conditions, as well as the synergies between network science and evolutionary game theory.