CoMSES Net maintains cyberinfrastructure to foster FAIR data principles for access to and (re)use of computational models. Model authors can publish their model code in the Computational Model Library with documentation, metadata, and data dependencies and support these FAIR data principles as well as best practices for software citation. Model authors can also request that their model code be peer reviewed to receive a DOI. All users of models published in the library must cite model authors when they use and benefit from their code.
CoMSES Net also maintains a curated database of over 7500 publications of agent-based and individual based models with additional metadata on availability of code and bibliometric information on the landscape of ABM/IBM publications that we welcome you to explore.
This is a variation of the Sugarspace model of Axtell and Epstein (1996) with spice and trade of sugar and spice. The model is not an exact replication since we have a somewhat simpler landscape of sugar and spice resources included, as well as a simple reproduction rule where agents with a certain accumulated wealth derive an offspring (if a nearby empty patch is available).
The model is discussed in Introduction to Agent-Based Modeling by Marco Janssen. For more information see https://intro2abm.com/
This is a replication of Abelson’s and Bernstein’s early computer simulation model of community referendum controversies which was originally published in 1963 and often cited, but seldom analysed in detail. The replication is in NetLogo, accompanied with an ODD+D protocol and class and sequence diagrams.
The study goes back to a model created in the 1990s which successfully tried to replicate the changes of the percentages of female teachers among the teaching staff in high schools (“Gymnasien”) in the German federal state of Rheinland-Pfalz. The current version allows for additional validation and calibration of the model and is accompanied with the empirical data against which the model is tested and with an analysis program especially designed to perform the analyses in the most recent journal article.
This Netlogo replication of Kollman, K., J.H. Miller and S.E. Page (1997) Political Institutions and Sorting in a Tiebout Model, American Economic Review 87(5): 977-992. The model consists of of citizens who can vote for partie and move to other jurisdictions if they expect their preferences are better served. Parties adjust their positions to increase their share in the elections.
This model is a replication model which is constructed based on the existing model used by the following article:
Brown, D.G. and Robinson, D.T., 2006. Effects of heterogeneity in residential preferences on an agent-based model of urban sprawl. Ecology and society, 11(1).
The original model is called SLUCE’s Original Model for Experimentation (SOME). In Brown and Robinson (2006)’s article, the SOME model was used to explore the impacts of heterogeneity in residential location selections on the research of urban sprawl. The original model was constructed using Objective-C language based on SWARM platform. This replication model is built by NetLogo language on NetLogo platform. We successfully replicate that model and demonstrated the reliability and replicability of it.
This is the R code of the mathematical model that includes the decision making formulations for artificial agents. This code corresponds to equations 1-70 given in the paper “A Mathematical Model of The Beer Game”.
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.
The publication and mathematical model upon which this ABM is based shows one mechanism that can lead to stable behavioral and cultural traits between groups.
A multithreaded replication of the PPHPC model in Java for testing different ABM parallelization strategies.