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 163 results networks clear search
NearshoreABM simulates whether a region captures the production linkages that nearshoring makes available, or fails to capture them because physical infrastructure and credit supply bind first.
The model runs over the 32 Mexican states at quarterly frequency. Multinational anchor firms decide whether to enter and where to locate, following Melitz selection on heterogeneous productivity under trade-policy uncertainty. Domestic supplier firms decide whether to formalise and whether to invest in quality, and may or may not obtain a contract with an anchor. A banking sector allocates a finite regional credit supply according to observed default risk, serving anchor firms before suppliers.
Electricity and water capacity enter production as non-linear congestion penalties with an engineering-based threshold, so the response of output to demand growth is discontinuous rather than proportional: below the threshold there is no penalty at all, between threshold and capacity the penalty grows quadratically, and above capacity it decays exponentially. Congestion is rivalrous within the quarter, which makes the order of production economically meaningful rather than incidental.
…
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
…
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.
ABMIND, the Agent-Based Model of Individual Psychological Distance, is a modeling framework developed to examine how psychological distance influences environmental protection behavior in coastal farming communities in southern China. Using household survey data and empirically estimated behavioral pathways, the model represents how uncertainty shapes four dimensions of psychological distance, namely temporal, spatial, social and hypothetical distance, and how these dimensions guide protection and degradation decisions. Agents include households, government actors and mangrove ecosystem patches, connected through social networks and ecological feedbacks that affect learning, expectations and perceived benefits. Policy interventions such as rewards, penalties and publicity guidance efforts work by modifying uncertainty and psychological distance rather than directly controlling behavior. ABMIND is implemented as a spatially explicit model following the ODD protocol, and a concise user guide is provided. In developing ABMIND we introduce a structured validation workflow that links statistical mediation analysis with simulation-based diagnostics, allowing empirical cognitive mechanisms to be systematically embedded and tested within the ABM. This integrated approach strengthens the credibility of psychological-mechanism models and supports their use in policy evaluation. The framework offers a methodological platform for integrating cognitive mechanisms into agent-based environmental behavior modeling and for evaluating policy strategies that support ecosystem protection.
Model paper:
ABMIND: An empirically informed agent-based model of psychological distance and environmental protection behaviour
Ecological Modelling
https://doi.org/10.1016/j.ecolmodel.2026.111700
This repository contains the Python implementation of an agent-based model investigating how heterogeneous mobility and boundary-crossing dynamics generate large-scale connectivity in structured multi-attractor landscapes. A small fraction of higher-mobility agents explores the environment while the remaining agents stay locally constrained. The model compares pure random-walk exploration, interface-sensitive dynamics, novelty-biased exploration, and a flat-landscape control. The release includes the complete simulation framework, the experimental pipeline used in the associated paper, multi-K and population-scaling robustness analyses, network-snapshot and transition-slope analyses, and reproducibility documentation. Transition networks are analysed using graph density, connected components, and giant weakly connected components. The implementation is compatible with Python 3.11 and is released under the MIT License.
Interest-based compound economies generate monotonically increasing wealth inequality through multiplicative accumulation dynamics, yet the conditions under which gift-based reciprocal exchange outperforms such systems in collective well-being remain unquantified. We present Zensei Wago (全生和合), a seven-layer agent-based model comparing a Gift Resource Circulation (GRC) economy with a Compound Interest Circulation (CIC) economy under identical initial conditions. Across N = 5000 Monte Carlo replications (T = 700 ticks, N = 100 agents), GRC produced significantly higher collective resonance than CIC (p < 0.001, Cohen’s d = +0.171), above a critical prosocial threshold pm ≈ 0.698. Cohen’s d grows monotonically with duration — d = +1.943 at T = 1500 and d = +4.126 at T = 3000 — driven primarily by structural collapse of CIC resonance as inequality exceeds a critical Gini threshold (G > 0.333), while GRC resonance remains stable. The gift mechanism further decouples collective well-being from distributional outcomes, generating resonance through relational quality rather than material redistribution. Network topology analysis across seven configurations — combining a Watts-Strogatz rewiring sweep and a T = 1500 longitudinal replication — reveals that ring topology maximises GRC advantage (d = +1.17), that most topology-dependent reversals are transient (sparse and small-world both transition to significantly positive by T = 1500), and that a critical rewiring threshold of p ≈ 0.10–0.20 separates GRC-advantaged from GRC-disadvantaged network configurations. Scale-free networks remain persistently adverse (d = -7.24*), requiring structural redesign for gift-economy viability.
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.
This model aims to study the dynamic propagation of individual behaviour within social networks, focusing on how normative expectations (NE) and experiential expectations (EE) jointly influence behavioural decisions. It also explores the long-term effects of different intervention scenarios (such as enhancing visibility, considering indirect social links, and education) on behavioural propagation patterns and the overall behaviour of the group.
The model was developed in NetLogo 6.4. It generates simulated groups based on large-scale survey data, utilizing NetLogo’s CSV, Table, and Matrix extensions. The model also employs the NW extension to enable network analysis functionality.
The model is designed for research “Shaping social norms to promote individual response behavior in public crises: An agent-based modeling approach” in Journal of Cleaner Production, Volume 554, 8 April 2026, 148014
https://doi.org/10.1016/j.jclepro.2026.148014
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.
…
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.
Displaying 10 of 163 results networks clear search