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 999 results for "Jan Van Bavel" clear search

Crowdworking Model

Georg Jäger | Published Wednesday, September 25, 2019

The purpose of this agent-based model is to compare different variants of crowdworking in a general way, so that the obtained results are independent of specific details of the crowdworking platform. It features many adjustable parameters that can be used to calibrate the model to empirical data, but also when not calibrated it yields essential results about crowdworking in general.
Agents compete for contracts on a virtual crowdworking platform. Each agent is defined by various properties like qualification and income expectation. Agents that are unable to turn a profit have a chance to quit the crowdworking platform and new crowdworkers can replace them. Thus the model has features of an evolutionary process, filtering out the ill suited agents, and generating a realistic distribution of agents from an initially random one. To simulate a stable system, the amount of contracts issued per day can be set constant, as well as the number of crowdworkers. If one is interested in a dynamically changing platform, the simulation can also be initialized in a way that increases or decreases the number of crowdworkers or number of contracts over time. Thus, a large variety of scenarios can be investigated.

TIMELY Model

Pia Backmann | Published Thursday, September 19, 2019

An individual-based model to evaluate, whether time delays in plant responses to insect herbivory can be beneficial for the plant.

Digital Mobility Model (DMM)

Na (Richard) Jiang Fiammetta Brandajs | Published Thursday, February 01, 2024 | Last modified Friday, February 02, 2024

The purpose of the Digital Mobility Model (DMM) is to explore how a society’s adoption of digital technologies can impact people’s mobilities and immobilities within an urban environment. Thus, the model contains dynamic agents with different levels of digital technology skills, which can affect their ability to access urban services using digital systems (e.g., healthcare or municipal public administration with online appointment systems). In addition, the dynamic agents move within the model and interact with static agents (i.e., places) that represent locations with different levels of digitalization, such as restaurants with online reservation systems that can be considered as a place with a high level of digitalization. This indicates that places with a higher level of digitalization are more digitally accessible and easier to reach by individuals with higher levels of digital skills. The model simulates the interaction between dynamic agents and static agents (i.e., places), which captures how the gap between an individual’s digital skills and a place’s digitalization level can lead to the mobility or immobility of people to access different locations and services.

An agent-based model of adaptive cycles of the spruce budworm

Julia Schindler | Published Saturday, August 18, 2012 | Last modified Saturday, April 27, 2013

This is an empirically calibrated agent-based model that replicates spruce-budworm outbreaks, one of the most cited adaptive cycles reported. The adaptive-cycle metaphor by L. H. Gunderson and C. S. Holling posits the cross-case existence of repeating cycles of growth, conservation, collapse, and renewal in many complex systems, triggered by loss of resilience. This model is one of the first agent-based models of such cycles, with the novelty that adaptive cycles are not defined by system- […]

We provide a full description of the model following the ODD protocol (Grimm et al. 2010) in the attached document. The model is developed in NetLogo 5.0 (Wilenski 1999).

Peer reviewed An Agent-Based Model of Status Construction in Task Focused Groups

Andreas Flache Rafael Wittek André Grow | Published Sunday, May 18, 2014 | Last modified Tuesday, June 16, 2015

The model simulates interactions in small, task focused groups that might lead to the emergence of status beliefs among group members.

This model simulates how collective self-organisation among individuals that manage irrigation resource collectively.

The model implements a double auction financial markets with two types of agents: rational and noise. The model aims to study the impact of different compensation structure on the market stability and market quantities as prices, volumes, spreads.

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.

I added a discounting rate to the equation for expected values of defective / collaborative strategies.
The discounting rate was set to 0.956, the annual average from 1980 to 2015, using the Consumer Price Index (CPI) of Statistics Korea.

Displaying 10 of 999 results for "Jan Van Bavel" 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