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 395 results simulation clear
The model integrates major theories of political judgment and behavior within the classical cognitive paradigm embedded in the ACT-R cognitive architecture. It models preferences and beliefs of political candidates, parties, and groups.
The DITCH model has been developed to investigate partner selection processes, focusing on individual preferences, opportunities for contact, and group size to uncover how these may lead to differential rates of inter-ethnic marriage.
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.
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.
Simulation to replicate and extend an analytical model (Konrad & Skaperdas, 2010) of the provision of security as a collective good. We simulate bandits preying upon peasants in an anarchy condition.
This is a model of the occurrence of disorganization and its impact on individual goal setting and problem-solving. This model therefore, explores the effects of disorganization on goal achievement.
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 uses ’satisficing’ as a model for farmers’ decision making to learn about influences of alternative decision-making models on simulation results and to exemplify a way to transform a rather theoretical concept into a feasible decision-making model for agent-based farming models.
This model extends the bounded confidence model of Deffuant and Weisbuch. It introduces online contexts in which a person can deliver his or her opinion to several other persons. There are 2 additional parameters accessibility and connectivity.
A multithreaded replication of the PPHPC model in Java for testing different ABM parallelization strategies.
Displaying 10 of 395 results simulation clear