Computational Model Library

Displaying 10 of 110 results for "Michael Barton" clear search

Hierarchy and War

Alan van Beek Michael Z. Lopate | Published Thursday, April 06, 2023

Scholars have written extensively about hierarchical international order, on the one hand, and war on the other, but surprisingly little work systematically explores the connection between the two. This disconnect is all the more striking given that empirical studies have found a strong relationship between the two. We provide a generative computational network model that explains hierarchy and war as two elements of a larger recursive process: The threat of war drives the formation of hierarchy, which in turn shapes states’ incentives for war. Grounded in canonical theories of hierarchy and war, the model explains an array of known regularities about hierarchical order and conflict. Surprisingly, we also find that many traditional results of the IR literature—including institutional persistence, balancing behavior, and systemic self-regulation—emerge from the interplay between hierarchy and war.

An Agent-Based School Choice Matching Model

Connie Wang Weikai Chen Shu-Heng Chen | Published Sunday, February 01, 2015 | Last modified Wednesday, March 06, 2019

This model is to simulate and compare the admission effects of 3 school matching mechanisms, serial dictatorship, Boston mechanism, and Chinese Parallel, under different settings of information released.

The model represents an archetypical fishery in a co-evolutionary social-ecological environment, capturing different dimensions of trust between fishers and fish buyers for the establishment and persistence of self-governance arrangements.

This model computes the guaranteed viability kernel of a model describing the evolution of a population submitted to successive floods.
The population is described by its wealth and its adaptation rate to floods, the control are information campaigns that have a cost but increase the adaptation rate and the expected successive floods belong to given set defined by the maximal high and the minimal time between two floods.

How do bots influence beliefs on social media? Why do beliefs propagated by social bots spread far and wide, yet does their direct influence appear to be limited?

This model extends Axelrod’s model for the dissemination of culture (1997), with a social bot agent–an agent who only sends information and cannot be influenced themselves. The basic network is a ring network with N agents connected to k nearest neighbors. The agents have a cultural profile with F features and Q traits per feature. When two agents interact, the sending agent sends the trait of a randomly chosen feature to the receiving agent, who adopts this trait with a probability equal to their similarity. To this network, we add a bot agents who is given a unique trait on the first feature and is connected to a proportion of the agents in the model equal to ‘bot-connectedness’. At each timestep, the bot is chosen to spread one of its traits to its neighbors with a probility equal to ‘bot-activity’.

The main finding in this model is that, generally, bot activity and bot connectedness are both negatively related to the success of the bot in spreading its unique message, in equilibrium. The mechanism is that very active and well connected bots quickly influence their direct contacts, who then grow too dissimilar from the bot’s indirect contacts to quickly, preventing indirect influence. A less active and less connected bot leaves more space for indirect influence to occur, and is therefore more successful in the long run.

Forager mobility and interaction

L S Premo | Published Thursday, January 10, 2013 | Last modified Saturday, April 27, 2013

This is a relatively simple foraging-radius model, as described first by Robert Kelly, that allows one to quantify the effect of increased logistical mobility (as represented by increased effective foraging radius, r_e) on the likelihood that 2 randomly placed central place foragers will encounter one another within 5000 time steps.

A consumer-demand simulation for Smart Metering tariffs (Innovation Diffusion)

Martin Rixin | Published Thursday, August 18, 2011 | Last modified Saturday, April 27, 2013

An Agent-based model simulates consumer demand for Smart Metering tariffs. It utilizes the Bass Diffusion Model and Rogers´s adopter categories. Integration of empirical census microdata enables a validated socio-economic background for each consumer.

Objective is to simulate policy interventions in an integrated demand-supply model. The underlying demand function links both sides. Diffusion proceeds if interactions distribute awareness (Epidemic effect) and rivalry reduces the market price (Probit effect). Endogeneity is given due to the fact that consumer awareness as well as their willingness-to-pay drives supply-side rivalry. Firm´s entry and exit decisions as well as quantity and price settings are driven by Cournot competition.

9 Maturity levels in Empirical Validation - An innovation diffusion example

Martin Rixin | Published Wednesday, October 19, 2011 | Last modified Saturday, April 27, 2013

Several taxonomies for empirical validation have been published. Our model integrates different methods to calibrate an innovation diffusion model, ranging from simple randomized input validation to complex calibration with the use of microdata.

Peer reviewed Umwelten Ants

Kit Martin | Published Thursday, January 15, 2015 | Last modified Thursday, August 27, 2015

Simulates impacts of ants killing colony mates when in conflict with another nest. The murder rate is adjustable, and the environmental change is variable. The colonies employ social learning so knowledge diffusion proceeds if interactions occur.

Displaying 10 of 110 results for "Michael Barton" 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