We provide a full description of the model following the ODD protocol (Grimm et al. 2010) in the attached document. The model is developed in NetLogo 5.0 (Wilenski 1999).

The Simulating Agroforestry Adoption in Rural Indonesia (SAFARI) model aims at exploring the adoption of illipe rubber agroforestry systems by farming households in the case study region in rural Indonesia. Thereby, the ABM simulates the interdependencies of agroforestry systems and local livelihoods, income, land use, biodiversity, and carbon fixation. The model contrasts development paths without agroforestry (business as usual (BAU) scenario), corresponding to a scenario where the government promotes rubber monoculture, with the introduction of illipe rubber agroforestry systems (IRA scenario) as an alternative. It aims to support policy-makers to assess the potential of IRA over larger temporal and spatial scales.

This is a ridesharing model (Uber/Lyft) of the larger Washington DC metro area. The model can be modified (Netlogo 6.x) relatively easily and be adapted to any metro area. Please cite generously (this was a lot of work) and please cite the paper, not the comses model.

Link to the paper published in “Complex Adaptive Systems” here: https://link.springer.com/chapter/10.1007/978-3-030-20309-2_7

Citation: Shaheen J.A.E. (2019) Simulating the Ridesharing Economy: The Individual Agent Metro-Washington Area Ridesharing Model (IAMWARM). In: Carmichael T., Collins A., Hadžikadić M. (eds) Complex Adaptive Systems. Understanding Complex Systems. Springer, Cham. https://doi.org/10.1007/978-3-030-20309-2_7

This model grows land use patterns that emerge as a result of land-use compatibilities stablished in urban development plans, land topography, and street networks. It contains urban brushes to paint streets and land uses as a way to learn about urban pattern emergence through free experimentation.

Agent-based model of hunting behavior of Ache hunter-gatherers from Paraguay. We evaluate the effect of group size and cooperative hunting

Cultural group selection model used to evaluate the conditions for agents to evolve who have other-regarding preferences in making decisions in public good games.

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.

Lakeland 2 is a simple version of the original Lakeland of Jager et al. (2000) Ecological Economics 35(3): 357-380. The model can be used to explore the consequences of different behavioral assumptions on resource and social dynamics.

The model examines the dynamics of herd growth in African pastoral systems. We used it to examine the role of scale (herd size) stochasticity (in mortality, fertility, and offtake) on herd growth.

Both models simulate n-person prisoner dilemma in groups (left figure) where agents decide to C/D – using a stochastic threshold algorithm with reinforcement learning components. We model fixed (single group ABM) and dynamic groups (bad-barrels ABM). The purpose of the bad-barrels model is to assess the impact of information during meritocratic matching. In the bad-barrels model, we incorporated a multidimensional structure in which agents are also embedded in a social network (2-person PD). We modeled a random and homophilous network via a random spatial graph algorithm (right figure).