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.
MOOvPOPsurveillance was developed as a tool for wildlife agencies to guide collection and analysis of disease surveillance data that relies on non-probabilistic methods like harvest-based sampling.
The Garbage Can Model of Organizational Choice (GCM) is a fundamental model of organizational decision-making originally propossed by J.D. Cohen, J.G. March and J.P. Olsen in 1972. In their model, decisions are made out of random meetings of decision-makers, opportunities, solutions and problems within an organization.
With this model, these very same agents are supposed to meet in society at large where they make decisions according to GCM rules. Furthermore, under certain additional conditions decision-makers, opportunities, solutions and problems form stable organizations. In this artificial ecology organizations are born, grow and eventually vanish with time.
This model is programmed in Python 3.6. We model how different consensus protocols and trade network topologies affect the performance of a blockchain system. The model consists of multiple trader and miner agents (Trader.py and Tx.py), and one system agent (System.py). We investigated three consensus protocols, namely proof-of-work (PoW), proof-of-stake (PoS), and delegated proof-of-stake (DPoS). We also examined three common trade network topologies: random, small-world, and scale-free. To reproduce our results, you may need to create some databases using, e.g., MySQL; or read and write some CSV files as model configurations.
A simple model that aims to demonstrate the influence of agri-environmental payments on land-use patterns in a virtual landscape. The landscape consists of grassland (which can be managed extensively or intensively) and a river. Agri-environmental payments are provided for extensive management of grassland. Additionally, there are boni for (a) extensive grassland in proximity of the river; and (b) clusters (“agglomerations”) of extensive grassland. The farmers, who own randomly distributed grassland patches, make decisions either on the basis of simple income maximization or they maximize only up to an income threshold beyond which they seize making changes in management. The resulting landscape pattern is evaluated by means of three simple models for (a) agricultural yield, (b) habitat/biodiversity and (c) water quality. The latter two correspond to the two boni. The model has been developed within a small project called Aligning Agent-Based Modelling with Multi-Objective Land-Use Allocation (ALABAMA).
A demonstration model showing how modellers can create a multi regional tram network with commuters, destinations and houses. The model offers options to create a random tram network made from modeller input or to load shapefiles for the Greater Manchester Metrolink.
The model uses NetLogo with gis, nw an csv extensions.
Lethal Geometry examines the relationship between territory size and intergroup mortality risk under realistic assumptions. Furthermore, the model investigates how fertility is affected by this relationship. Territory sizes are expected to fluctuate over time in response to individual reproduction, random-walking, and lethal intergroup encounters. In turn, the individuals within these territories are expected to vary in their mortality and fertility rates.
The model demonstrates how non-instantaneous sampling techniques produce bias by overestimating the number of counted animals, when they move relative to the person counting them.
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”
Modeling an economy with stable macro signals, that works as a benchmark for studying the effects of the agent activities, e.g. extortion, at the service of the elaboration of public policies..
This is a model of a game of Telephone (also known as Chinese Whishpers in the UK), with agents representing people that can be asked, to play. The first player selects a word from their internal vocabulary and “whispers” it to the next player, who may mishear it depending on the current noise level, who whispers that word to the next player, and so on.
When the game ends, the word chosen by the first player is compared to the word heard by the last player. If they match exactly, all players earn large prize. If the words do not match exactly, a small prize is awarded to all players for each part of the words that do match. Players change color to reflect their current prize-count. A histogram shows the distribution of colors over all the players.
The user can decide on factors like
* how many players there are,