Our mission is to help computational modelers develop, document, and share their computational models in accordance with community standards and good open science and software engineering practices. Model authors can publish their model source code in the Computational Model Library with narrative documentation as well as metadata that supports open science and emerging norms that facilitate software citation, computational reproducibility / frictionless reuse, and interoperability. Model authors can also request private peer review of their computational models. Models that pass peer review receive a DOI once published.
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 feel free to contact us if you have any questions or concerns about publishing your model(s) in the Computational Model Library.
Displaying 10 of 477 results simulation clear search
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.
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 Axelrod’s model of cultural dissemination is an agent-model designed to investigate the dissemination of culture among interacting agents on a society.
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 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.
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.
DIAL is a model of group dynamics and opinion dynamics. It features dialogues, in which agents put their reputation at stake. Intra-group radicalisation of opinions appears to be an emergent phenomenon.
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.
Displaying 10 of 477 results simulation clear search