REHAB has been designed as an ice-breaker in courses dealing with ecosystem management and participatory modelling. It helps introducing the two main tools used by the Companion Modelling approach, namely role-playing games and agent-based models.

What is stable: the large but coordinated change during a diffusion or the small but constant and uncoordinated changes during a dynamic equilibrium? This agent-based model of a diffusion creates output that reveal insights for system stability.

Trust between farmers and processors is a key factor in developing stable supply chains including “bottom of the pyramid”, small-scale farmers. This simulation studies a case with 10000 farmers.

Its a multi agent simulation environment, provided using JADE/Java. It gets the number of agents and tasks, then divides the physical environment to some segments, and then runs a greedy capability-based coalition formation and task allocation algorithm to assign tasks to groups of agents and complete the tasks.

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.

The model is an extension of: Carley K. (1991) “A theory of group stability”, American Sociological Review, vol. 56, pp. 331-354.

The original model from Carley (1991) works as follows:
- Agents know or ignore a series of knowledge facts;
- At each time step, each agent i choose a partner j to interact with at random, with a probability of choice proportional to the degree of knowledge facts they have in common.
- Agents interact synchronously. As such, interaction happens only if the partnert j is not already busy interacting with someone else.
…

The mode implements a variant of Ant Colony Optimization to explore routing on infrastructures through a landscape with forbidden zones, connecting multiple sinks to one source.

How do bots influence beliefs on social media? Why do beliefs propagated by social bots spread far and wide, yet does their direct influence appear to be limited?

This model extends Axelrod’s model for the dissemination of culture (1997), with a social bot agent–an agent who only sends information and cannot be influenced themselves. The basic network is a ring network with N agents connected to k nearest neighbors. The agents have a cultural profile with F features and Q traits per feature. When two agents interact, the sending agent sends the trait of a randomly chosen feature to the receiving agent, who adopts this trait with a probability equal to their similarity. To this network, we add a bot agents who is given a unique trait on the first feature and is connected to a proportion of the agents in the model equal to ‘bot-connectedness’. At each timestep, the bot is chosen to spread one of its traits to its neighbors with a probility equal to ‘bot-activity’.

The main finding in this model is that, generally, bot activity and bot connectedness are both negatively related to the success of the bot in spreading its unique message, in equilibrium. The mechanism is that very active and well connected bots quickly influence their direct contacts, who then grow too dissimilar from the bot’s indirect contacts to quickly, preventing indirect influence. A less active and less connected bot leaves more space for indirect influence to occur, and is therefore more successful in the long run.

A dynmaic microsimulation model to project the UK population over time

We present an agent-based model of worker protest informed by Epstein (2002). Workers have varying degrees of grievance depending on the difference between their wage and the average of their neighbors. They protest with probabilities proportional to grievance, but are inhibited by the risk of being arrested – which is determined by the ratio of coercive agents to probable rebels in the local area. We explore the effect of similarity perception on the dynamics of collective behavior. If […]