Computational Model Library

MTC_Model_Pilditch&Madsen

Toby Pilditch | Published Fri Oct 9 11:05:30 2020

Micro-targeted vs stochastic political campaigning agent-based model simulation. Written by Toby D. Pilditch (University of Oxford, University College London), in collaboration with Jens K. Madsen (University of Oxford, London School of Economics)

The purpose of the model is to explore the various impacts on voting intention among a population sample, when both stochastic (traditional) and Micto-targeted campaigns (MTCs) are in play. There are several stages of the model: initialization (setup), campaigning (active running protocols) and vote-casting (end of simulation). The campaigning stage consists of update cycles in which “voters” are targeted and “persuaded” - updating their beliefs in the campaign candidate / policies.

NetLogo model corresponding to the JASSS article “Agent-Based Simulation of West Asian Urban Dynamics: Impact of Refugees”

Classrooms; teachers, students and learning

petertymms | Published Wed Oct 7 10:33:51 2020

This a phenomenon-based model plan. Classroom in school are places when students are supposed to learn and the most often do. But things can go awry, the students can play up and that can result in an unruly class and learning can suffer. This model aims to look at how much students learn according to how good the teacher is a classroom control and how good he or she is at teaching per se.

Peer reviewed B3GET

Kristin Crouse | Published Thu Nov 14 20:07:16 2019 | Last modified Tue Oct 6 20:13:54 2020

B3GET simulates populations of virtual organisms evolving over generations, whose evolutionary outcomes reflect the selection pressures of their environment. The model simulates several factors considered important in biology, including life history trade-offs, investment in fighting ability and aggression, sperm competition, infanticide, and competition over access to food and mates. Downloaded materials include a starting genotype and population files. Edit the these files and see what changes occur in the behavior of virtual populations!

The O.R.E. (Opinions on Risky Events) model describes how a population of interacting individuals process information about a risk of natural catastrophe. The institutional information gives the official evaluation of the risk; the agents receive this communication, process it and also speak to each other processing further the information. The description of the algorithm (as it appears also in the paper) can be found in the attached file OREmodel_description.pdf.
The code (ORE_model.c), written in C, is commented. Also the datasets (inputFACEBOOK.txt and inputEMAILs.txt) of the real networks utilized with this model are available.

For any questions/requests, please write me at [email protected]

HomininSpace

Fulco Scherjon | Published Fri Nov 25 12:00:02 2016 | Last modified Tue Oct 6 11:01:00 2020

A modelling system to simulate Neanderthal demography and distribution in a reconstructed Western Europe for the late Middle Paleolithic.

Peer reviewed Multilevel Group Selection I

Garry Sotnik Thaddeus Shannon Wayne W. Wakeland | Published Tue Apr 21 18:07:27 2020 | Last modified Sat Sep 26 01:41:46 2020

The Multilevel Group Selection I (MGS I) model simulates a population of contributing and non-contributing agents, competing on a social landscape for higher-value spots in an effort to withstand some selection pressure. It may be useful to both scientists and students in hypothesis testing, theory development, or more generally in understanding multilevel group selection.

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.

The model simulates the national Campaign-Based Watershed Management program of Ethiopia. It includes three agents (farmers, Kebele/ village administrator, extension workers) and the physical environment that interact with each other. The physical environment is represented by patches (fields). Farmers make decisions on the locations of micro-watersheds to be developed, participation in campaign works to construct soil and water conservation structures, and maintenance of these structures. These decisions affect the physical environment or generate model outcomes. The model is developed to explore conditions that enhance outcomes of the program by analyzing the effect on the area of land covered and quality of soil and water conservation structures of (1) enhancing farmers awareness and motivation, (2) establishing and strengthening micro-watershed associations, (3) introducing alternative livelihood opportunities, and (4) enhancing the commitment of local government actors.

Peer reviewed MGA - Minimal Genetic Algorithm

Cosimo Leuci | Published Tue Sep 3 07:52:29 2019 | Last modified Thu Jan 30 08:42:08 2020

Genetic algorithms try to solve a computational problem following some principles of organic evolution. This model has educational purposes; it can give us an answer to the simple arithmetic problem on how to find the highest natural number composed by a given number of digits. We approach the task using a genetic algorithm, where the candidate solutions to the problem are represented by agents, that in logo programming environment are usually known as “turtles”.

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.