Computational Model Library

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 1278 results

Vulnerability of Cooperation Due to Limited Vision

Marco Janssen | Published Thursday, December 02, 2010 | Last modified Saturday, April 27, 2013

This model describes the consequences of limited vision of agents in harvesting a common resource. We show the vulnerability of cooperation due to reduced visibility of the resource and other agents.

Replication of a Social-Links-Evolution-Model

Sascha Holzhauer | Published Wednesday, December 01, 2010 | Last modified Saturday, April 27, 2013

ReSolEvo File output version

MASTOC - A Multi-Agent System of the Tragedy Of The Commons

Julia Schindler | Published Tuesday, November 30, 2010 | Last modified Saturday, April 27, 2013

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.

Stationarity Test

Jakob Grazzini | Published Monday, November 29, 2010 | Last modified Saturday, April 27, 2013

This is a stationarity test, it tests whether a given moment is constant during the time series (null hypothesis). The Wald Wolfowitz nonparametric fitness test is applied to time series.

ergodicity_test

Jakob Grazzini | Published Monday, November 29, 2010 | Last modified Saturday, April 27, 2013

This Python module contain a function that is able to test the ergodicity of a given agent based model. It is sufficient to produce one long time series and many smaller time series. The function uses

cultural group and persistent parochialism

Jae-Woo Kim | Published Monday, November 08, 2010 | Last modified Saturday, April 27, 2013

Discriminators who have limited tolerance for helping dissimilar others are necessary for the evolution of costly cooperation in a one-shot Prisoner’s Dilemma. Existing research reports that trust in

Pest dispersion (simplified representation)

François Rebaudo | Published Wednesday, October 27, 2010 | Last modified Saturday, April 27, 2013

Simplified representation of the model used to present the global model to farmers

Evolution of cooperation via indirect reciprocity by image scoring

Marco Janssen | Published Friday, October 22, 2010 | Last modified Saturday, April 27, 2013

The model explores the possibility of the evolution of cooperation due to indirect reciprocity when agents derive information about the past behavior of the opponent in one-shot dilemma games.

cournot simulation

Timothy Kochanski | Published Friday, October 22, 2010 | Last modified Saturday, April 27, 2013

Cournot simulation with innovation

Evolution of cooperation with strangers

Marco Janssen | Published Friday, October 15, 2010 | Last modified Wednesday, November 13, 2013

The model is used to study the conditions under which agents will cooperate in one-shot two-player Prisoner’s Dilemma games if they are able to withdraw from playing the game and can learn to recogniz

Displaying 10 of 1278 results

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept