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 198 results for "J%C3%BCrgen%20Scheffran" clear search
Considering that two of the three avoider species could not reach the target area in the inittial scenario, five alternative corridor scenarios were created. In all cases, we generated a greater amount of cover area under ‘Urban forest’, including elements such as scattered trees, woody plants, wooded areas, and rows of trees. This covered type was selected since all three species use it as a regular habitat. That is the second sceneario where those ecological parks and other areas inside the capital city were boostered into “urban forest patches” or buffer points, with the idea of improving the survive of the three bird species and their movement. However one of the most restrictive specie was still having movement and survival issues.
The Garbage Can Model of Organizational Choice (GCM) is a fundamental model of organizational decision-making originally propossed by J.D. Cohen, J.G. March and J.P. Olsen in 1972. In their model, decisions are made out of random meetings of decision-makers, opportunities, solutions and problems within an organization.
With this model, these very same agents are supposed to meet in society at large where they make decisions according to GCM rules. Furthermore, under certain additional conditions decision-makers, opportunities, solutions and problems form stable organizations. In this artificial ecology organizations are born, grow and eventually vanish with time.
The purpose of the model is to generate coalition structures of different glove games, using a specially designed algorithm. The coalition structures can be are later analyzed by comparing them to core partitions of the game used. Core partitions are coalition structures where no subset of players has an incentive to form a new coalition.
The algorithm used in this model is an advancement of the algorithm found in Collins & Frydenlund (2018). It was used used to generate the results in Vernon-Bido & Collins (2021).
An ABM, derived from a case study and a series of surveys with greenhouse growers in the Westland, Netherlands. Experiments using this model showshow that the greenhouse horticulture industry displays diversity, adaptive complexity and an uneven distribution, which all suggest that the industry is an evolving system.
This model simulates a foraging system based on Middle Stone Age plant and shellfish foraging in South Africa.
Provided is a landscape of properties where pastoralists make decisions how much livestock they put on their property and how much to suppress fire from occuring. Rangelands can be grass dominated, or unproductive shrubb dominated. Overgrazing and fire suppresion lead to shrub dominated landscapes. What management strategies evolve, and how is this impacted by policies?
The model is discussed in Introduction to Agent-Based Modeling by Marco Janssen. For more information see https://intro2abm.com/.
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). This model is an agent-based simulation written in Python 2.7, which simulates the cost of social care in an ageing UK population. The simulation incorporates processes of population change which affect the demand for and supply of social care, including health status, partnership formation, fertility and mortality. Fertility and mortality rates are drawn from UK population data, then projected forward to 2050 using the methods developed by Lee and Carter 1992.
The model demonstrates that rising life expectancy combined with lower birthrates leads to growing social care costs across the population. More surprisingly, the model shows that the oft-proposed intervention of raising the retirement age has limited utility; some reductions in costs are attained initially, but these reductions taper off beyond age 70. Subsequent work has enhanced and extended this model by adding more detail to agent behaviours and familial relationships.
The version of the model provided here produces outputs in a format compatible with the GEM-SA uncertainty quantification software by Kennedy and O’Hagan. This allows sensitivity analyses to be performed using Gaussian Process Emulation.
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.
…
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 198 results for "J%C3%BCrgen%20Scheffran" clear search