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 10 of 1205 results
Perpetual Motion Machine - A simple economy that operates at both a biophysical and economic level, and is sustainable. The goal: to determine the necessary and sufficient conditions of sustainability, and the attendant necessary trade-offs.
This MAS simulates the traffic of Barcelona Eixample. Uses a centralized AI system in order to control the traffic lights. Car agents are reactive and have no awareness of the intelligence of the system. They (try to) avoid collisions.
This is a relatively simple foraging-radius model, as described first by Robert Kelly, that allows one to quantify the effect of increased logistical mobility (as represented by increased effective foraging radius, r_e) on the likelihood that 2 randomly placed central place foragers will encounter one another within 5000 time steps.
This is a replication of the Pumpa model that simulates the Pumpa Irrigation System in Nepal (Cifdaloz et al., 2010).
This model is an extended version of the matching problem including the mate search problem, which is the generalization of a traditional optimization problem. The matching problem is extended to a form of asymmetric two-sided matching problem.
This is a replication model of the matching problem including the mate search problem, which is the generalization of a traditional optimization problem.
This model is a replication of that described by Peterson (2002) and illustrates the ‘spread’ feedback loop type described in Millington (2013).
This model illustrates a positive ‘transport’ feedback loop in which lines with different resistance to flows of material result in variation in rates of change in linked entities.
This model illustrates a positive ‘growth’ feedback loop in which the areal extent of an entity increases through time.
A reimplementation of the Wedding Ring model by Francesco Billari. We investigate partnership formation in an agent-based framework, and combine this with statistical demographic projections using real empirical data.
Displaying 10 of 1205 results