Effects of dynamical grouping on cooperation in N-person evolutionary snowdrift game

The dynamics of casual groups can keep free-riders at bay

Understanding the conditions for maintaining cooperation in groups of unrelated individuals despite the presence of non-cooperative members is a major research topic in contemporary biological, sociological, and economic theory. The N-person snowdrift game models the type of social dilemma where cooperative actions are costly, but there is a reward for performing them. We study this game in a scenario where players move between play groups following the casual group dynamics, where groups grow by recruiting isolates and shrink by losing individuals who then become isolates. This describes the size distribution of spontaneous human groups and also the formation of sleeping groups in monkeys. We consider three scenarios according to the probability of isolates joining a group. We find that for appropriate choices of the cost-benefit ratio of cooperation and the aggregation-disaggregation ratio in the formation of casual groups, free-riders can be completely eliminated from the population. If individuals are more attracted to large groups, we find that cooperators persist in the population even when the mean group size diverges. We also point out the remarkable similarity between the replicator equation approach to public goods games and the trait group formulation of structured demes.

Evolutionary dynamics of N-person Hawk-Dove games

In the animal world, the competition between individuals belonging to different species for a resource often requires the cooperation of several individuals in groups. This paper proposes a generalization of the Hawk-Dove Game for an arbitrary number of agents: the N-person Hawk-Dove Game. In this model, doves exemplify the cooperative behavior without intraspecies conflict, while hawks represent the aggressive behavior. In the absence of hawks, doves share the resource equally and avoid conflict, but having hawks around lead to doves escaping without fighting. Conversely, hawks fight for the resource at the cost of getting injured. Nevertheless, if doves are present in sufficient number to expel the hawks, they can aggregate to protect the resource, and thus avoid being plundered by hawks. We derive and numerically solve an exact equation for the evolution of the system in both finite and infinite well-mixed populations, finding the conditions for stable coexistence between both species. Furthermore, by varying the different parameters, we found a scenario of bifurcations that leads the system from dominating hawks and coexistence to bi-stability, multiple interior equilibria and dominating doves.

Effects of adaptive dynamical linking in networked games

The role of dynamical topologies in the evolution of cooperation has received considerable attention, as some studies have demonstrated that dynamical networks are much better than static networks in terms of boosting cooperation. Here we study a dynamical model of evolution of cooperation on stochastic dynamical networks in which there are no permanent partners to each agent. Whenever a new link is created, its duration is randomly assigned without any bias or preference. We allow the agent to adaptively adjust the duration of each link during the evolution in accordance with the feedback from game interactions. By Monte Carlo simulations, we find that cooperation can be remarkably promoted by this adaptive dynamical linking mechanism both for the game of pairwise interactions, such as the Prisoner's Dilemma game (PDG), and for the game of group interactions, illustrated by the public goods game (PGG). And the faster the adjusting rate, the more successful the evolution of cooperation. We also show that in this context weak selection favors cooperation much more than strong selection does. What is particularly meaningful is that the prosperity of cooperation in this study indicates that the rationality and selfishness of a single agent in adjusting social ties can lead to the progress of altruism of the whole population.

N-player quantum games in an EPR setting

The -player quantum games are analyzed that use an Einstein-Podolsky-Rosen (EPR) experiment, as the underlying physical setup. In this setup, a player’s strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical choice between two directions along which spin or polarization measurements are made. The players’ strategies thus remain identical to their strategies in the mixed-strategy version of the classical game. In the EPR setting the quantum game reduces itself to the corresponding classical game when the shared quantum state reaches zero entanglement. We find the relations for the probability distribution for -qubit GHZ and W-type states, subject to general measurement directions, from which the expressions for the players’ payoffs and mixed Nash equilibrium are determined. Players’ payoff matrices are then defined using linear functions so that common two-player games can be easily extended to the -player case and permit analytic expressions for the Nash equilibrium. As a specific example, we solve the Prisoners’ Dilemma game for general . We find a new property for the game that for an even number of players the payoffs at the Nash equilibrium are equal, whereas for an odd number of players the cooperating players receive higher payoffs. By dispensing with the standard unitary transformations on state vectors in Hilbert space and using instead rotors and multivectors, based on Clifford’s geometric algebra (GA), it is shown how the N-player case becomes tractable. The new mathematical approach presented here has wide implications in the areas of quantum information and quantum complexity, as it opens up a powerful way to tractably analyze N-partite qubit interactions.