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 1229 results for "Lee-Ann Sutherland" clear search

Peer reviewed Party Competition with Costly Voting

Thomas Mustillo | Published Tuesday, July 07, 2026

Party Competition with Costly Voting builds upon the baseline model in Chapter 5 from Laver and Sergenti’s Party Competition (2011); it adds voting costs to generate variable turnout.

STiMUS-HAI (Stigmergic–Mutualistic IMOI Model, Human-AI extension) is an agent-based model of teamwork in socio-technical systems where human and AI contributors collaborate through shared digital artefacts — wiki pages, code files, issue tickets, project cards, Scratch projects — represented as patches in a NetLogo world. It extends the human-only base model STiMUS v2.2, which established that two coordination mechanisms — stigmergy (indirect coordination through traces left in the environment) and mutualism (mutual benefit between contributors and the artefacts they tend) — can be decoupled: stigmergy decides where a contributor works, mutualism decides with what effort. STiMUS-HAI preserves this decoupling unchanged and adds two further theoretical questions: whether mixing AI agents into a human team distorts human coordination in ways that aggregate indicators hide, and whether AI’s cost to team outcomes depends on the type of work AI performs, not only on how much of it is present.

Two breeds of turtle — humans and ai-agents — follow identical target-selection, pheromone, and mutualism rules, so that any behavioural difference is attributable to team composition rather than a built-in advantage. The one designed asymmetry: AI agents never accumulate shared-mental-model and their motivation is fixed rather than adaptive. On top of this v3.0 baseline, v3.1 adds a task-type dimension to artefacts (“prediction” versus “judgment”, set via a judgment-share slider) that scales down AI edit-power specifically on judgment-requiring artefacts, and an ai-trust mechanic: humans build or lose trust in AI contributions based on the population-relative percentile rank of observed AI work quality (bottom-quartile work counts as an observed “error”), and that trust gates how much mutualistic benefit a human derives from continuing an AI’s work. Trust erodes quickly on a single error and recovers only after a streak of confirmed successes — an intentional asymmetry.

This model describes and analyses the outcomes of the confrontation of interests, some conflicting, some common, about the management of a small river in SW France

Peer reviewed JuSt-Social COVID-19

Jennifer Badham | Published Thursday, June 18, 2020 | Last modified Monday, March 29, 2021

NetLogo model that allows scenarios concerning general social distancing, shielding of high-risk individuals, and informing contacts when symptomatic. Documentation includes a user manual with some simple scenarios, and technical information including descriptions of key procedures and parameter values.

Peer reviewed Umwelten Ants

Kit Martin | Published Thursday, January 15, 2015 | Last modified Thursday, August 27, 2015

Simulates impacts of ants killing colony mates when in conflict with another nest. The murder rate is adjustable, and the environmental change is variable. The colonies employ social learning so knowledge diffusion proceeds if interactions occur.

The Episim framework builds upon the established transportation simulation MATSim and is capable of tracking agents’ movements within a network and thus computing infection chains. Several characteristics of the virus and the environment can be parametred, whilst the infection dynamics is computed based upon a compartment model. The spread of the virus can be mitigated by restricting the agents’ activity in certain places.

If you have any questions about the model run, please send me an email and I will respond as soon as possible.
Under complex system perspectives, we build the multi-agent system to back-calculate this unification process of the Warring State period, from 32 states in 475 BC to 1 state (Qin) in 221 BC.

Due to the large extent of the Harz National Park, an accurate measurement of visitor numbers and their spatiotemporal distribution is not feasible. This model demonstrates the possibility to simulate the streams of visitors with ABM methodology.

This model aims at creating agent populations that have “personalities”, as described by the Big Five Model of Personality. The expression of the Big Five in the agent population has the following properties, so that they resemble real life populations as closely as possible:
-The population mean of each trait is 0.5 on a scale from 0 to 1.
-The population-wide distribution of each trait approximates a normal distribution.
-The intercorrelations of the Big Five are close to those observed in the Literature.

The literature used to fit the model was a publication by Dimitri van der Linden, Jan te Nijenhuis, and Arnold B. Bakker:

The Opportunistic Acquisition Model (OAM) posits that the archaeological lithic raw material frequencies are due to opportunistic encounters with sources while randomly walking in an environment.

Displaying 10 of 1229 results for "Lee-Ann Sutherland" 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