arXiv subjects

Xiaojin Xiong

Publications and source records attributed to Xiaojin Xiong.

7 recordsLinked to original sources

arXiv2026

Social comparison shapes the evolution of cooperation in structured populations

Human cooperation unfolds in social environments where individuals influence each other through payoff-based learning and social comparison, the tendency to evaluate fitness relative to others. However, it is still unclear how social comparison and population structure jointly shape cooperation. Here, we incorporate social comparison theory into evolutionary dynamics on structured populations, letting fitness depend on individual and neighbour payoffs weighted by a comparison parameter. Under weak selection, we derive conditions favoring cooperation and find that the proposed comparison nonlinearly reshapes the critical benefit-to-cost ratio. Even one individual applying this protocol can affect the population, especially in heterogeneous networks. When comparison tendencies vary, the full distribution, not just the mean, determines evolutionary outcomes. Using a swarm-intelligence-based framework across typical and empirical networks, we identify cooperation-maximizing patterns: optimal states exhibit heterogeneous comparison tendencies, yet collectively align toward assimilative development. These results provide a basis for designing social incentives that harness comparison to promote collective cooperation in human groups.

physics.soc-ph↗

arXiv2026

Cooperation in Public Goods Games over Uniform Random Hypergraphs with Game Transitions

The evolution of cooperation is a central enigma in evolutionary game theory. Traditionally, the combination of pairwise networks and repeated Public Goods Games with a single state fails to adequately describe realistic group interaction scenarios. On the one hand, pairwise networks lack clear group definitions. On the other hand, a participant's decision affects not only competitors' fitness but also the state of the surrounding environment. To address this problem, we propose a Public Goods Game with game transition mechanisms based on Uniform Random Hypergraphs. In our model, game groups formed by hyperedges transition between two types of games, one with abundant public resources and the other with scarce public resources. The transition probability is closely related to the strategies of players within the hyperedges. By developing a Monte Carlo simulation framework that incorporates payoff accumulation, strategy imitation, and game state transitions, we aim to reveal the coevolutionary patterns of strategies and game states in group interactions. Our study highlights a nonlinear relationship between defection sensitivity and cooperation frequency under game transitions, as well as the asymmetric effects of the two sensitivities in state-dependent transitions. These observations open new directions for how to approach social dilemmas.

physics.soc-ph↗

arXiv2025

Dynamic Evolution of Cooperation Based on Adaptive Reputation Threshold and Game Transition

In real-world social systems, individual interactions are frequently shaped by reputation, which not only influences partner selection but also affects the nature and benefits of the interactions themselves. We propose a heterogeneous game transition model that incorporates a reputation-based dynamic threshold mechanism to investigate how reputation regulates game evolution. In our framework, individuals determine the type of game they engage in according to their own and their neighbors' reputation levels. In turn, the outcomes of these interactions modify their reputations, thereby driving the adaptation and evolution of future strategies in a feedback-informed manner. Through simulations on two representative topological structures, square lattice and small-world networks, we find that network topology exerts a profound influence on the evolutionary dynamics. Due to its localized connection characteristics, the square lattice network fosters the long-term coexistence of competing strategies. In contrast, the small-world network is more susceptible to changes in system parameters due to the efficiency of information dissemination and the sensitivity of strategy evolution. Additionally, the reputation mechanism is significant in promoting the formation of a dominant state of cooperation, especially in contexts of high sensitivity to reputation. Although the initial distribution of reputation influences the early stage of the evolutionary path, it has little effect on the final steady state of the system. Hence, we can conclude that the ultimate steady state of evolution is primarily determined by the reputation mechanism and the network structure.

cs.SI↗

arXiv2025

Spatial public goods games with queueing and reputation

In real-world social and economic systems, the provisioning of public goods generally entails continuous interactions among individuals, with decisions to cooperate or defect being influenced by dynamic factors such as timing, resource availability, and the duration of engagement. However, the traditional public goods game ignores the asynchrony of the strategy adopted by players in the game. To address this problem, we propose a spatial public goods game that integrates an M/M/1 queueing system to simulate the dynamic flow of player interactions. We use a birth-death process to characterize the stochastic dynamics of this queueing system, with players arriving following a Poisson process and service times being exponentially distributed under a first-come-first-served basis with finite queue capacity. We also incorporate reputation so that players who have cooperated in the past are more likely to be chosen for future interactions. Our research shows that a high arrival rate, low service rate, and the reputation mechanism jointly facilitate the emergence of cooperative individuals in the network, which thus provides an interesting and new perspective for the provisioning of public goods.

cs.SI↗

arXiv2024

Coevolution of relationship-driven cooperation under recommendation protocol on multiplex networks

While traditional game models often simplify interactions among agents as static, real-world social relationships are inherently dynamic, influenced by both immediate payoffs and alternative information. Motivated by this fact, we introduce a coevolutionary multiplex network model that incorporates the concepts of a relationship threshold and a recommendation mechanism to explore how the strength of relationships among agents interacts with their strategy choices within the framework of weak prisoner's dilemma games. In the relationship layer, the relationship strength between agents varies based on interaction outcomes. In return, the strategy choice of agents in the game layer is influenced by both payoffs and relationship indices, and agents can interact with distant agents through a recommendation mechanism. Simulation of various network topologies reveals that a higher average degree supports cooperation, although increased randomness in interactions may inhibit its formation. Interestingly, a higher threshold value of interaction quality is detrimental, while the applied recommendation protocol can improve global cooperation. The best results are obtained when the relative weight of payoff is minimal and the individual fitness is dominated by the relationship indices gained from the quality of links to neighbors. As a consequence, the changes in the distribution of relationship indices are closely correlated with overall levels of cooperation.

cs.SI↗

arXiv2024

Adaptive Payoff-driven Interaction in Networked Snowdrift Games

In social dilemmas, most interactions are transient and susceptible to restructuring, leading to continuous changes in social networks over time. Typically, agents assess the rewards of their current interactions and adjust their connections to optimize outcomes. In this paper, we introduce an adaptive network model in the snowdrift game to examine dynamic levels of cooperation and network topology, involving the potential for both the termination of existing connections and the establishment of new ones. In particular, we define the agent's asymmetric disassociation tendency toward their neighbors, which fundamentally determines the probability of edge dismantlement. The mechanism allows agents to selectively sever and rewire their connections to alternative individuals to refine partnerships. Our findings reveal that adaptive networks are particularly effective in promoting a robust evolution toward states of either pure cooperation or complete defection, especially under conditions of extreme cost-benefit ratios, as compared to static network models. Moreover, the dynamic restructuring of connections and the distribution of network degrees among agents are closely linked to the levels of cooperation in stationary states. Specifically, cooperators tend to seek broader neighborhoods when confronted with the invasion of multiple defectors.

physics.soc-ph↗

arXiv2024

Coevolution of relationship and interaction in cooperative dynamical multiplex networks

While actors in a population can interact with anyone else freely, social relations significantly influence our inclination towards particular individuals. The consequence of such interactions, however, may also form the intensity of our relations established earlier. These dynamical processes are captured via a coevolutionary model staged in multiplex networks with two distinct layers. In a so-called relationship layer the weights of edges among players may change in time as a consequence of games played in the alternative interaction layer. As an reasonable assumption, bilateral cooperation confirms while mutual defection weakens these weight factors. Importantly, the fitness of a player, which basically determines the success of a strategy imitation, depends not only on the payoff collected from interactions, but also on the individual relationship index calculated from the mentioned weight factors of related edges. Within the framework of weak prisoner's dilemma situation we explore the potential outcomes of the mentioned coevolutionary process where we assume different topologies for relationship layer. We find that higher average degree of the relationship graph is more beneficial to maintain cooperation in regular graphs, but the randomness of links could be a decisive factor in harsh situations. Surprisingly, a stronger coupling between relationship index and fitness discourage the evolution of cooperation by weakening the direct consequence of a strategy change. To complete our study we also monitor how the distribution of relationship index vary and detect a strong relation between its polarization and the general cooperation level.

physics.soc-ph↗