{'fraction_non_alphanumeric': 0.01453104359313078, 'fraction_numerical': 0.0, 'mean_word_length': 5.530172413793103, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Evolutionary Dynamics of Strategies without Complete Information on Complex Networks

As for the behaviors of multi‐agent system, recent years have witnessed the growing interest in the study of cooperative behaviors by the aid of evolutionary game dynamics on complex networks. Thereinto, the updating rules deciding the evolution of strategies will significantly influence the steady state distribution of the system. The strategy updating rooted in the pursuit of larger benefits, will drive the system to evolve into the coexistence of different states or the domination by some strategies. To relax the often‐used rules required explicit knowledge of the exact payoffs, this paper describes a new approach of updating strategy based on switching probabilities, which is independent on players' payoffs and degrees. And then the equilibrium state of the strategy evolution in the networks is studied. Our work here provides a computationally feasible way of estimating the steady characteristics of the strategy adoption of agents situating on complex networks. The stability analysis elucidates two important features: (i) the takeover of cooperation can be enhanced by the appropriate settings of the switching probabilities between strategies and (ii) larger average degree and power exponent in the employed scale‐free network can make it easier for the coexistence of strategies. The results can help the design of initial strategy distribution of agents located on social networks to promote cooperation.