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.
Flibs’NLogo implements in NetLogo modelling environment, a genetic algorithm whose purpose is evolving a perfect predictor from a pool of digital creatures constituted by finite automata or flibs (finite living blobs) that are the agents of the model. The project is based on the structure described by Alexander K. Dewdney in “Exploring the field of genetic algorithms in a primordial computer sea full of flibs” from the vintage Scientific American column “Computer Recreations”
As Dewdney summarized: “Flibs […] attempt to predict changes in their environment. In the primordial computer soup, during each generation, the best predictor crosses chromosomes with a randomly selected flib. Increasingly accurate predictors evolve until a perfect one emerges. A flib […] has a finite number of states, and for each signal it receives (a 0 or a 1) it sends a signal and enters a new state. The signal sent by a flib during each cycle of operation is its prediction of the next signal to be received from the environment”
This is a conceptual model of underlying forces creating industrial clusters. There are two contradictory forces - attraction and repulsion. Firms within the same Industry are attracted to each other and on the other hand, firms with the same Activity are repulsed from each other. In each round firm with the lowest fitness is selected to change its profile of Industries and Activities. Based on these simple rules interesting patterns emerge.
BorealFireSIM is a cellular automaton based model that serves to identify future fire patterns in the boreal forest of Quebec, Canada. The model simulates yearly fire seasons and adjusts decadal climate variables based on two future carbon pathways (RCP45 (low emissions) and RCP85 (business as usual)). The BorealFireSIM model simulates future fire patterns up to the year 2100.
The model explores how corruption may spread endogenously within a closed society by depicting the behavior within a cellular automaton context (CA) between bureaucrats and citizens. Within the model, corruption is characterized as a behavior product dependent upon an individual’s personal disposition towards honesty, rational decisionmaking processes, and neighbors’ behavior.
Signaling chains are a special case of Lewis’ signaling games on networks. In a signaling chain, a sender tries to send a single unit of information to a receiver through a chain of players that do not share a common signaling system.
SimAdapt: An individual-based genetic model for simulating landscape management impacts on populations
The model attempts to explore the trade-offs between immigration policies and successfully identifying human trafficking victims.
The model of market of one commodity , in which there are in each moment of time the same quantity and the same quantity of money was formulated and researched in this text. We also study this system as a game of automata.
This model was programmed for a class project, which studied the effects of urban sprawl on bird distribution. For the urban sprawl part of the model, we started from the model in (udhira, H. S., 200
MayaSim is an agent-based, cellular automata and network model of the ancient Maya. Biophysical and anthropogenic processes interact to grow a complex social ecological system.