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 54 results replication clear search
Shared vocabularies are not designed by any central authority; they emerge from the bottom up as communities of speakers repeatedly try to understand one another. We study this process with an agent-based Naming Game in which a population that begins with no common vocabulary self-organises a shared language through local pairwise interaction, and we ask how the social network governs the outcome under communication noise and under selection on communicative strategy. The study combines baseline experiments with an extended suite built specifically to meet the standards of replication and statistical inference: every reported quantity is averaged over many independent seeded runs with confidence intervals, and the central claim is tested with a formal interaction statistic. Convergence time scales with population size as a power law with exponent close to four-thirds, matching analytical results for the Naming Game on networks. Restricted networks sustain many coexisting regional dialects, which we quantify with a cluster-based metric and show to be metastable, decaying to a single language as the interaction budget grows. Our central methodological contribution concerns noise robustness. A naive comparison suggests that denser networks simply tolerate more noise, but by comparing topologies at matched mean degree and by sweeping degree directly we separate two effects: connectivity raises robustness with sharply diminishing returns, while at identical degree locally clustered topologies remain significantly less robust than well-mixed ones. The effect of topology therefore survives the removal of the degree confound. Finally, an evolutionary extension shows that selection for communicative success drives inventiveness towards a low level that a frequency-dependent reward for useful innovation raises only slightly, so conservatism is robust rather than an artefact of the fitness function.
A NetLogo 3D 7.0 model of a market with several floors. Buyers walk, keep their distance from one another, choose among the stalls they can see and change floors. Social proof acts on where buyers go (attraction) and on whether they buy (conversion), and crowding lowers the chance of a purchase. The model tests whether social proof is sufficient to congest such a market and separates the roles of influence, layout and local density. The archive contains the model with every BehaviorSpace experiment of the companion paper, all simulation outputs, the pre-analysis plan, an ODD+D description and the Python code that reproduces every reported number, table and figure.
An agent-based model of one community whose members meet every week. Members decide whether to attend the community’s gatherings, meet partners there, reveal or withhold their views on two topics, and judge each partner as “like me” or as one of “those people”. Views move toward accepted voices and are held by each member’s starting view. Each conversation has a feeling, which updates the member’s warmth toward her own side and toward the other side and strengthens or weakens the tie between the two partners; ties decide belonging, and belonging decides attendance. Listening enters as one trait, conversational receptiveness. The release includes the BehaviorSpace setup file and the output of every run reported in the accompanying paper.
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.
Replication package for a network diffusion model of how Protestant belief spreads through a
signed social network, used to compare three versions of balance theory.
Artificial Anasazi is an agent-based model of farming households in the Long House Valley, Arizona, from 800 to 1350 CE. Each household chooses where to farm and settle based on expected harvest, water sources and stored maize, and simulated household counts are compared with the archaeological record.
This release adapts the NetLogo Models Library version (Stonedahl & Wilensky 2010) of Janssen’s (2009) NetLogo replication of the original Ascape model (Dean et al. 2000; Axtell et al. 2002). It contains four configurations in one NetLogo 7.0.4 file, selected with two switches:
soil-on?: dynamic soil quality that depletes under cultivation and regrows, following Janssen (2010, eq. 4). An agent-based model in which fourteen European Union member states each carry a cooperation
propensity in [0,1], updated by a logistic link applied to a latent index that combines the unit’s
own previous state, a weighted average of the other units’ states, and four min-max normalised
exogenous indicators (cooperative benefit, opportunistic temptation, systemic exit cost,
intertemporal confidence). The logistic centres are anchored so that the observed 2024
configuration is an exact fixed point of the baseline map, the device that makes such models
…
Agent-based model of cooperation among fourteen EU member states under geopolitical shocks, 2024-2040. States are adaptive agents on the observed intra-EU trade network, updating a cooperation propensity through inertia, network influence, and a repeated-game payoff structure built from verified Eurostat, Eurobarometer and IMF data. An anchoring device makes the observed 2024 configuration exactly stationary absent shocks, so results are read as deviations from an empirical baseline. Five scenarios of increasing severity are simulated with Monte Carlo replication, up to an extreme counterfactual crisis in the Taiwan Strait. Includes six robustness batteries and a full ODD description.
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
…
This is a NetLogo 7.0.1 agent-based model of interdependent team productivity under O-ring production logic. The model asks when collective problem-solving capacity (CPS) improves team output and when its effect is constrained by trust, burnout, specialization diversity, weak-link quality, and team-formation rules. Agents are heterogeneous in skill, CPS, trust, burnout, effort, learning rate, openness, specialization, adaptability, and aspiration. Each tick forms temporary teams, computes individual contribution quality, combines contributions through a geometric O-ring production function with an explicit weakest-link term, records output and success, and updates agents through feedback, learning, trust change, burnout, recovery, and turnover. The paper follows the ODD protocol, reports exact implementation equations, and analyzes six BehaviorSpace experiments with 50 stochastic repetitions per condition. Scenario results show that CPS is beneficial but not sufficient: productivity is highest when CPS is combined with trust, low burnout, effective coordination, and a reliable weakest-link floor. Diversity yields only modest gains at low CPS but larger gains when CPS is high. Formation-mode results are especially informative because mixed CPS-skill formation maximizes total output, whereas random formation has the highest binary success rate, showing that output magnitude and threshold success can diverge. The study contributes a transparent computational mechanism linking collective intelligence with O-ring production and identifies boundary conditions under which high-CPS teams can still be limited by weak links and interdependence.
Displaying 10 of 54 results replication clear search