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.
AncientS-ABM is an agent-based model for simulating and evaluating the potential social organization of an artificial past society, configured by available archaeological data. Unlike most existing agent-based models used in archaeology, our ABM framework includes completely autonomous, utility-based agents. It also incorporates different social organization paradigms, different decision-making processes, and also different cultivation technologies used in ancient societies. Equipped with such paradigms, the model allows us to explore the transition from a simple to a more complex society by focusing on the historical social dynamics; and to assess the influence of social organization on agents’ population growth, agent community numbers, sizes and distribution.
AncientS-ABM also blends ideas from evolutionary game theory with multi-agent systems’ self-organization. We model the evolution of social behaviours in a population of strategically interacting agents in repeated games where they exchange resources (utility) with others. The results of the games contribute to both the continuous re-organization of the social structure, and the progressive adoption of the most successful agent strategies. Agent population is not fixed, but fluctuates over time, while agents in stage games also receive non-static payoffs, in contrast to most games studied in the literature. To tackle this, we defined a novel formulation of the evolutionary dynamics via assessing agents’ rather than strategies’ fitness.
As a case study, we employ AncientS-ABM to evaluate the impact of the implemented social organization paradigms on an artificial Bronze Age “Minoan” society, located at different geographical parts of the island of Crete, Greece. Model parameter choices are based on archaeological evidence and studies, but are not biased towards any specific assumption. Results over a number of different simulation scenarios demonstrate better sustainability for settlements consisting of and adopting a socio-economic organization model based on self-organization, where a “heterarchical” social structure emerges. Results also demonstrate that successful agent societies adopt an evolutionary approach where cooperation is an emergent strategic behaviour. In simulation scenarios where the natural disaster module was enabled, we observe noticeable changes in the settlements’ distribution, relating to significantly higher migration rates immediately after the modeled Theran eruption. In addition, the initially cooperative behaviour is transformed to a non-cooperative one, thus providing support for archaeological theories suggesting that the volcanic eruption led to a clear breakdown of the Minoan socio-economic system.
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”