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 123 results Python clear search
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.
Why do career outcomes in organizations follow highly skewed distributions when the individual traits presumed to drive success — competence, effort, and social skill — are approximately normally distributed in the population? This agent-based model investigates the relative contributions of individual attributes versus random events (“luck”) to career outcomes in hierarchically structured organizations.
The model places 500 agents in a five-level pyramid-shaped organization over 80 six-month evaluation periods (40 simulated years). Each agent is characterized by four attributes drawn from normal distributions at initialization: competence, effort, social skill, and adaptability. In each period, agents may encounter stochastic career events (good or bad projects, supportive or poor managers, market booms or busts), which modify their performance and visibility scores. Promotion decisions are made competitively when vacancies arise at higher levels, using a weighted combination of recent performance, accumulated visibility, network position, and tenure. Social connections form and decay through a proximity-based model influenced by agents’ social skills.
The model extends the talent-versus-luck framework of Pluchino et al. (2018) in four substantive directions: (1) it embeds agents in a hierarchical organization with finite positions at each level, making promotion a zero-sum competition rather than an abstract encounter with random events; (2) it represents individual differences along four independent attribute dimensions rather than a single talent score; (3) it incorporates dynamic social network formation that mediates access to career-relevant opportunities; and (4) it implements the Peter Principle mechanism through which promoted agents must acquire competence appropriate to their new role.
…
SERDUX-MARCIM simulates the propagation of a cyberattack over the computational network of an organization in the maritime sector, at the strategic level of decision-making. It is the instantiation of ABM-MARCIM, the agent-based model of the MARCIM framework for the modeling and simulation of maritime cyberdefense.
Every computational asset of the target organization – servers, endpoints, routers, gateways, vessel systems, radars – is an agent that occupies one of six states at each time step: Susceptible, Exposed, Resistant, Degraded, Unavailable or Destroyed, the initials of which give the model its name. The states Degraded, Unavailable and Destroyed are associated with the D5 cyberattack effects (disrupt, degrade, deny, destroy, deceive) as a function of the degree and the duration of the attack. Thirteen transitions between states are admissible.
Unlike a conventional agent-based model, the local update function is not an individual behavioral rule. It is a system of six ordinary differential equations with eight time-dependent transition rates – propagation, cyberattack (degraded), cyberattack (unavailable), cyberattack (destroyed), recovery, sanitation, loss of resistance, and unavailability by other causes. The values of those rates derive from the capabilities of the target organization, the capabilities of the attacker, and the degree and duration of the cyberattack, computed through a cyber risk approach aligned with the OWASP Risk Rating Methodology, the ISACA categorization of security controls and the IMO Guidelines on Maritime Cyber Risk Management.
…
An agent-based model of rule-governed (religious) communities in which networked agents observe one another’s conduct, sanction deviation,
and decide whether to remain. The model separates two structural conditions for durable capture. First, whether an enforcement apparatus
activates: agents punish deviation only where conduct is observable (the code-geometry parameter sigma) and where sanctioning is
institutionally rewarded (pi), a joint threshold in which neither condition alone suffices. Second, whether members’ exit is foreclosed: an
outside-option degradation (delta) that can be imposed exogenously or allowed to drift with enforcement activity. Punishment concentrates in
a small, endogenously recomputed enforcer cadre, but that concentration is produced by an institutional privilege bundle (a punishment
…
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.
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.
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 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.
Agent-based model simulating 60 undergraduate CS students over 8 semesters to investigate how differential AI tool access affects academic inequality, performance distributions, and dependency formation. Implements a three-phase AI dependency mechanism (effort reduction, metacognitive miscalibration, capability erosion) under five policy scenarios with a 4,050-run parameter sensitivity sweep.
An empirically calibrated agent-based model of cooperation among 14 EU member states. Adaptive state-agents update their cooperation propensity through behavioural inertia, influence along the observed intra-EU trade network (IMF bilateral flows), and repeated-game payoff indicators built from verified Eurostat, Eurobarometer and IMF data (2021-2024). An anchored logistic mapping makes the observed configuration stationary in the absence of shocks, so outcomes read as deviations from the empirical baseline. The model stress-tests European cooperation to 2040 under five scenarios of increasing severity, from a baseline to a Taiwan Strait crisis counterfactual, with 1,000 Monte Carlo replications and a full sensitivity suite (one-factor-at-a-time, joint parameter sampling, breaking-point analysis, alternative functional form). Documented with the ODD protocol; self-testing and fully reproducible under fixed seeds.
Displaying 10 of 123 results Python clear search