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 3 of 3 results Python 3 clear search

This model extends Schelling’s segregation model with mobility sharing. Agents of two groups occupy cells of a 32 × 32 grid and repeatedly choose activity destinations subject to a preference threshold, the minimum share of ingroup neighbours they accept. Trips are matched into shared rides between members of different groups, using one of four matching algorithms on a shareability network (maximal cross-group matching, maximum weight matching on contact time, maximum cardinality matching, or random greedy matching) with a maximum detour constraint. After each trip, an agent’s preference threshold changes with the time spent in contact with outgroup members.

Starting from complete segregation, the model examines under which conditions contact during shared trips leads to integration. Besides the main scenario, in which contact always lowers the threshold, it includes two extensions. In the first, a share of adversarial agents becomes less tolerant with contact, and this share grows or shrinks with the current level of segregation, governed by a branching dissimilarity index and a conversion rate. In the second, each contact raises or lowers the threshold with a probability that depends on the agent’s current attitude relative to a compatibility threshold.

Segregation is measured with the index of dissimilarity and the Gini coefficient. The model file includes BehaviorSpace experiments for each analysis in the associated article. The matching step uses the NetworkX library through the Python extension of NetLogo (requires Python 3 with numpy and networkx 3.x).

This study employs a hierarchical cross-departmental ABM to explore the question: How and to what extent are the land use policies enforced when assessed against the real-world land use pattern? Specifically, two sub-questions are of interest: How can real-world policy interactions be abstracted into the behavior across hierarchical governmental departments in the model? How can the level of enforcement for each land use policy be quantified under these interactions? We build three hierarchical agents—the central level, the local level that incorporates three departments, and the village collective level—with simplified but plausible processes of land use change, with levels of enforcement of different land use policies as key parameters. We calibrate the model using a genetic algorithm to determine those parameters and answer our research question. We further applied the model to simulate potential land use changes and investigate the implications of different policy options. The results are expected to provide insights into the intricate relationships shaping land use processes, contributing to evidence-based decision-making in urban planning and sustainable land use management.

Pastoralscape

Matthew Sottile | Published Tuesday, October 12, 2021

Pastoralscape is a model of human agents, lifestock health and contageous disease for studying the impact of human decision making in pastoral communities within East Africa on livestock populations. It implements an event-driven agent based model in Python 3.

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