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).
…

An agent-based simulation of a game of basketball. The model implements most components of a standard game of basketball. Additionally, the model allows the user to test for the effect of two separate cognitive biases – the hot-hand effect and a belief in the team’s franchise player.

This model builds on inquisitiveness as a key individual disposition to expand the bounds of their rationality. It represents a system where teams are formed around problems and inquisitive agents integrate competencies to find ‘emergent’ solutions.

We extend the Flache-Mäs model to incorporate the location and dyadic communication regime of the agents in the opinion formation process. We make spatially proximate agents more likely to interact with each other in a pairwise communication regime.

This is the R code of the mathematical model that includes the decision making formulations for artificial agents. This code corresponds to equations 1-70 given in the paper “A Mathematical Model of The Beer Game”.

The simulation model LAMDA investigates the influences of varying cognitive abilities of the decision maker on the truth-inducing effect of the Groves mechanism. Bounded rationality concepts are represented by information states and learning models.

This is an agent-based model of the implementation of the self-enforcing agreement in cooperative teams.

Model for evaluating various ambulance dispatching policies of an equity constrained emergency medical services under bounded rationality.

Default Initial skill, read ODD for more info. The purpose of the model presented by Salau is to study the ’player profit vs. club benefit’ dilemma present in professional soccer organizations.

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.