Cooperation is essential for all domains of life. Yet, ironically, it is intrinsically vulnerable to exploitation by cheats. Hence, an explanatory necessity spurs many evolutionary biologists to search for mechanisms that could support cooperation. In general, cooperation can emerge and be maintained when cooperators are sufficiently interacting with themselves. This communication provides a kind of assortment and reciprocity. The most crucial and common mechanisms to achieve that task are kin selection, spatial structure, and enforcement (punishment). Here, we used agent-based simulation models to investigate these pivotal mechanisms against conditional defector strategies. We concluded that the latter could easily violate the former and take over the population. This surprising outcome may urge us to rethink the evolution of cooperation, as it illustrates that maintaining cooperation may be more difficult than previously thought. Moreover, empirical applications may support these theoretical findings, such as invading the cooperator population of pathogens by genetically engineered conditional defectors, which could be a potential therapy for many incurable diseases.

The purpose of the model is to collect information on human decision-making in the context of coalition formation games. The model uses a human-in-the-loop approach, and a single human is involved in each trial. All other agents are controlled by the ABMSCORE algorithm (Vernon-Bido and Collins 2020), which is an extension of the algorithm created by Collins and Frydenlund (2018). The glove game, a standard cooperative game, is used as the model scenario.

The intent of the game is to collection information on the human players behavior and how that compares to the computerized agents behavior. The final coalition structure of the game is compared to an ideal output (the core of the games).

This code is for an agent-based model of collective problem solving in which agents with different behavior strategies, explore the NK landscape while they communicate with their peers agents. This model is based on the famous work of Lazer, D., & Friedman, A. (2007), The network structure of exploration and exploitation.

Both models simulate n-person prisoner dilemma in groups (left figure) where agents decide to C/D – using a stochastic threshold algorithm with reinforcement learning components. We model fixed (single group ABM) and dynamic groups (bad-barrels ABM). The purpose of the bad-barrels model is to assess the impact of information during meritocratic matching. In the bad-barrels model, we incorporated a multidimensional structure in which agents are also embedded in a social network (2-person PD). We modeled a random and homophilous network via a random spatial graph algorithm (right figure).

At the heart of a study of Social-Ecological Systems, this model is built by coupling together two independently developed models of social and ecological phenomena. The social component of the model is an abstract model of interactions of a governing agent and several user agents, where the governing agent aims to promote a particular behavior among the user agents. The ecological model is a spatial model of spread of the Mountain Pine Beetle in the forests of British Columbia, Canada. The coupled model allowed us to simulate various hypothetical management scenarios in a context of forest insect infestations. The social and ecological components of this model are developed in two different environments. In order to establish the connection between those components, this model is equipped with a ‘FlipFlop’ - a structure of storage directories and communication protocols which allows each of the models to process its inputs, send an output message to the other, and/or wait for an input message from the other, when necessary. To see the publications associated with the social and ecological components of this coupled model please see the References section.

This model replicates the Axelrod prisoner’s dilemma tournaments. The model takes as input a file of strategies and pits them against each other to see who achieves the best payoff in the end. Change the payoff structure to see how it changes the tournament outcome!

The intention of this model is to create an universal basis on how to model change in value prioritizations within social simulation. This model illustrates the designing of heterogeneous populations within agent-based social simulations by equipping agents with Dynamic Value-based Cognitive Architectures (DVCA-model). The DVCA-model uses the psychological theories on values by Schwartz (2012) and character traits by McCrae and Costa (2008) to create an unique trait- and value prioritization system for each individual. Furthermore, the DVCA-model simulates the impact of both social persuasion and life-events (e.g. information, experience) on the value systems of individuals by introducing the innovative concept of perception thermometers. Perception thermometers, controlled by the character traits, operate as buffers between the internal value prioritizations of agents and their external interactions. By introducing the concept of perception thermometers, the DVCA-model allows to study the dynamics of individual value prioritizations under a variety of internal and external perturbations over extensive time periods. Possible applications are the use of the DVCA-model within artificial sociality, opinion dynamics, social learning modelling, behavior selection algorithms and social-economic modelling.

In our model, individual agents are distributed over a two-dimensional square lattice. The agents play the prisoner’s dilemma game with their neighbors, imitate the highest strategy, and then migrate to empty sites based on their tag preference.

This is an empirical model described in http://dx.doi.org/10.1016/j.landurbplan.2010.05.001. The objective of the model is to simulate how the decision-making of farmers/agents with different strategies can affect the landscape structure in a region in the Netherlands.

This model implements two types of network diffusion from an initial group of activated nodes. In complex contagion, a node is activated if the proportion of neighbour nodes that are already activated exceeds a given threshold. This is intended to represented the spread of health behaviours. In simple contagion, an activated node has a given probability of activating its inactive neighbours and re-tests each time step until all of the neighbours are activated. This is intended to represent information spread.

A range of networks are included with the model from secondary school friendship networks. The proportion of nodes initially activated and the method of selecting those nodes are controlled by the user.