About the CoMSES Model Library more info
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 3 of 3 results symmetric clear search
Symmetric two-sided matching
Naoki Shiba | Published Wednesday, January 09, 2013 | Last modified Wednesday, May 29, 2013This is a replication model of the matching problem including the mate search problem, which is the generalization of a traditional optimization problem.
Peer reviewed AZOI: Another Zone Of Influence model
Cyril Piou | Published Wednesday, July 23, 2014 | Last modified Thursday, December 11, 2014This model reimplement Weiner et al. 2001 Zone Of Influence model to simulate plant growth under competition. The reimplementation in Netlogo and the ODD description in the “info” tab try to be as consistent as possible with the original paper.
Asymmetric two-sided matching
Naoki Shiba | Published Wednesday, January 09, 2013 | Last modified Tuesday, May 28, 2013This 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.