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.
The purpose of the model is to explore the influence of actor behaviour, combined with environment and business model design, on the survival rates of Industrial Symbiosis Networks (ISN), and the cash flows of the agents. We define an ISN to be robust, when it is able to run for 10 years, without falling apart due to leaving agents.
The model simulates the implementation of local waste exchange collaborations for compost production, through the ISN implementation stages of awareness, planning, negotiation, implementation, and evaluation.
One central firm plays the role of waste processor in a local composting initiative. This firm negotiates with other firms to become a supplier of their organic residual streams. The waste suppliers in the model can decide to join the initiative, or to have the waste brought to the external waste incinerator. The focal point of the model are the company-level interactions during the implementation or ending of synergies.
The purpose of the model is to collect information on human decision-making in the context of coalition formation games. The model uses a human-in-the-loop approach, and a single human is involved in each trial. All other agents are controlled by the ABMSCORE algorithm (Vernon-Bido and Collins 2020), which is an extension of the algorithm created by Collins and Frydenlund (2018). The glove game, a standard cooperative game, is used as the model scenario.
The intent of the game is to collection information on the human players behavior and how that compares to the computerized agents behavior. The final coalition structure of the game is compared to an ideal output (the core of the games).
Agers and non-agers agent compete over a spatial landscape. When two agents occupy the same grid, who will survive is decided by a random draw where chances of survival are proportional to fitness. Agents have offspring each time step who are born at a distance b from the parent agent and the offpring inherits their genetic fitness plus a random term. Genetic fitness decreases with time, representing environmental change but effective non-inheritable fitness can increase as animals learn and get bigger.
This is an Agent Based Model of a generic food chain network consisting of stylized individuals representing producers, traders, and consumers. It is developed to: 1/ to describe the dynamically changing disaggregated flows of crop items between these agents, and 2/ to be able to explicitly consider agent behavior. The agents have implicit personal objectives for trading. Resilience and efficiency are quantified using the ascendency concept by linking these to the fraction of fulfillment of the overall explicit objective to have all consumers meet their food requirement. Different types of network structures in combination with different agent interaction types under different types of stylized shocks can be simulated.
Studies of colonization processes in past human societies often use a standard population model in which population is represented as a single quantity. Real populations in these processes, however, are structured with internal classes or stages, and classes are sometimes created based on social differentiation. In this present work, information about the colonization of old Providence Island was used to create an agent-based model of the colonization process in a heterogeneous environment for a population with social differentiation. Agents were socially divided into two classes and modeled with dissimilar spatial clustering preferences. The model and simulations assessed the importance of gregarious behavior for colonization processes conducted in heterogeneous environments by socially-differentiated populations. Results suggest that in these conditions, the colonization process starts with an agent cluster in the largest and most suitable area. The spatial distribution of agents maintained a tendency toward randomness as simulation time increased, even when gregariousness values increased. The most conspicuous effects in agent clustering were produced by the initial conditions and behavioral adaptations that increased the agent capacity to access more resources and the likelihood of gregariousness. The approach presented here could be used to analyze past human colonization events or support long-term conceptual design of future human colonization processes with small social formations into unfamiliar and uninhabited environments.
The O.R.E. (Opinions on Risky Events) model describes how a population of interacting individuals process information about a risk of natural catastrophe. The institutional information gives the official evaluation of the risk; the agents receive this communication, process it and also speak to each other processing further the information. The description of the algorithm (as it appears also in the paper) can be found in the attached file OREmodel_description.pdf.
The code (ORE_model.c), written in C, is commented. Also the datasets (inputFACEBOOK.txt and inputEMAILs.txt) of the real networks utilized with this model are available.
For any questions/requests, please write me at [email protected]
The Multilevel Group Selection I (MGS I) model simulates a population of contributing and non-contributing agents, competing on a social landscape for higher-value spots in an effort to withstand some selection pressure. It may be useful to both scientists and students in hypothesis testing, theory development, or more generally in understanding multilevel group selection.
This model was developed to test the usability of evolutionary computing and reinforcement learning by extending a well known agent-based model. Sugarscape (Epstein & Axtell, 1996) has been used to demonstrate migration, trade, wealth inequality, disease processes, sex, culture, and conflict. It is on conflict that this model is focused to demonstrate how machine learning methodologies could be applied.
The code is based on the Sugarscape 2 Constant Growback model, availble in the NetLogo models library. New code was added into the existing model while removing code that was not needed and modifying existing code to support the changes. Support for the original movement rule was retained while evolutionary computing, Q-Learning, and SARSA Learning were added.
The model simulates the national Campaign-Based Watershed Management program of Ethiopia. It includes three agents (farmers, Kebele/ village administrator, extension workers) and the physical environment that interact with each other. The physical environment is represented by patches (fields). Farmers make decisions on the locations of micro-watersheds to be developed, participation in campaign works to construct soil and water conservation structures, and maintenance of these structures. These decisions affect the physical environment or generate model outcomes. The model is developed to explore conditions that enhance outcomes of the program by analyzing the effect on the area of land covered and quality of soil and water conservation structures of (1) enhancing farmers awareness and motivation, (2) establishing and strengthening micro-watershed associations, (3) introducing alternative livelihood opportunities, and (4) enhancing the commitment of local government actors.
Genetic algorithms try to solve a computational problem following some principles of organic evolution. This model has educational purposes; it can give us an answer to the simple arithmetic problem on how to find the highest natural number composed by a given number of digits. We approach the task using a genetic algorithm, where the candidate solutions to the problem are represented by agents, that in logo programming environment are usually known as “turtles”.