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 1163 results for "Bin-Tzong Chi" clear search

Adoption as a social marker

Paul Smaldino | Published Monday, October 17, 2016

A model of innovation diffusion in a structured population with two groups who are averse to adopting a produce popular with the outgroup.

Peer reviewed MigrAgent

Wander Jager Rocco Paolillo | Published Friday, October 05, 2018 | Last modified Wednesday, November 28, 2018

MigrAgent simulates migration flows of a population from a home country to a host country and mutual adaptation of a migrant and local population post-migration. Agents accept interactions in intercultural networks depending on their degree of conservatism. Conservatism is a group-level parameter normally distributed within each ethnic group. Individual conservatism changes as function of reciprocity of interaction in intergroup experiences of acceptance or rejection.

The aim of MigrAgent is to unfold different outcomes of integration, assimilation, separation and marginalization in terms of networks as effect of different degrees of conservatism in each group and speed of migration flows.

Replication of an agent-based model using the Replication Standard

Derek Robinson Jiaxin Zhang | Published Sunday, January 20, 2019 | Last modified Saturday, July 18, 2020

This model is a replication model which is constructed based on the existing model used by the following article:
Brown, D.G. and Robinson, D.T., 2006. Effects of heterogeneity in residential preferences on an agent-based model of urban sprawl. Ecology and society, 11(1).
The original model is called SLUCE’s Original Model for Experimentation (SOME). In Brown and Robinson (2006)’s article, the SOME model was used to explore the impacts of heterogeneity in residential location selections on the research of urban sprawl. The original model was constructed using Objective-C language based on SWARM platform. This replication model is built by NetLogo language on NetLogo platform. We successfully replicate that model and demonstrated the reliability and replicability of it.

ViSA 2.0.0 is an updated version of ViSA 1.0.0 aiming at integrating empirical data of a new use case that is much smaller than in the first version to include field scale analysis. Further, the code of the model is simplified to make the model easier and faster. Some features from the previous version have been removed.
It simulates decision behaviors of different stakeholders showing demands for ecosystem services (ESS) in agricultural landscape. It investigates conditions and scenarios that can increase the supply of ecosystem services while keeping the viability of the social system by suggesting different mixes of initial unit utilities and decision rules.

The Garbage Can Model - old version

Guido Fioretti | Published Saturday, June 22, 2013

We reconstruct Cohen, March and Olsen’s Garbage Can model of organizational choice as an agent-based model. We add another means for avoiding making decisions: buck-passing difficult problems to colleagues.

Mobility USA (MUSA)

Giangiacomo Bravo Davide Natalini | Published Sunday, December 08, 2013 | Last modified Monday, December 30, 2013

MUSA is an ABM that simulates the commuting sector in USA. A multilevel validation was implemented. Social network with a social-circle structure included. Two types of policies have been tested: market-based and preference-change.

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 Agent-Based Model is designed to simulate how similarity-based partner selection (homophily) shapes the formation of co-offending networks and the diffusion of skills within those networks. Its purpose is to isolate and test the effects of offenders’ preference for similar partners on network structure and information flow, under controlled conditions.

In the model, offenders are represented as agents with an individual attribute and a set of skills. At each time step, agents attempt to select partners based on similarity preference. When two agents mutually select each other, they commit a co-offense, forming a tie and exchanging a skill. The model tracks the evolution of network properties (e.g., density, clustering, and tie strength) as well as the spread of skills over time.

This simple and theoretical model does not aim to produce precise empirical predictions but rather to generate insights and test hypotheses about the trade-off between partnership stability and information diffusion. It provides a flexible framework for exploring how changes in partner selection preferences may lead to differences in criminal network dynamics. Although the model was developed to simulate offenders’ interactions, in principle, it could be applied to other social processes involving social learning and skills exchange.

We seek to improve understanding of roles enzyme play in soil food webs. We created an agent-based simulation of a simple food web that includes enzymatic activity. The model was used in a publication, Moore et al. (in press; Biochemistry).

The model implements a double auction financial markets with two types of agents: rational and noise. The model aims to study the impact of different compensation structure on the market stability and market quantities as prices, volumes, spreads.

Displaying 10 of 1163 results for "Bin-Tzong Chi" 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