Computational Model Library

Displaying 4 of 4 results agent-based computational modelling in social sciences clear

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.

The model is based on Swann and Buhrmester’s Identity Fusion behavioural theory, which seeks to explain why an individual puts the group’s priorities above their personal expectations. In order to observe the theory and validate group behaviour, a case study was carried out focusing on scenarios of group violence in football stadiums in Brazil. For the modelling, each agent has a distribution of levels of identification with the group to which they belong, with their level of fusion varying between 1 and 5. According to behavioural theory, an individual’s degree of fusion with the group directly interferes with their behaviour of replicating actions and absorbing group beliefs.

The model explores the informational causes of polarization and bi-polarization of opinions in groups. To this end it expands the model of the Argument Communication Theory of Bi-polarization. The latter is an argument-based multi-agent model of opinion dynamics inspired by Persuasive Argument Theory. The original model can account for polarization as an outcome of pure informational influence, and reproduces bi-polarization effects by postulating an additional mechanism of homophilous selection of communication partners. The expanded model adds two dimensions: argument strength and more sophisticated protocols of informational influence (argument communication and opinion update).

More frequently protests are accompanied by an opposing group performing a counter protest. This phenomenon can increase tension such that police must try to keep the two groups separated. However, what is the best strategy for police? This paper uses a simple agent-based model to determine the best strategy for keeping the two groups separated. The ‘thin blue line’ varies in density (number of police), width and the keenness of police to approach protesters. Three different groups of protesters are modelled to mimic peaceful, average and volatile protests. In most cases, a few police forming a single-file ‘thin blue line’ separating the groups is very effective. However, when the protests are more volatile, it is more effective to have many police occupying a wide ‘thin blue line’, and police being keen to approach protesters. To the authors knowledge, this is the first paper to model protests and counter-protests.

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