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 57 results for "Hosang Shin" clear search

Agent-based Simulation of Time Management

Hang Xiong | Published Thursday, March 24, 2016 | Last modified Friday, March 25, 2016

This model simulates how the strategy one manages time affect the well-being that he/she can obtain.

This is an agent-based model of the implementation of the self-enforcing agreement in cooperative teams.

Diffusion of Innovations on Social Networks

Hang Xiong | Published Saturday, April 16, 2016

This is model that simulates how multiple kinds of peer effects shape the diffusion of innovations through different types of social relationships.

This model played a small part in the UK government’s review of the working of local authority implementation of the Domestic Abuse legislation. The model explicitly represents victim-survivor families as they: (a) try to contact the local DA support system, (b) are triaged by the system and (if there is space) allocated to safe temporary accomodation (c) recieve support services from this position and (d) eventually move on to more permenant accomodation. The purpose of the model was to understand some possible ways in which the implementation of DA Duty, might be frustrated in practice, the identification of gaps in the evidence base and to inform the developing Theory of Change. The key measures used for assessing outcomes in the model were the number of families helped and the services that were delivered to them. The exploration was grounded for in two archetypal cases: that of a relatively immature system for the delivery of DA services and a more mature one (based on actual local authority cases, but not based on any single one). See the official report under associated publications for a summary of results.

ABM model studying impact of social cohesion on wellbeing of a society. Ibn Khaldun’s cyclical theory of history is being used as the theoretical lens along with some other theories. Social cohesion is measured as TSC = (TVE + 2 * (TPI * TPL - TNI * TNL))/((TPI+TNI))
Where
TSC total-social-cohesion ; Variable for social cohesion
TPI total-positive-interactions ; Count of positive interactions
TNI total-negative-interactions ; Count of negative interactions
TPL total-positive-learning ; Count of positive learning outcomes

This is an agent-based model that simulates the structural evolution in food supply chain.

This model simulates how collective self-organisation among individuals that manage irrigation resource collectively.

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.

This is model that explores how a few farmers in a Chinese village, where all farmers are smallholders originally, reach optimal farming scale by transferring in farmland from other farmers in the context of urbanization and aging.

This base model uses an agent-based approach to represent heterogeneous farmers’ trading partners selection among multiple recipients (other farmers, village collectives, and firms). Each period, a potential transfer-out farmer decides whether to transfer based on a net-return versus transaction-cost trade-off; if transferring, the farmer selects the counterparty with the highest expected profit. Meanwhile, social learning—operationalized as logistic accumulation of neighborhood experience—continuously updates uncertainty, which in turn shapes transaction costs and subsequent decisions.

Displaying 10 of 57 results for "Hosang Shin" 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