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 3 of 233 results Netlogo clear search

Best Practices for Civic Collaboration

Wei Zhong | Published Saturday, December 20, 2008 | Last modified Saturday, April 27, 2013

This is a modified version (Netlogo 4.0.3) of the model in support of Erik Johnstons dissertation, programmed in Netlogo 3.1.4 (May 15th, 2007).

Patch choice model from Optimal Foraging Theory (Human Behavioral Ecology)

C Michael Barton | Published Saturday, November 22, 2008 | Last modified Saturday, April 27, 2013

NetLogo model of patch choice model from optimal foraging theory (human behavioral ecology).

Lansing-Kremer model of the Balinese irrigation system

Marco Janssen | Published Monday, June 16, 2008 | Last modified Tuesday, December 16, 2014

This is a NetLogo replication of the hill-climbing version of the Lansing-Kremer model of Balinese irrigation.

Displaying 3 of 233 results Netlogo clear search

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