Computational Model Library

Displaying 10 of 112 results for "Brandon Velasco" clear search

Peer reviewed Swidden Farming Version 2.0

C Michael Barton | Published Wednesday, June 12, 2013 | Last modified Wednesday, September 03, 2014

Model of shifting cultivation. All parameters can be controlled by the user or the model can be run in adaptive mode, in which agents innovate and select parameters.

AnimDens NetLogo

Miguel Pais Christine Ward-Paige | Published Friday, February 10, 2017 | Last modified Sunday, February 23, 2020

The model demonstrates how non-instantaneous sampling techniques produce bias by overestimating the number of counted animals, when they move relative to the person counting them.

Peer reviewed Collectivities

Nigel Gilbert | Published Tuesday, April 09, 2019 | Last modified Thursday, August 22, 2019

The model that simulates the dynamic creation and maintenance of knowledge-based formations such as communities of scientists, fashion movements, and subcultures. The model’s environment is a spatial one, representing not geographical space, but a “knowledge space” in which each point is a different collection of knowledge elements. Agents moving through this space represent people’s differing and changing knowledge and beliefs. The agents have only very simple behaviors: If they are “lonely,” that is, far from a local concentration of agents, they move toward the crowd; if they are crowded, they move away.

Running the model shows that the initial uniform random distribution of agents separates into “clumps,” in which some agents are central and others are distributed around them. The central agents are crowded, and so move. In doing so, they shift the centroid of the clump slightly and may make other agents either crowded or lonely, and they too will move. Thus, the clump of agents, although remaining together for long durations (as measured in time steps), drifts across the view. Lonely agents move toward the clump, sometimes joining it and sometimes continuing to trail behind it. The clumps never merge.

The model is written in NetLogo (v6). It is used as a demonstration of agent-based modelling in Gilbert, N. (2008) Agent-Based Models (Quantitative Applications in the Social Sciences). Sage Publications, Inc. and described in detail in Gilbert, N. (2007) “A generic model of collectivities,” Cybernetics and Systems. European Meeting on Cybernetic Science and Systems Research, 38(7), pp. 695–706.

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.

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.

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.

A Model of Iterated Ultimatum game

Andrea Scalco | Published Tuesday, February 24, 2015 | Last modified Monday, March 09, 2015

The simulation generates two kinds of agents, whose proposals are generated accordingly to their selfish or selfless behaviour. Then, agents compete in order to increase their portfolio playing the ultimatum game with a random-stranger matching.

This model allows for the investigation of the effect spatial clustering of raw material sources has on the outcome of the neutral model of stone raw material procurement by Brantingham (2003).

Peer reviewed Personnel decisions in the hierarchy

Smarzhevskiy Ivan | Published Friday, August 19, 2022

This is a model of organizational behavior in the hierarchy in which personnel decisions are made.
The idea of the model is that the hierarchy, busy with operations, is described by such characteristics as structure (number and interrelation of positions) and material, filling these positions (persons with their individual performance). A particular hierarchy is under certain external pressure (performance level requirement) and is characterized by the internal state of the material (the distribution of the perceptions of others over the ensemble of persons).
The World of the model is a four-level hierarchical structure, consisting of shuff positions of the top manager (zero level of the hierarchy), first-level managers who are subordinate to the top manager, second-level managers (subordinate to the first-level managers) and positions of employees (the third level of the hierarchy). ) subordinated to the second-level managers. Such a hierarchy is a tree, i.e. each position, with the exception of the position of top manager, has a single boss.
Agents in the model are persons occupying the specified positions, the number of persons is set by the slider (HumansQty). Personas have some operational performance (harisma, an unfortunate attribute name left over from the first edition of the model)) and a sense of other personas’ own perceptions. Performance values are distributed over the ensemble of persons according to the normal law with some mean value and variance.
The value of perception by agents of each other is positive or negative (implemented in the model as numerical values equal to +1 and -1). The distribution of perceptions over an ensemble of persons is implemented as a random variable specified by the probability of negative perception, the value of which is set by the control elements of the model interface. The numerical value of the probability equal to 0 corresponds to the case in which all persons positively perceive each other (the numerical value of the random variable is equal to 1, which corresponds to the positive perception of the other person by the individual).
The hierarchy is occupied with operational activity, the degree of intensity of which is set by the external parameter Difficulty. The level of productivity of each manager OAIndex is equal to the level of productivity of the department he leads and is the ratio of the sum of productivity of employees subordinate to the head to the level of complexity of the work Difficulty. An increase in the numerical value of Difficulty leads to a decrease in the OAIndex for all subdivisions of the hierarchy. The managerial meaning of the OAIndex indicator is the percentage of completion of the load specified for the hierarchy as a whole, i.e. the ratio of the actual performance of the structural subdivisions of the hierarchy to the required performance, the level of which is specified by the value of the Difficulty parameter.

We expose RA agent-based model of the opinion and tolerance dynamics in artificial societies. The formal mathematical model is based on the ideas of Social Influence, Social Judgment, and Social Identity theories.

Displaying 10 of 112 results for "Brandon Velasco" 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