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 159 results for "Sean F Reardon" clear search

Peer Review Model

Flaminio Squazzoni Claudio Gandelli | Published Wednesday, September 05, 2012 | Last modified Saturday, April 27, 2013

This model looks at implications of author/referee interaction for quality and efficiency of peer review. It allows to investigate the importance of various reciprocity motives to ensure cooperation. Peer review is modelled as a process based on knowledge asymmetries and subject to evaluation bias. The model includes various simulation scenarios to test different interaction conditions and author and referee behaviour and various indexes that measure quality and efficiency of evaluation […]

Peer reviewed STiMUS: A Stigmergic–Mutualistic Agent-Based Model of Teamwork on Shared Digital Artefacts (IMOI)

Yevgeny Patarakin | Published Friday, July 03, 2026 | Last modified Wednesday, July 22, 2026

STiMUS (Stigmergic–Mutualistic IMOI Model) is an agent-based model of teamwork in socio-technical systems where contributors collaborate through shared digital artefacts — wiki pages, code files, issue tickets, project cards, Scratch projects — represented as patches in a NetLogo world. The model integrates two coordination mechanisms. Stigmergy is indirect coordination through traces left in a shared environment: each edit deposits a pheromone that diffuses to neighbouring patches and evaporates over time, so recent activity attracts further contributions. Mutualism is a reciprocal benefit loop in which valuable, well-maintained artefacts raise contributor motivation and shared understanding, while motivated contributors improve artefacts.

Contributors (turtles of the contributor breed) carry individual state: skill, motivation, shared-mental-model, specialty, benefit-gain, and an explicit-mode flag. At each tick every contributor selects a target artefact with an ant-colony-optimization-style rule weighing the artefact’s pheromone, incompleteness (1 - completeness), resource-value, and topic match between specialty and the artefact’s topic-tag; with probability p-explicit it instead takes the patch with the highest maintenance-need, modelling explicit task assignment. Each edit increases pheromone, quality, completeness and reuse-count, raises resource-value, lowers maintenance-need, and appends the editor to the artefact’s edit-authors list. When the previous last-editor-id differs from the current editor, the Edit Succession Ratio rises, the editor’s shared-mental-model grows, and a co-editing link is created — operationalising the idea that repeated cross-author succession on the same artefact builds shared understanding. Contributors’ motivation is updated from the benefit drawn from the visited artefact.

Each patch maintains a stigmergic layer (pheromone, quality, completeness, recentness, last-editor-id, edit-count, edit-authors) and a mutualistic layer (resource-value, reuse-count, maintenance-need, topic-tag), plus task flags (is-task?, task-complexity). Global monitors report the Edit Succession Ratio (ESR = cross-author-edits / total-edits, and an alternative esr-value = share of edited patches with more than one distinct author), mean-quality, mean-resource-value, a mutualism-index averaging contributor benefit and resource value, coediting-density (network density of the co-editing graph), active-pages-share, and task-completion-rate. The model logs every edit as a bipartite edge (tick, author_id, pageid, specialty, topic_tag, quality), exportable to CSV.

What is stable: the large but coordinated change during a diffusion or the small but constant and uncoordinated changes during a dynamic equilibrium? This agent-based model of a diffusion creates output that reveal insights for system stability.

The Non-Deterministic model of affordable housing Negotiations (NoD-Neg) is designed for generating hypotheses about the possible outcomes of negotiating affordable housing obligations in new developments in England. By outcomes we mean, the probabilities of failing the negotiation and/or the different possibilities of agreement.
The model focuses on two negotiations which are key in the provision of affordable housing. The first is between a developer (DEV) who is submitting a planning application for approval and the relevant Local Planning Authority (LPA) who is responsible for reviewing the application and enforcing the affordable housing obligations. The second negotiation is between the developer and a Registered Social Landlord (RSL) who buys the affordable units from the developer and rents them out. They can negotiate the price of selling the affordable units to the RSL.
The model runs the two negotiations on the same development project several times to enable agents representing stakeholders to apply different negotiation tactics (different agendas and concession-making tactics), hence, explore the different possibilities of outcomes.
The model produces three types of outputs: (i) histograms showing the distribution of the negotiation outcomes in all the simulation runs and the probability of each outcome; (ii) a data file with the exact values shown in the histograms; and (iii) a conversation log detailing the exchange of messages between agents in each simulation run.

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.

Neolithic Spread Model Version 1.0

Sean Bergin Salvador Pardo Gordo Joan Bernabeu Auban Michael Barton | Published Thursday, December 11, 2014 | Last modified Monday, December 31, 2018

This model simulates different spread hypotheses proposed for the introduction of agriculture on the Iberian peninsula. We include three dispersal types: neighborhood, leapfrog, and ideal despotic distribution (IDD).

Income and Expenditure

Tony Lawson | Published Thursday, October 06, 2011 | Last modified Saturday, April 27, 2013

How do households alter their spending patterns when they experience changes in income? This model answers this question using a random assignment scheme where spending patterns are copied from a household in the new income bracket.

Shellmound Mobility

Henrique de Sena Kozlowski | Published Saturday, June 15, 2024

Least Cost Path (LCP) analysis is a recurrent theme in spatial archaeology. Based on a cost of movement image, the user can interpret how difficult it is to travel around in a landscape. This kind of analysis frequently uses GIS tools to assess different landscapes. This model incorporates some aspects of the LCP analysis based on GIS with the capabilities of agent-based modeling, such as the possibility to simulate random behavior when moving. In this model the agent will travel around the coastal landscape of Southern Brazil, assessing its path based on the different cost of travel through the patches. The agents represent shellmound builders (sambaquieiros), who will travel mainly through the use of canoes around the lagoons.

How it works?
When the simulation starts the hiker agent moves around the world, a representation of the lagoon landscape of the Santa Catarina state in Southern Brazil. The agent movement is based on the travel cost of each patch. This travel cost is taken from a cost surface raster created in ArcMap to represent the different cost of movement around the landscape. Each tick the agent will have a chance to select the best possible patch to move in its Field of View (FOV) that will take it towards its target destination. If it doesn’t select the best possible patch, it will randomly choose one of the patches to move in its FOV. The simulation stops when the hiker agent reaches the target destination. The elevation raster file and the cost surface map are based on a 1 Arc-second (30m) resolution SRTM image, scaled down 5 times. Each patch represents a square of 150m, with an area of 0,0225km². The dataset uses a UTM Sirgas 2000 22S projection system. There are four different cost functions available to use. They change the cost surface used by the hikers to navigate around the world.

Shellmound Trade

Henrique de Sena Kozlowski | Published Saturday, June 15, 2024

This model simulates different trade dynamics in shellmound (sambaqui) builder communities in coastal Southern Brazil. It features two simulation scenarios, one in which every site is the same and another one testing different rates of cooperation. The purpose of the model is to analyze the networks created by the trade dynamics and explore the different ways in which sambaqui communities were articulated in the past.

How it Works?
There are a few rules operating in this model. In either mode of simulation, each tick the agents will produce an amount of resources based on the suitability of the patches inside their occupation-radius, after that the procedures depend on the trade dynamic selected. For BRN? the agents will then repay their owed resources, update their reputation value and then trade again if they need to. For GRN? the agents will just trade with a connected agent if they need to. After that the agents will then consume a random amount of resources that they own and based on that they will grow (split) into a new site or be removed from the simulation. The simulation runs for 1000 ticks. Each patch correspond to a 300x300m square of land in the southern coast of Santa Catarina State in Brazil. Each agent represents a shellmound (sambaqui) builder community. The data for the world were made from a SRTM raster image (1 arc-second) in ArcMap. The sites can be exported into a shapefile (.shp) vector to display in ArcMap. It uses a UTM Sirgas 2000 22S projection system.

A simplified Arthur & Polak logic circuit model of combinatory technology build-out via incremental development. Only some inventions trigger radical effects, suggesting they depend on whole interdependent systems rather than specific innovations.

Displaying 10 of 159 results for "Sean F Reardon" 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