Computational Model Library

Displaying 10 of 997 results for "Rolf Anker Ims" clear search

NetPlop is a presentation editor built entirely in NetLogo, an agent-based modelling environment. The NetPlop Editor includes a variety of tools to design slide decks, and the Viewer allows these decks to be dis-played to an enraptured audience. A key feature of NetPlop is the ability to embed agent-based models. NetPlop was developed for SIGBOVIK 2021.

TRAINING AND TURNOVER

Kehinde Salau | Published Tuesday, December 16, 2008 | Last modified Saturday, April 27, 2013

The purpose of the model presented by Glance et al is to study the ‘contribute vs. free-ride’ dilemma present in organizations.

Hominin ecodynamics v.2

C Michael Barton | Published Monday, September 19, 2011 | Last modified Friday, March 28, 2014

Simulates biobehavioral interactions between 2 populations of hominins.

Peer reviewed Hominin ecodynamics v.1

C Michael Barton | Published Saturday, October 01, 2011 | Last modified Friday, March 28, 2014

Biobehavioral interactions between two populations under different movement strategies.

This model was developed to test the usability of evolutionary computing and reinforcement learning by extending a well known agent-based model. Sugarscape (Epstein & Axtell, 1996) has been used to demonstrate migration, trade, wealth inequality, disease processes, sex, culture, and conflict. It is on conflict that this model is focused to demonstrate how machine learning methodologies could be applied.

The code is based on the Sugarscape 2 Constant Growback model, availble in the NetLogo models library. New code was added into the existing model while removing code that was not needed and modifying existing code to support the changes. Support for the original movement rule was retained while evolutionary computing, Q-Learning, and SARSA Learning were added.

This model uses ’satisficing’ as a model for farmers’ decision making to learn about influences of alternative decision-making models on simulation results and to exemplify a way to transform a rather theoretical concept into a feasible decision-making model for agent-based farming models.

A model of circular migration

Anna Klabunde | Published Wednesday, August 07, 2013 | Last modified Wednesday, February 17, 2016

An empirically validated agent-based model of circular migration

A haystack-style model of group selection to capture the essential features of colony foundation for queens of the ant based on observation of the ant Pogonomyrmex californicus.

Peer reviewed An extended replication of Abelson's and Bernstein's community referendum simulation

Klaus G. Troitzsch | Published Friday, October 25, 2019 | Last modified Friday, August 25, 2023

This is an extended replication of Abelson’s and Bernstein’s early computer simulation model of community referendum controversies which was originally published in 1963 and often cited, but seldom analysed in detail. This replication is in NetLogo 6.3.0, accompanied with an ODD+D protocol and class and sequence diagrams.

This replication replaces the original scales for attitude position and interest in the referendum issue which were distributed between 0 and 1 with values that are initialised according to a normal distribution with mean 0 and variance 1 to make simulation results easier compatible with scales derived from empirical data collected in surveys such as the European Value Study which often are derived via factor analysis or principal component analysis from the answers to sets of questions.

Another difference is that this model is not only run for Abelson’s and Bernstein’s ten week referendum campaign but for an arbitrary time in order that one can find out whether the distributions of attitude position and interest in the (still one-dimensional) issue stabilise in the long run.

Displaying 10 of 997 results for "Rolf Anker Ims" 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