The purpose of the model is to examine the strength of network connections in a ceremonial exchange network in a non-hierarchical society.

The model implements a model that reflects features of a rural hill village in Nepal. Key features of the model include water storage, social capital and migration of household members who then send remittances back to the village.

We propose an agent-based model where a fixed finite population of tagged agents play iteratively the Nash demand game in a regular lattice. The model extends the bargaining model by Axtell, Epstein and Young.

A demonstration model showing how modellers can create a multi regional tram network with commuters, destinations and houses. The model offers options to create a random tram network made from modeller input or to load shapefiles for the Greater Manchester Metrolink.

The model uses NetLogo with gis, nw an csv extensions.

IMine is a flexible framework which can be adopt multiple criteria for convergence to solve Influence Minig problems. It can use any diffusion model, as well as resilience to compute the influence of a set of nodes base on the use case.
The code is written and tested on ‘R’ v3.5

A very simple model elaborated to explore what may happens when buyers (travelers) have more information than sellers (tourist destinations)

A replication in Netlogo 5.2 of the classic model, Sugarscape (Epstein & Axtell, 1996).

The model presented here is extensively described in the paper ‘Talk less to strangers: How homophily can improve collective decision-making in diverse teams’ (forthcoming at JASSS). A full replication package reproducing all results presented in the paper is accessible at https://osf.io/76hfm/.

Narrative documentation includes a detailed description of the model, including a schematic figure and an extensive representation of the model in pseudocode.

The model develops a formal representation of a diverse work team facing a decision problem as implemented in the experimental setup of the hidden-profile paradigm. We implement a setup where a group seeks to identify the best out of a set of possible decision options. Individuals are equipped with different pieces of information that need to be combined to identify the best option. To this end, we assume a team of N agents. Each agent belongs to one of M groups where each group consists of agents who share a common identity.
The virtual teams in our model face a decision problem, in that the best option out of a set of J discrete options needs to be identified. Every team member forms her own belief about which decision option is best but is open to influence by other team members. Influence is implemented as a sequence of communication events. Agents choose an interaction partner according to homophily h and take turns in sharing an argument with an interaction partner. Every time an argument is emitted, the recipient updates her beliefs and tells her team what option she currently believes to be best. This influence process continues until all agents prefer the same option. This option is the team’s decision.

A letter sending model with historically informed initial positions to reconstruct communication and archiving processes in the Republic of Letters, the 15th to 17th century form of scholarship.

The model is aimed at historians, willing to formalize historical assumptions about the letter sending process itself and allows in principle to set heterogeneous social roles, e.g. to evaluate the role of gender or social status in the formation of letter exchange networks. The model furthermore includes a pruning process to simulate the loss of letters to critically asses the role of biases e.g. in relation to gender, geographical regions, or power structures, in the creation of empirical letter archives.

Each agent has an initial random topic vector, expressed as a RGB value. The initial positions of the agents are based on a weighted random draw based on data from [2]. In each step, agents generate two neighbourhoods for sending letters and potential targets to move towards. The probability to send letters is a self-reinforcing process. After each sending the internal topic of the receiver is updated as a movement in abstract space by a random amount towards the letters topic.

…

The model’s aim is to represent the price dynamics under very simple market conditions, given the values adopted by the user for the model parameters. We suppose the market of a financial asset contains agents on the hypothesis they have zero-intelligence. In each period, a certain amount of agents are randomly selected to participate to the market. Each of these agents decides, in a equiprobable way, between proposing to make a transaction (talk = 1) or not (talk = 0). Again in an equiprobable way, each participating agent decides to speak on the supply (ask) or the demand side (bid) of the market, and proposes a volume of assets, where this number is drawn randomly from a uniform distribution. The granularity depends on various factors, including market conventions, the type of assets or goods being traded, and regulatory requirements. In some markets, high granularity is essential to capture small price movements accurately, while in others, coarser granularity is sufficient due to the nature of the assets or goods being traded