Computational Model Library

Our mission is to help computational modelers develop, document, and share their computational models in accordance with community standards and good open science and software engineering practices. Model authors can publish their model source code in the Computational Model Library with narrative documentation as well as metadata that supports open science and emerging norms that facilitate software citation, computational reproducibility / frictionless reuse, and interoperability. Model authors can also request private peer review of their computational models. Models that pass peer review receive a DOI once published.

All users of models published in the library must cite model authors when they use and benefit from their code.

Please check out our model publishing tutorial and feel free to contact us if you have any questions or concerns about publishing your model(s) in the Computational Model Library.

Displaying 10 of 1031 results for "J Van Der Beek" clear search

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.

Models the connection between health agency communication, personal protective behaviour (eg vaccination, hand hygiene) and influenza transmission.

Peer reviewed An agent-based model for brain drain

Furkan Gürsoy Bertan Badur | Published Wednesday, March 03, 2021 | Last modified Friday, March 12, 2021

An agent-based model for the emigration of highly-skilled labour.

We hypothesise that there are two main factors that impact the decision and ability to move abroad: desire to maximise individual utility and network effects. Accordingly, several factors play role in brain drain such as the overall economic and social differences between the home and host countries, people’s ability and capacity to obtain good jobs and start a life abroad, the barriers of moving abroad, and people’s social network who are already working abroad.

An Agent-Based Model of Language Contact

Marco Civico | Published Tuesday, July 30, 2019

This model is part of an article that discusses the adoption of a complexity theory approach to study the dynamics of language contact within multilingual communities. The model simulates the dynamics of communication within a community where a minority and a majority group coexist. The individual choice of language for communication is based on a number of simple rules derived from a review of the main literature on the topic of language contact. These rules are then combined with different variables, such as the rate of exogamy of the minority group and the presence of relevant education policies, to estimate the trends of assimilation of the minority group into the majority one. The model is validated using actually observed data from the case of Romansh speakers in the canton of Grisons, Switzerland.

Peer reviewed Flibs'NLogo - An elementary form of evolutionary cognition

Cosimo Leuci | Published Thursday, January 30, 2020 | Last modified Monday, June 15, 2026

Flibs’NLogo implements in NetLogo modelling environment, a genetic algorithm whose purpose is evolving a perfect predictor from a pool of digital creatures constituted by finite automata or flibs (finite living blobs) that are the agents of the model. The project is based on the structure described by Alexander K. Dewdney in “Exploring the field of genetic algorithms in a primordial computer sea full of flibs” from the vintage Scientific American column “Computer Recreations”.
As Dewdney summarized: “Flibs […] attempt to predict changes in their environment. In the primordial computer soup, during each generation, the best predictor crosses chromosomes with a randomly selected flib. Increasingly accurate predictors evolve until a perfect one emerges. A flib […] has a finite number of states, and for each signal it receives (a 0 or a 1) it sends a signal and enters a new state. The signal sent by a flib during each cycle of operation is its prediction of the next signal to be received from the environment”

Schelling and Sakoda prominently proposed computational models suggesting that strong ethnic residential segregation can be the unintended outcome of a self-reinforcing dynamic driven by choices of individuals with rather tolerant ethnic preferences. There are only few attempts to apply this view to school choice, another important arena in which ethnic segregation occurs. In the current paper, we explore with an agent-based theoretical model similar to those proposed for residential segregation, how ethnic tolerance among parents can affect the level of school segregation. More specifically, we ask whether and under which conditions school segregation could be reduced if more parents hold tolerant ethnic preferences. We move beyond earlier models of school segregation in three ways. First, we model individual school choices using a random utility discrete choice approach. Second, we vary the pattern of ethnic segregation in the residential context of school choices systematically, comparing residential maps in which segregation is unrelated to parents’ level of tolerance to residential maps reflecting their ethnic preferences. Third, we introduce heterogeneity in tolerance levels among parents belonging to the same group. Our simulation experiments suggest that ethnic school segregation can be a very robust phenomenon, occurring even when about half of the population prefers mixed to segregated schools. However, we also identify a “sweet spot” in the parameter space in which a larger proportion of tolerant parents makes the biggest difference. This is the case when parents have moderate preferences for nearby schools and there is only little residential segregation. Further experiments are presented that unravel the underlying mechanisms.

The conditional defector strategy can violate the most crucial supporting mechanisms of cooperation.

Ahmed Ibrahim | Published Tuesday, June 07, 2022 | Last modified Sunday, September 28, 2025

Cooperation is essential for all domains of life. Yet, ironically, it is intrinsically vulnerable to exploitation by cheats. Hence, an explanatory necessity spurs many evolutionary biologists to search for mechanisms that could support cooperation. In general, cooperation can emerge and be maintained when cooperators are sufficiently interacting with themselves. This communication provides a kind of assortment and reciprocity. The most crucial and common mechanisms to achieve that task are kin selection, spatial structure, and enforcement (punishment). Here, we used agent-based simulation models to investigate these pivotal mechanisms against conditional defector strategies. We concluded that the latter could easily violate the former and take over the population. This surprising outcome may urge us to rethink the evolution of cooperation, as it illustrates that maintaining cooperation may be more difficult than previously thought. Moreover, empirical applications may support these theoretical findings, such as invading the cooperator population of pathogens by genetically engineered conditional defectors, which could be a potential therapy for many incurable diseases.

MayaSim: An agent-based model of the ancient Maya social-ecological system

Scott Heckbert | Published Wednesday, July 11, 2012 | Last modified Tuesday, July 02, 2013

MayaSim is an agent-based, cellular automata and network model of the ancient Maya. Biophysical and anthropogenic processes interact to grow a complex social ecological system.

This is an extension of the original RAGE model (Dressler et al. 2018), where we add learning capabilities to agents, specifically learning-by-doing and social learning (two processes central to adaptive (co-)management).

The extension module is applied to smallholder farmers’ decision-making - here, a pasture (patch) is the private property of the household (agent) placed on it and there is no movement of the households. Households observe the state of the pasture and their neighrbours to make decisions on how many livestock to place on their pasture every year. Three new behavioural types are created (which cannot be combined with the original ones): E-RO (baseline behaviour), E-LBD (learning-by-doing) and E-RO-SL1 (social learning). Similarly to the original model, these three types can be compared regarding long-term social-ecological performance. In addition, a global strategy switching option (corresponding to double-loop learning) allows users to study how behavioural strategies diffuse in a heterogeneous population of learning and non-learning agents.

An important modification of the original model is that extension agents are heterogeneous in how they deal with uncertainty. This is represented by an agent property, called the r-parameter (household-risk-att in the code). The r-parameter is catch-all for various factors that form an agent’s disposition to act in a certain way, such as: uncertainty in the sensing (partial observability of the resource system), noise in the information received, or an inherent characteristic of the agent, for instance, their risk attitude.

Correlated random walk

Thibault Fronville | Published Friday, April 01, 2022 | Last modified Monday, April 25, 2022

The first simple movement models used unbiased and uncorrelated random walks (RW). In such models of movement, the direction of the movement is totally independent of the previous movement direction. In other words, at each time step the direction, in which an individual is moving is completely random. This process is referred to as a Brownian motion.
On the other hand, in correlated random walks (CRW) the choice of the movement directions depends on the direction of the previous movement. At each time step, the movement direction has a tendency to point in the same direction as the previous one. This movement model fits well observational movement data for many animal species.
The presented agent based model simulated the movement of the agents as a correlated random walk (CRW). The turning angle at each time step follows the Von Mises distribution with a ϰ of 10. The closer ϰ gets to zero, the closer the Von Mises distribution becomes uniform. The larger ϰ gets, the more the Von Mises distribution approaches a normal distribution concentrated around the mean (0°).
This model is implemented in python and can be used as a building block for more complex agent based models that would rely on describing the movement of individuals with CRW.

Displaying 10 of 1031 results for "J Van Der Beek" 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