Computational Model Library

Our mission is to help computational modelers develop, document, and share their computational models in accordance with community standards and good open science and software engineering practices. Model authors can publish their model source code in the Computational Model Library with narrative documentation as well as metadata that supports open science and emerging norms that facilitate software citation, computational reproducibility / frictionless reuse, and interoperability. Model authors can also request private peer review of their computational models. Models that pass peer review receive a DOI once published.

All users of models published in the library must cite model authors when they use and benefit from their code.

Please check out our model publishing tutorial and feel free to contact us if you have any questions or concerns about publishing your model(s) in the Computational Model Library.

Displaying 10 of 1037 results for "Rolf Anker Ims" clear search

Eixample-MAS Traffic Simulation

Àlex Pardo Fernandez David Sánchez Pinsach | Published Tuesday, January 22, 2013 | Last modified Saturday, April 27, 2013

This MAS simulates the traffic of Barcelona Eixample. Uses a centralized AI system in order to control the traffic lights. Car agents are reactive and have no awareness of the intelligence of the system. They (try to) avoid collisions.

Agent-based model of cooperation among fourteen EU member states under geopolitical shocks, 2024-2040. States are adaptive agents on the observed intra-EU trade network, updating a cooperation propensity through inertia, network influence, and a repeated-game payoff structure built from verified Eurostat, Eurobarometer and IMF data. An anchoring device makes the observed 2024 configuration exactly stationary absent shocks, so results are read as deviations from an empirical baseline. Five scenarios of increasing severity are simulated with Monte Carlo replication, up to an extreme counterfactual crisis in the Taiwan Strait. Includes six robustness batteries and a full ODD description.

A Bottom-Up Simulation on Competition and Displacement of Online Interpersonal Communication Platforms

great-sage-futao | Published Tuesday, December 31, 2019 | Last modified Tuesday, December 31, 2019

This model aims to simulate Competition and Displacement of Online Interpersonal Communication Platforms process from a bottom-up angle. Individual interpersonal communication platform adoption and abandonment serve as the micro-foundation of the simulation model. The evolution mode of platform user online communication network determines how present platform users adjust their communication relationships as well as how new users join that network. This evolution mode together with innovations proposed by individual interpersonal communication platforms would also have impacts on the platform competition and displacement process and result by influencing individual platform adoption and abandonment behaviors. Three scenes were designed to simulate some common competition situations occurred in the past and current time, that two homogeneous interpersonal communication platforms competed with each other when this kind of platforms first came into the public eye, that a late entrant platform with a major innovation competed with the leading incumbent platform during the following days, as well as that both the leading incumbent and the late entrant continued to propose many small innovations to compete in recent days, respectively.
Initial parameters are as follows: n(Nmax in the paper), denotes the final node number of the online communication network node. mi (m in the paper), denotes the initial degree of those initial network nodes and new added nodes. pc(Pc in the paper), denotes the proportion of links to be removed and added in each epoch. pst(Pv in the paper), denotes the proportion of nodes with a viscosity to some platforms. comeintime(Ti in the paper), denotes the epoch when Platform 2 joins the market. pit(Pi in the paper), denotes the proportion of nodes adopting Platform 2 immediately at epoch comeintime(Ti). ct(Ct in the paper), denotes the Innovation Effective Period length. In Scene 2, There is only one major platform proposed by Platform 2, and ct describes that length. However, in Scene 3, Platform 2 and 1 will propose innovations alternately. And so, we set ct=10000 in simulation program, and every jtt epochs, we alter the innovation proposer from one platform to the other. Hence in this scene, jtt actually denotes the Innovation Effective Period length instead of ct.

We propose an agent-based model where a fixed finite population of tagged agents play iteratively the Nash demand game in a regular lattice. The model extends the bargaining model by Axtell, Epstein and Young.

This model simulates the spread of anti-vaccine sentiments in cyber and physical space and how it creates emergence of clusters of anti-vacciners, which eventually lead to higher probablity of disease outbreaks.

This model studies the emergence and dynamics of generalized trust. It does so by modeling agents that engage in trust games and, based on their experience, slowly determine whether others are, in general, trustworthy.

The purpose of the model is to explore how processes associated with compliance across different fishery actors’ social groups interplay with their acceptance of a fishery intervention, herein periodic closures of a small-scale octopus fishery. The model agents, entities and processes are designed based on stylized facts from literature and expert workshops on periodic closures in the Western Indian Ocean region, as well as fieldwork from Zanzibari villages that have implemented periodic octopus closures. The model is designed for scientists and decision-makers that are interested in understanding the complex interplay between fishers from different social groups, herein foot fisher men, foot fisher women and male skin divers or free divers within the periodic closure of an octopus species. Including various actions resulting from the restrictions, that is - opportunities that may be presented from restricting fishing in certain areas and during certain times. We are soon publishing an updated model with individual octopuses and their movement behaviors.

According to the philosopher of science K. Popper “All life is problem solving”. Genetic algorithms aim to leverage Darwinian selection, a fundamental mechanism of biological evolution, so as to tackle various engineering challenges.
Flibs’NFarol is an Agent Based Model that embodies a genetic algorithm applied to the inherently ill-defined “El Farol Bar” problem. Within this context, a group of agents operates under bounded rationality conditions, giving rise to processes of self-organization involving, in the first place, efficiency in the exploitation of available resources. Over time, the attention of scholars has shifted to equity in resource distribution, as well. Nowadays, the problem is recognized as paradigmatic within studies of complex evolutionary systems.
Flibs’NFarol provides a platform to explore and evaluate factors influencing self-organized efficiency and fairness. The model represents agents as finite automata, known as “flibs,” and offers flexibility in modifying the number of internal flibs states, which directly affects their behaviour patterns and, ultimately, the diversity within populations and the complexity of the system.

Biodynamica

Klaus Jaffe | Published Saturday, December 24, 2016

Agent based simulation model for the study of the genetic evolution of sexual recombination and social behavior

ergodicity_test

Jakob Grazzini | Published Monday, November 29, 2010 | Last modified Saturday, April 27, 2013

This Python module contain a function that is able to test the ergodicity of a given agent based model. It is sufficient to produce one long time series and many smaller time series. The function uses

Displaying 10 of 1037 results for "Rolf Anker Ims" clear search

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept