Computational Model Library

Displaying 10 of 111 results random clear search

Peer reviewed Organizational behavior in the hierarchy model

Smarzhevskiy Ivan | Published Tuesday, June 18, 2019 | Last modified Wednesday, July 31, 2019

In a two-level hierarchical structure (consisting of the positions of managers and operators), persons holding these positions have a certain performance and the value of their own (personal perception in this, simplified, version of the model) perception of each other. The value of the perception of each other by agents is defined as a random variable that has a normal distribution (distribution parameters are set by the control elements of the interface).
In the world of the model, which is the space of perceptions, agents implement two strategies: rapprochement with agents that perceive positively and distance from agents that perceive negatively (both can be implemented, one of these strategies, or neither, the other strategy, which makes the agent stationary). Strategies are implemented in relation to those agents that are in the radius of perception (PerRadius).
The manager (Head) forms a team of agents. The performance of the group (the sum of the individual productivities of subordinates, weighted by the distance from the leader) varies depending on the position of the agents in space and the values of their individual productivities. Individual productivities, in the current version of the model, are set as a random variable distributed evenly on a numerical segment from 0 to 100. The manager forms the team 1) from agents that are in (organizational) radius (Op_Radius), 2) among agents that the manager perceives positively and / or negatively (both can be implemented, one of the specified rules, or neither, which means the refusal of the command formation).
Agents can (with a certain probability, given by the variable PrbltyOfDecisn%), in case of a negative perception of the manager, leave his group permanently.
It is possible in the model to change on the fly radii values, update the perception value across the entire population and the perception of an individual agent by its neighbors within the perception radius, and the probability values for a subordinate to make a decision about leaving the group.
You can also change the set of strategies for moving agents and strategies for recruiting a team manager. It is possible to add a randomness factor to the movement of agents (Stoch_Motion_Speed, the default is set to 0, that is, there are no random movements).

MERCURY extension: population

Tom Brughmans | Published Thursday, May 23, 2019

This model is an extended version of the original MERCURY model (https://www.comses.net/codebases/4347/releases/1.1.0/ ) . It allows for experiments to be performed in which empirically informed population sizes of sites are included, that allow for the scaling of the number of tableware traders with the population of settlements, and for hypothesised production centres of four tablewares to be used in experiments.

Experiments performed with this population extension and substantive interpretations derived from them are published in:

Hanson, J.W. & T. Brughmans. In press. Settlement scale and economic networks in the Roman Empire, in T. Brughmans & A.I. Wilson (ed.) Simulating Roman Economies. Theories, Methods and Computational Models. Oxford: Oxford University Press.

GRASP world

Gert Jan Hofstede | Published Tuesday, April 16, 2019

This agent-based model investigates group longevity in a population in a foundational way, using theory on social relations and culture. It is the first application of the GRASP meta-model for social agents, containing elements of Groups, Rituals, Affiliation, Status, and Power. It can be considered an exercise in artificial sociality: a culture-general, content-free base-line trust model from which to engage in more specific studies. Depending on cultural settings for individualism and power distance, as well as settings for xenophobia and for the increase of trust over group life, the GRASP world model generates a variety of patters. Number of groups ranges from one to many, composition from random to segregated, and pattern genesis from rapid to many hundreds of time steps. This makes GRASP world an instrument that plausibly models some basic elements of social structure in different societies.

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.

This model is an application of Brantingham’s neutral model to a real landscape with real locations of potential sources. The sources are represented as their sizes during current conditions, and from marine geophysics surveys, and the agent starts at a random location in Mossel Bay Region (MBR) surrounding the Archaeological Pinnacle Point (PP) locality, Western Cape, South Africa. The agent moves at random on the landscape, picks up and discards raw materials based only upon space in toolkit and probability of discard. If the agent happens to encounter the PP locality while moving at random the agent may discard raw materials at it based on the discard probability.

Absorption of particulate matter by leafs

Georg Jäger Chiara Letter | Published Monday, November 12, 2018 | Last modified Monday, November 12, 2018

This model aims to understand the interaction between particulate matter and leaves of trees. The particles collide with the leaf and can either be absorbed with a certain probability, otherwise they bounce off it. The absorptions are detected in a counter.
The movement of the particles depends mainly on the strength and direction of the wind and the air temperature. They also show a certain random movement, but the proportion is negligible.
In a collision with the leaf, the particles are absorbed with a certain probability (absorption-probability), otherwise repelled.

A series of studies show the applicability of the NK model in the crowdsourcing research, but it also exposes a problem that the application of the NK model is not tightly integrated with crowdsourcing process, which leads to lack of a basic crowdsourcing simulation model. Accordingly, by introducing interaction relationship among task decisions to define three tasks of different structure: local task, small-world task and random task, and introducing bounded rationality and its two dimensions are taken into account: bounded rationality level that used to distinguish industry types and bounded rationality bias that used to differentiate professional users and ordinary users, an agent-based model that simulates the problem-solving process of tournament-based crowdsourcing is constructed by combining the NK fitness landscapes and the crowdsourcing framework of “Task-Crowd-Process-Evaluation”.

The model formalizes a situation where agents embedded in different types of networks (random, small world and scale free networks) interact with their neighbors and express an opinion that is the result of different mechanisms: a coherence mechanism, in which agents try to stick to their previously expressed opinions; an assessment mechanism, in which agents consider available external information on the topic; and a social influence mechanism, in which agents tend to approach their neighbor’s opinions.

A series of studies show the applicability of the NK model in the crowdsourcing research, but it also exposes a problem that the application of the NK model is not tightly integrated with crowdsourcing process, which leads to lack of a basic crowdsourcing simulation model. Accordingly, by introducing interaction relationship among task decisions to define three tasks of different structure: local task, small-world task and random task, and introducing bounded rationality and its two dimensions are taken into account: bounded rationality level that used to distinguish industry types and bounded rationality bias that used to differentiate professional users and ordinary users, an agent-based model that simulates the problem-solving process of tournament-based crowdsourcing is constructed by combining the NK fitness landscapes and the crowdsourcing framework of “Task-Crowd-Process-Evaluation”.

This is an initial exploratory exercise done for the class @ http://thiagomarzagao.com/teaching/ipea/ Text available here: https://arxiv.org/abs/1712.04429v1
The program:
Reads output from an ABM model and its parameters’ configuration
Creates a socioeconomic optimal output based on two ABM results of the modelers choice
Organizes the data as X and Y matrices
Trains some Machine Learning algorithms

Displaying 10 of 111 results random 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