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 82 results design clear search

This study separates operational interoperability, fare integration and revenue-sharing governance in a stylised multi-operator bus network. An agent-based model implemented in NetLogo 7.0.3 represents passengers, buses and stations across 14 stations, nine routes and three operators. A 2 × 2 institutional design is complemented by financial clearing comparisons and 43,200 robustness runs: behavioural sensitivity (E1), a 243-configuration operational factorial (E2), and targeted joint behavioural–operational stress testing (E3). The audited experiment records show favourable interoperability effects on waiting, total travel time, transfers and realised generalised cost in all 1,944 E2 and 768 E3 configuration-level primary comparisons. Fare integration substantially reduces passenger expenditure but produces an aggregate deficit under the assumed accounting coefficients. Revenue-sharing rules redistribute operator-level outcomes without changing aggregate profit or passenger trajectories by construction. The model is intended to identify mechanisms and test conditional robustness, not predict city-specific policy effects. The paper contributes an explicit separation of access, pricing and settlement mechanisms coupled with reproducible factorial and stress-test comparisons.

This Python agent-based model simulates the diffusion of instructional practices among primary-school science teachers connected through within-school and cross-school networks. It represents teachers as agents nested in schools and compares five adoption mechanisms: simple contagion, proportion thresholds, count thresholds, adaptive norm conformity, and an individual-only baseline. The model evaluates fixed-budget training allocations, including concentrated and distributed policies, and estimates when school-level dose-response evidence can support targeted allocation. Experiments examine peer interference, cross-school contact intensity, global critical transitions, allocation stability, and the distinction between participant-level and system-level outcomes. Teacher attributes are informed by a de-identified Beijing questionnaire, whereas team sizes and contact networks are explicit model assumptions. The package includes executable Python scripts, ODD documentation, parameter tables, experiment metadata, simulation outputs, and the authorized questionnaire workbook required to reproduce the questionnaire-informed analyses. Results are intended as model-based design evidence for future longitudinal research rather than forecasts of adoption rates.

Given the importance of experiencing fulfilling and productive workdays, scholars have focused on ways to boost employees’ daily engagement and performance, suggesting this may be accomplished by increasing meaningfulness of their work tasks. However, an alternative approach may be needed in multifaceted work contexts where employees need to complete sets of varied tasks each day, including tasks that lack meaningfulness. To address this issue, we integrate the workday design perspective with research on residual engagement to examine implications of strategically sequencing tasks in terms of their meaningfulness. We theorize that because of a process we refer to as engagement cascade, performing the day’s most highly meaningful tasks earlier and in a concentrated manner will tend to produce higher levels of daily engagement relative to sequences in which the most highly meaningful tasks occur later or are disbursed. We use agent-based modeling to formalize the engagement cascade process and generate specific predictions regarding how daily engagement is impacted by different task meaningfulness sequences. Findings from an intensive longitudinal design study with NASA and ROSCOSMOS crew members (Study 1), an experience sampling field experiment with full-time employees (Study 2), and two controlled laboratory experiments with undergraduates (Study 3 and Supplement to Study 3) provide support for our hypotheses. Specifically, the decreasing task meaningfulness sequence engendered higher levels of daily engagement, and in turn, daily performance, relative to increasing, inverted U-shaped, and U-shaped sequences.

HOSS(-5) is an exploratory agent-based prototype of a small artificial society, written in Python. Each agent is a “ph” (punto humano, “human point”) that is born, is educated, works, consumes and dies. Its yearly decisions depend on a psychological profile (archetype × character), its economic status and its intentionality. Agents interact indirectly through families, firms in 10 sectors, a labour market with about 200 job categories, and a State that provides public services, employment and a Universal Basic Income, adjusting taxes and UBI each year to seek fiscal balance.

The model simulates a few thousand agents over decades of virtual time and records yearly aggregates (population, GDP, income, Gini index, HDI). A separate analysis script explores the results and fits Gamma distributions to individual incomes, comparing the shape parameter with Gini and HDI.

HOSS does not aim to predict real societies or claim empirical validation. It is a sandbox for comparing scenarios and thinking about the organizational design of society from an engineering perspective. Known limitations: no direct social relations between agents, prices and production follow simple rules rather than supply-demand dynamics, and organizations are black boxes.

…

Meridian is a deterministic artificial world in which autonomous LLM scientist agents run
experiments on instruments, exchange letters, and maintain explicit probabilistic beliefs, while
a physical constant changes covertly mid-run. The true state is known only to the simulator, so
whether anyone notices becomes a measurement rather than an interpretation.

The platform separates three things that are usually confounded: what could have been known from
…

Peer reviewed LSCs-CF: An agent-based model of public space conditions and the collective formation of local sports communities

Yijia JIANG | Published Thursday, August 13, 2026 | Last modified Thursday, August 20, 2026

An agent-based model of how public space conditions shape the collective formation of local sports communities in high-mobility cities. A small gathering is already exercising in an abstract, systematically configurable public space; the model asks how strangers join them and whether the loose gathering consolidates into a stable community. Three conditions are manipulated, each acting through exactly one channel: spatial legibility governs whether a passer-by notices the activity, routine compatibility governs whether a member attends in a given week, and social anchor availability governs how much one episode of co-presence builds a tie. Ties carry a continuous strength with two thresholds, so that relationships of differing strength cross their thresholds at different condition levels. Because the model does not represent the origin of an activity, dissolution is irreversible and survival is a clean binary outcome. Across 32,790 runs in eight experiments the model yields two well separated thresholds along routine compatibility — one for survival, one for consolidation — with a wide band between them in which a space is used continuously but no community forms. The tie submodel is adapted from Jin, Girvan and Newman (2001) and verified against it by docking. Robustness is established against the seeded gathering, the pre-existing social network, a joint ±20 per cent perturbation of the behavioural parameters, and the parameters of the tie machinery.

An empirical-response agent-based model of how many personalized feeds execute a shared low-exposure creator-discovery objective. Built from the KuaiRec dataset: the big interaction matrix initializes a transparent rank-8 matrix-factorization platform learner and the activity schedule, while the near-complete small matrix returns observed viewing responses only after a user-video pair is exposed. Four exploration policies (synchronous low-exposure targeting, uniform exploration, per-user random tie-breaking, capacity-balanced coordination) are compared over 28 rounds at a nominal 10% exploration budget, across 30 paired seeds (core) and 10 paired seeds (bias-only probe), with slot-level redundancy, cross-user collision, and coverage diagnostics.
This release accompanies an anonymised manuscript under review at the Journal of Artificial Societies and Social Simulation.

The model represents 1,411 users, 3,327 videos, 2,031 authors, and an adaptive platform over 28 discrete rounds derived from the KuaiRec big-matrix activity calendar. Exploration policies differ only in how a fixed 10% slot budget is allocated; all policies share the opportunity schedule, response oracle, initial checkpoints, and online update rule.

Archive contents: analysis pipeline scripts (01-16), frozen machine-readable protocols with input hashes, initial model checkpoints, aggregate result tables, the complete ODD protocol record, and publication figures. Raw KuaiRec files are not redistributed; obtain them from the official dataset repository and verify against the input hashes in data_contract/. Row-level oracle tables are excluded by design.
…

This model tests whether local housing supply elasticity governs crash severity inside a single metropolitan housing market. Saiz (2010) established that across US metros, regions constrained by geography and regulation experience deeper boom-bust cycles than flexible ones. That finding is routinely applied downward to neighborhoods and ZIP codes as though the mechanism scaled without qualification.

The empirical record for the Washington DC and Northern Virginia region says it does not. Across 84 ZIP codes, measured supply elasticity ranges from 0.35 to 4.95 with a median of 1.21. The worst single-year price decline between 2007 and 2012 averaged 9.6 percent in constrained ZIP codes and 9.0 percent in flexible ones, a gap that cannot be distinguished from noise. Wide variation in the proposed cause, no meaningful separation in the proposed effect.

The model embeds households, houses and a metro-wide credit condition in the real ZIP geography of the region using three GIS layers and an empirical price panel. Local elasticity governs construction, exactly as theory predicts. Prices are driven by a shared macro drift schedule and, under the credit-amplified mode, by a leverage cycle with a financial accelerator and a deviation penalty. The design question is whether those shared forces are sufficient to override local supply differences at the sub-metropolitan scale.

…

This paper develops a spatial agent-based model to examine how fertility regime shifts reshape population concentration and wealth distribution in an abstract urban system. Migration decisions combine population preference, cultural homophily, expected net income, and resource endowment through a standardised softmax utility. The design is deliberately stylised: it is not calibrated to a particular country or city system, but is intended to isolate the feedbacks linking migration, fertility, urban scaling, and accumulated wealth.
The simulations reveal robust directional asymmetry. When fertility shifts from low to high, population concentration responds rapidly; when fertility shifts from high to low, concentration declines only after a detectable delay and may temporarily continue in the previous direction. Wealth adds a second layer of hysteresis: cell total-wealth concentration follows population concentration with delay, cell mean-wealth inequality and system-level wealth indicators are slower still, and phase-space trajectories form loops rather than collapsing onto a single population–wealth curve. Robustness experiments indicate that longer fertility cycles, wider mobility neighbourhoods, and smoother resource landscapes change the magnitude of delay and overshoot, but do not remove the qualitative asymmetry. The paper argues that demographic decline should be understood not as the mirror image of demographic expansion, but as a path-dependent transition mediated by fast migration-income feedbacks and slower fertility, cohort, culture, and wealth mechanisms.

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.

…

Displaying 10 of 82 results design 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