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.

This is an interdisciplinary agent-based model with Monte Carlo simulations to assess the relative effects of broadcast and contagion processes in a multiplex social network. This multiplex approach models multiple channels of informal communication - phone, word-of-mouth, and social media - that vary in their attribute values. Each agent is an individual in a threatened community who, once warned, has a probability of warning others in their social network using one of these channels. The probability of an individual warning others is based on their warning source and the time remaining until disaster impact, among other variables. Default parameter values were chosen from empirical studies of disaster warnings along with the spatial aspects of Coos Bay, OR, USA and Seaside, OR, USA communities.

Routes & Rumours is an agent-based model of (forced) human migration. We model the formation of migration routes under the assumption that migrants have limited geographical knowledge concerning the transit area and rely to a large degree on information obtained from other migrants.

A demonstration model showing how modellers can create a multi regional tram network with commuters, destinations and houses. The model offers options to create a random tram network made from modeller input or to load shapefiles for the Greater Manchester Metrolink.

The model uses NetLogo with gis, nw an csv extensions.

We study the impact of endogenous creation and destruction of social ties in an artificial society on aggregate outcomes such as generalized trust, willingness to cooperate, social utility and economic performance. To this end we put forward a computational multi-agent model where agents of overlapping generations interact in a dynamically evolving social network. In the model, four distinct dimensions of individuals’ social capital: degree, centrality, heterophilous and homophilous interactions, determine their generalized trust and willingness to cooperate, altogether helping them achieve certain levels of social utility (i.e., utility from social contacts) and economic performance. We find that the stationary state of the simulated social network exhibits realistic small-world topology. We also observe that societies whose social networks are relatively frequently reconfigured, display relatively higher generalized trust, willingness to cooperate, and economic performance – at the cost of lower social utility. Similar outcomes are found for societies where social tie dissolution is relatively weakly linked to family closeness.

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,
…

This model converts cleaned up versions of .pgn files (records of real chess games) and conversts them into files that record all of the events and “possible” events within a game of chess. This is intended to be a way to create sets of data that capture event sequences within the relatively complex but finite context of chess games as a proxy or “toy” data set. Although not a perfect correlation, these toy data sets are a first step in analysing complex and dynamic systems of events and possible events that happen in the real world.

This is an agent-based model that allows to test alternative designs for three model components. The model was built using the LUDAS design strategy, while each alternative is in line with the strategy. Using the model, it can be shown that alternative designs, though built on the same strategy, lead to different land-use patterns over time.

This is a simple model replicating Hardin’s Tragedy of the Commons using reactive agents that have psychological behavioral and social preferences.

MASTOC is a replication of the Tragedy of the Commons by G. Hardin, programmed in NetLogo 4.0.4, based on behavioral game theory and Nash solution.