Our mission is to help computational modelers at all levels engage in the establishment and adoption of community standards and good practices for developing and sharing computational models. Model authors can freely publish their model source code in the Computational Model Library alongside narrative documentation, open science metadata, and other emerging open science norms that facilitate software citation, reproducibility, interoperability, and reuse. Model authors can also request peer review of their computational models to receive a DOI.
All users of models published in the library must cite model authors when they use and benefit from their code.
Please check out our model publishing tutorial and contact us if you have any questions or concerns about publishing your model(s) in the Computational Model Library.
We also maintain a curated database of over 7500 publications of agent-based and individual based models with additional detailed metadata on availability of code and bibliometric information on the landscape of ABM/IBM publications that we welcome you to explore.
Displaying 9 of 19 results game theory clear
We present a network agent-based model of ethnocentrism and intergroup cooperation in which agents from two groups (majority and minority) change their communality (feeling of group solidarity), cooperation strategy and social ties, depending on a barrier of “likeness” (affinity). Our purpose was to study the model’s capability for describing how the mechanisms of preexisting markers (or “tags”) that can work as cues for inducing in-group bias, imitation, and reaction to non-cooperating agents, lead to ethnocentrism or intergroup cooperation and influence the formation of the network of mixed ties between agents of different groups. We explored the model’s behavior via four experiments in which we studied the combined effects of “likeness,” relative size of the minority group, degree of connectivity of the social network, game difficulty (strength) and relative frequencies of strategy revision and structural adaptation. The parameters that have a stronger influence on the emerging dominant strategies and the formation of mixed ties in the social network are the group-tag barrier, the frequency with which agents react to adverse partners, and the game difficulty. The relative size of the minority group also plays a role in increasing the percentage of mixed ties in the social network. This is consistent with the intergroup ties being dependent on the “arena” of contact (with progressively stronger barriers from e.g. workmates to close relatives), and with measures that hinder intergroup contact also hindering mutual cooperation.
Signaling chains are a special case of Lewis’ signaling games on networks. In a signaling chain, a sender tries to send a single unit of information to a receiver through a chain of players that do not share a common signaling system.
This is an agent-based model of the implementation of the self-enforcing agreement in cooperative teams.
MASTOC is a replication of the Tragedy of the Commons by G. Hardin, programmed in NetLogo 4.0.4, based on behavioral game theory and Nash solution.
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.
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.
The simulation generates two kinds of agents, whose proposals are generated accordingly to their selfish or selfless behaviour. Then, agents compete in order to increase their portfolio playing the ultimatum game with a random-stranger matching.
A friendship game is a kind of network game: a game theory model on a network. This is a NetLogo model of an agent-based adaptation of “‘Friendship-based’ Games” by PJ Lamberson. The agents reach an equilibrium that depends on the strategy played and the topology of the network.
Displaying 9 of 19 results game theory clear