Computational Model Library

Displaying 10 of 170 results for "Wil Hennen" clear search

Replicating the Macy & Sato Model: Trust, Cooperation and Market Formation in the U.S. and Japan

Oliver Will | Published Saturday, August 29, 2009 | Last modified Saturday, April 27, 2013

A replication of the model “Trust, Cooperation and Market Formation in the U.S. and Japan” by Michael W. Macy and Yoshimichi Sato.

Peer reviewed MOOvPOPsurveillance

Aniruddha Belsare Matthew Gompper Joshua J Millspaugh | Published Tuesday, April 04, 2017 | Last modified Tuesday, May 12, 2020

MOOvPOPsurveillance was developed as a tool for wildlife agencies to guide collection and analysis of disease surveillance data that relies on non-probabilistic methods like harvest-based sampling.

Roman Amphora reuse

Tom Brughmans | Published Wednesday, August 07, 2019 | Last modified Wednesday, March 15, 2023

UPDATE in V1.1.0: missing input data files added; relative paths to input data files changed to “../data/FILENAME”

A model that allows for representing key theories of Roman amphora reuse, to explore the differences in the distribution of amphorae, re-used amphorae and their contents.

This model generates simulated distributions of prime-use amphorae, primeuse contents (e.g. olive oil) and reused amphorae. These simulated distributions will differ between experiments depending on the experiment’s variable settings representing the tested theory: variations in the probability of reuse, the supply volume, the probability of reuse at ports. What we are interested in teasing out is what the effect is of each theory on the simulated amphora distributions.

This program was developed to simulate monogamous reproduction in small populations (and the enforcement of the incest taboo).

Every tick is a year. Adults can look for a mate and enter a relationship. Adult females in a Relationship (under the age of 52) have a chance to become pregnant. Everyone becomes not alive at 77 (at which point people are instead displayed as flowers).

User can select a starting-population. The starting population will be adults between the ages of 18 and 42.

WeDiG Sim

Reza Shamsaee | Published Monday, May 14, 2012 | Last modified Saturday, April 27, 2013

WeDiG Sim- Weighted Directed Graph Simulator - is an open source application that serves to simulate complex systems. WeDiG Sim reflects the behaviors of those complex systems that put stress on scale-free, weightedness, and directedness. It has been implemented based on “WeDiG model” that is newly presented in this domain. The WeDiG model can be seen as a generalized version of “Barabási-Albert (BA) model”. WeDiG not only deals with weighed directed systems, but also it can handle the […]

ADAM: Agent-based Demand and Assignment Model

D Levinson | Published Monday, August 29, 2011 | Last modified Saturday, April 27, 2013

The core algorithm is an agent-based model, which simulates travel patterns on a network based on microscopic decision-making by each traveler.

Telephone Game

Julia Kasmire | Published Friday, January 10, 2020

This is a model of a game of Telephone (also known as Chinese Whishpers in the UK), with agents representing people that can be asked, to play. The first player selects a word from their internal vocabulary and “whispers” it to the next player, who may mishear it depending on the current noise level, who whispers that word to the next player, and so on.

When the game ends, the word chosen by the first player is compared to the word heard by the last player. If they match exactly, all players earn large prize. If the words do not match exactly, a small prize is awarded to all players for each part of the words that do match. Players change color to reflect their current prize-count. A histogram shows the distribution of colors over all the players.

The user can decide on factors like
* how many players there are,

Agent-based Simulation of Time Management

Hang Xiong | Published Thursday, March 24, 2016 | Last modified Friday, March 25, 2016

This model simulates how the strategy one manages time affect the well-being that he/she can obtain.

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.

Evolution of cooperation with strangers

Marco Janssen | Published Friday, October 15, 2010 | Last modified Wednesday, November 13, 2013

The model is used to study the conditions under which agents will cooperate in one-shot two-player Prisoner’s Dilemma games if they are able to withdraw from playing the game and can learn to recogniz

Displaying 10 of 170 results for "Wil Hennen" 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