CoMSES Net maintains cyberinfrastructure to foster FAIR data principles for access to and (re)use of computational models. Model authors can publish their model code in the Computational Model Library with documentation, metadata, and data dependencies and support these FAIR data principles as well as best practices for software citation. Model authors can also request that their model code be peer reviewed to receive a DOI. All users of models published in the library must cite model authors when they use and benefit from their code.
CoMSES Net also maintains a curated database of over 7500 publications of agent-based and individual based models with additional metadata on availability of code and bibliometric information on the landscape of ABM/IBM publications that we welcome you to explore.
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!
Existing studies on prejudice, which is important in multi-group dynamics in societies, focus on the social-psychological knowledge behind the processes involving prejudice and its propagation. We instead create a multi-agent framework that simulates the propagation of prejudice and measures its tangible impact on the prosperity of individuals as well as of larger social structures, including groups and factions within. Groups in society help us define prejudice, and factions represent smaller tight-knit circles of individuals with similar opinions. We model social interactions using the Continuous Prisoner’s Dilemma (CPD) and a type of agent called a prejudiced agent, whose cooperation is affected by a prejudice attribute, updated over time based both on the agent’s own experiences and those of others in its faction. This model generates various results that both provide new insights into intergroup prejudice and its effects, as well as highlight and reinforce certain existing notions of prejudice.
Previous work with the spatial iterated prisoner’s dilemma has shown that “walk away” cooperators are able to outcompete defectors as well as cooperators that do not respond to defection, but it remains to be seen just how robust the so-called walk away strategy is to ecologically important variables such as population density, error, and offspring dispersal. Our simulation experiments identify socio-ecological conditions in which natural selection favors strategies that emphasize forgiveness over flight in the spatial iterated prisoner’s dilemma. Our interesting results are best explained by considering how population density, error, and offspring dispersal affect the opportunity cost associated with walking away from an error-prone partner.
Interactions of players embedded in a closed square lattice are determined by distance and overall gains and they lead to shifts of reward payoff between temptation and punishment. A new winner balancing against threats is ultimately discovered.
Agents co-operate or defect towards other agents in a prisoner’s dilemma, with strategy choice depending on whether agents share tags or are kin in different social structures.
This is an implementation of an agent based model for the evolution of ethnocentrism. While based off a model published by Hammond and Axelrod (2006), the code has been modified to allow for a more fine-grained analysis of evolutionary dynamics.
A spatial prisoner’s dilemma model with mobile agents, de-coupled birth-death events, and harsh environments.
This model studies the effect of the agents’ adaptive expectation on cooperation frequency in the prisoner’s dilemma game in complex networks from an agent based approach. The model is implemented in Repast simphony 1.2.
The provided source code is the result of our efforts in replicating Epstein’s Demographic Prisoner’s Dilemma. The simulation model is written in Repast/J 3.1.