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 194 results reviewed 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.

Peer reviewed STiMUS: A Stigmergic–Mutualistic Agent-Based Model of Teamwork on Shared Digital Artefacts (IMOI)

Yevgeny Patarakin | Published Friday, July 03, 2026 | Last modified Wednesday, July 22, 2026

STiMUS (Stigmergic–Mutualistic IMOI Model) is an agent-based model of teamwork in socio-technical systems where contributors collaborate through shared digital artefacts — wiki pages, code files, issue tickets, project cards, Scratch projects — represented as patches in a NetLogo world. The model integrates two coordination mechanisms. Stigmergy is indirect coordination through traces left in a shared environment: each edit deposits a pheromone that diffuses to neighbouring patches and evaporates over time, so recent activity attracts further contributions. Mutualism is a reciprocal benefit loop in which valuable, well-maintained artefacts raise contributor motivation and shared understanding, while motivated contributors improve artefacts.

Contributors (turtles of the contributor breed) carry individual state: skill, motivation, shared-mental-model, specialty, benefit-gain, and an explicit-mode flag. At each tick every contributor selects a target artefact with an ant-colony-optimization-style rule weighing the artefact’s pheromone, incompleteness (1 - completeness), resource-value, and topic match between specialty and the artefact’s topic-tag; with probability p-explicit it instead takes the patch with the highest maintenance-need, modelling explicit task assignment. Each edit increases pheromone, quality, completeness and reuse-count, raises resource-value, lowers maintenance-need, and appends the editor to the artefact’s edit-authors list. When the previous last-editor-id differs from the current editor, the Edit Succession Ratio rises, the editor’s shared-mental-model grows, and a co-editing link is created — operationalising the idea that repeated cross-author succession on the same artefact builds shared understanding. Contributors’ motivation is updated from the benefit drawn from the visited artefact.

Each patch maintains a stigmergic layer (pheromone, quality, completeness, recentness, last-editor-id, edit-count, edit-authors) and a mutualistic layer (resource-value, reuse-count, maintenance-need, topic-tag), plus task flags (is-task?, task-complexity). Global monitors report the Edit Succession Ratio (ESR = cross-author-edits / total-edits, and an alternative esr-value = share of edited patches with more than one distinct author), mean-quality, mean-resource-value, a mutualism-index averaging contributor benefit and resource value, coediting-density (network density of the co-editing graph), active-pages-share, and task-completion-rate. The model logs every edit as a bipartite edge (tick, author_id, pageid, specialty, topic_tag, quality), exportable to CSV.

This model is a part of an ongoing research project on Multiagent Reinforcement Learning (MARL). The ODD protocol is included in the model. In this version of the model, Proximal Policy Optimization (PPO) is designed in the agent behaviors. It also includes a designed experiment in its Behavior Space which is used in the Response Surface Methodology and training of an Artificial Neural Network (ANN) based Recommender System.

Peer reviewed Kenya ITN Agent-Based Microsimulation (2003–2024)

Wooyoung Kim Hosang Shin | Published Saturday, April 18, 2026 | Last modified Tuesday, June 16, 2026

An agent-based microsimulation of insecticide-treated net (ITN) distribution and adoption in Kenya (2003–2024), integrating the Theory of Planned Behaviour, Rogers diffusion, Weibull net decay, and a GPS-based two-layer social network. 8,561 household agents calibrated via Approximate Bayesian Computation to six DHS/MIS survey waves, achieving 2.42 pp mean absolute error on Kenya-level ownership. The analysis chain supports mechanism counterfactuals and policy experiments on equity outcomes of ITN distribution strategies.

Peer reviewed Gradient Descent Simulation

Ilyes Azouani | Published Wednesday, March 18, 2026 | Last modified Monday, May 25, 2026

This model visualizes gradient descent optimization - the fundamental algorithm used to train neural networks and other machine learning models. Agents represent different optimization algorithms searching for the minimum of a loss landscape (the “error surface” that ML models try to minimize during training).

The model demonstrates how different optimizer types (SGD, Momentum with different parameters) behave on various loss landscapes, from simple bowls to the notoriously difficult Rosenbrock “banana valley” function. This helps build intuition about why certain optimization algorithms work better than others for different problem geometries.

HOW IT WORKS

Peer reviewed A dynamic identity model for misinformation in social networks

emdhar | Published Friday, February 27, 2026

A dynamic identity model for misinformation in social networks, an agent-based model of social identity and misinformation dynamics.

I developed this model as a part of my master’s thesis, “Does social identity drive belief and persistence in online misinformation? An agent-based modelling approach” at University College Dublin, Ireland (2024-2025).

The purpose of this model is to further understand the dynamics of misinformation sharing as an expression of social identity. I introduce a framework to understand the influence of self-categorisation on misinformation persistence in social network. It integrates a social learning model with the Dynamic Identity Model for Agents (DIMA) using simple logic to simulate the social trade-offs driving misinformation and observe the effects on misinformation spread.

Peer reviewed Green Consumption Tipping Point

Mario | Published Thursday, February 26, 2026

This model is a minimal agent-based model (ABM) of green consumption and market tipping dynamics in a stylised two-firm economy. It is designed as an existence proof to illustrate how weak individual preferences, when combined with habit formation, social influence, and firm price adaptation, can generate non-linear transitions (tipping points) in market outcomes.

The economy consists of:
1) Two firms, each supplying a differentiated consumption bundle that differs in its fixed green share (one relatively greener, one less green).
2) Many households, each consuming a unit mass per period and allocating consumption between the two firms.

Peer reviewed Online Protest and Repression in Authoritarian Settings (OPRAS)

Nanda Wijermans Annie Waldherr Aytalina Kulichkina | Published Tuesday, January 27, 2026 | Last modified Tuesday, April 07, 2026

This agent-based model, developed for the study “Online Protest and Repression in Authoritarian Settings,” examines how online protest and repression evolve in authoritarian contexts and how these dynamics affect ordinary users’ attitudes and behavior on social media. The model integrates key theoretical and empirical insights into social media use and core political factors that shape digital contention in authoritarian settings. The following questions are addressed: (1) how online protest–repression dynamics unfold across different levels of authoritarianism and varying compositions of committed accounts, and (2) how ordinary users’ internal propensity to protest and their perceived probability of successful repression change during online protest-repression contestation. The model is evaluated against two empirically grounded macro patterns observed in the real world. The first is enduring protest: online protest becomes dominant as vocal protesters grow to outnumber vocal repressors, shrinking the pool of silent users and stabilizing a pro-protest majority. The second is suppressed protest: online dissent is contained as vocal repression and silence expand in response to protest, yielding a sustained majority of repressive and silent accounts. Together, these dynamics demonstrate how dissenting voices are empowered and suppressed online in authoritarian settings.

Peer reviewed The Andean Resource Management Model (ARMM)

Olga Palacios | Published Tuesday, January 20, 2026

ARMM is a theoretical agent-based model that formalizes Murra’s Theory of Verticality (Murra, 1972) to explore how multi-zonal resource management systems emerge in mountain landscapes. The model identifies the social, political, and economic mechanisms that enable vertical complementarity across ecological gradients.
Built in NetLogo, ARMM employs an abstract 111×111 grid divided into four Andean ecological zones (Altiplano, Highland, Lowland, Coast), each containing up to 18 resource types distributed according to ecological suitability. To test general theoretical principles rather than replicate specific geography, resource locations are randomized at each model initialization.
Settlement agents pursue one of two economic strategies: diversification (seeking resource variety, maximum 2 units per type) or accumulation (maximising total quantity, maximum 30 units). Agents move between adjacent zones through hierarchical decision-making, first attempting peaceful interactions—coexistence (governed by tolerance) and trading (governed by cooperation)—before resorting to conflict (theft or takeover, governed by belligerence).
The model demonstrates that vertical complementarity can emerge through fundamentally different mechanisms: either through autonomous mobility under political decentralization or through state-coordinated redistribution under centralization. Sensitivity analysis reveals that belligerence and economic strategy explain approximately 25% of outcome variance, confirming that structural inequalities between zones result from political-economic organization rather than environmental constraints alone.
As a preliminary theoretical model, ARMM intentionally maintains simplicity to isolate core mechanisms and generate testable hypotheses. This foundational framework will guide future empirically-calibrated versions that incorporate specific archaeological settlement data and geographic features from the Carangas region (Bolivia-Chile border), enabling direct comparison between theoretical predictions and observed historical patterns.

Peer reviewed Boyds (NetLogo): Boids That Fight

Oliver M. Haynold | Published Tuesday, January 20, 2026

Boyds (Boids that Fight) is an agent-based model in NetLogo that extends the classic Flocking model with multi-faction competition, a local fight–flight heuristic, and a target locking/“taking” mechanism. The model separates perception (vision) from engagement range (lock distance) and uses per-faction steering bounds to explore how local numerical superiority, sensing, and bounded turning affect victory, losses, and emergent formations.

Displaying 10 of 194 results reviewed 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