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 549 results for "Mark Orr" clear search

Patch choice model from Optimal Foraging Theory (Human Behavioral Ecology)

C Michael Barton | Published Saturday, November 22, 2008 | Last modified Saturday, April 27, 2013

NetLogo model of patch choice model from optimal foraging theory (human behavioral ecology).

Cyberworld 1

Dmitry Brizhinev Nathan Ryan Roger Bradbury | Published Thursday, April 23, 2015 | Last modified Sunday, February 25, 2018

A Repast Simphony model of interactions (conflict and cooperation) between states

Consumats on a network

Marco Janssen | Published Tuesday, January 14, 2020 | Last modified Sunday, June 28, 2026

Consumer agents make choices which products to choose using the consumat approach. In this approach agents will make choices using deliberation, repetition, imitation or social comparison dependent on the level of need satisfaction and uncertainty.
The model is discussed in Introduction to Agent-Based Modeling by Marco Janssen. For more information see https://intro2abm.com/

Oneshot negotiation in Colored Trails

Harmen de Weerd | Published Tuesday, April 09, 2019

This model allows for oneshot negotiations in the Colored Trails setting. Two allocator agents simultaneously make an offer to a responder agent, who chooses which of these offers to accept, or to reject both offers. The code allows for allocator allocator agents of different orders of theory of mind reasoning to play against one another.

MERCURY: an ABM of tableware trade in the Roman East

Tom Brughmans Jeroen Poblome | Published Thursday, September 25, 2014 | Last modified Friday, May 01, 2015

MERCURY aims to represent and explore two descriptive models of the functioning of the Roman trade system that aim to explain the observed strong differences in the wideness of distributions of Roman tableware.

cultural group and persistent parochialism

Jae-Woo Kim | Published Monday, November 08, 2010 | Last modified Saturday, April 27, 2013

Discriminators who have limited tolerance for helping dissimilar others are necessary for the evolution of costly cooperation in a one-shot Prisoner’s Dilemma. Existing research reports that trust in

This ABM re-implements and extends the simulation model of peer review described in Squazzoni & Gandelli (Squazzoni & Gandelli, 2013 - doi:10.18564/jasss.2128) (hereafter: ‘SG’). The SG model was originally developed for NetLogo and is also available in CoMSES at this link.
The purpose of the original SG model was to explore how different author and reviewer strategies would impact the outcome of a journal peer review system on an array of dimensions including peer review efficacy, efficiency and equality. In SG, reviewer evaluation consists of a continuous variable in the range [0,1], and this evaluation scale is the same for all reviewers. Our present extension to the SG model allows to explore the consequences of two more realistic assumptions on reviewer evaluation: (1) that the evaluation scale is discrete (e.g. like in a Likert scale); (2) that there may be differences among their interpretation of the grades of the evaluation scale (i.e. that the grade language is heterogeneous).

Co-operative Autonomy

Hani Mohammed Subu Kandaswamy | Published Saturday, April 24, 2021

This model presents an autonomous, two-lane driving environment with a single lane-closure that can be toggled. The four driving scenarios - two baseline cases (based on the real-world) and two experimental setups - are as follows:

  • Baseline-1 is where cars are not informed of the lane closure.
  • Baseline-2 is where a Red Zone is marked wherein cars are informed of the lane closure ahead.
  • Strategy-1 is where cars use a co-operative driving strategy - FAS. <sup>[1]</sup>
  • Strategy-2 is a variant of Strategy-1 and uses comfortable deceleration values instead of the vehicle’s limit.
    …

We study cultural dissemination in the context of an Axelrod-like agent-based model describing the spread of cultural traits across a society, with an added element of social influence. This modification produces absorbing states exhibiting greater variation in number and size of distinct cultural regions compared to the original Axelrod model, and we identify the mechanism responsible for this amplification in heterogeneity. We develop several new metrics to quantitatively characterize the heterogeneity and geometric qualities of these absorbing states. Additionally, we examine the dynamical approach to absorbing states in both our Social Influence Model as well as the Axelrod Model, which not only yields interesting insights into the differences in behavior of the two models over time, but also provides a more comprehensive view into the behavior of Axelrod’s original model. The quantitative metrics introduced in this paper have broad potential applicability across a large variety of agent-based cultural dissemination models.

Intra-Organizational Bandwagon

Davide Secchi | Published Sunday, October 18, 2015

The model simulates the process of widespread diffusion of something due to popularity (i.e., bandwagon) within an organization.

Displaying 10 of 549 results for "Mark Orr" 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