The dynamic agent based model of system which turn out the self-adjusting system, are considered in this text.

A simple model is constructed using C# in order to to capture key features of market dynamics, while also producing reasonable results for the individual insurers. A replication of Taylor’s model is also constructed in order to compare results with the new premium setting mechanism. To enable the comparison of the two premium mechanisms, the rest of the model set-up is maintained as in the Taylor model. As in the Taylor example, homogeneous customers represented as a total market exposure which is allocated amongst the insurers.

In each time period, the model undergoes the following steps:
1. Insurers set competitive premiums per exposure unit
2. Losses are generated based on each insurer’s share of the market exposure
3. Accounting results are calculated for each insurer
…

The purpose of the model is to explore the impacts of global change on the ability of a community of farmers to adapt their practices to an agricultural pest.

This NetLogo model simulates the spread of climate change beliefs within a population of individuals. Each believer has an initial belief level, which changes over time due to interactions with other individuals and exposure to media. The aim of the model is to identify possible methods for reducing climate change denial.

This is a replication model of the matching problem including the mate search problem, which is the generalization of a traditional optimization problem.

Flibs’NLogo implements in NetLogo modelling environment, a genetic algorithm whose purpose is evolving a perfect predictor from a pool of digital creatures constituted by finite automata or flibs (finite living blobs) that are the agents of the model. The project is based on the structure described by Alexander K. Dewdney in “Exploring the field of genetic algorithms in a primordial computer sea full of flibs” from the vintage Scientific American column “Computer Recreations”.
As Dewdney summarized: “Flibs […] attempt to predict changes in their environment. In the primordial computer soup, during each generation, the best predictor crosses chromosomes with a randomly selected flib. Increasingly accurate predictors evolve until a perfect one emerges. A flib […] has a finite number of states, and for each signal it receives (a 0 or a 1) it sends a signal and enters a new state. The signal sent by a flib during each cycle of operation is its prediction of the next signal to be received from the environment”

This ABM deals with commuting choices in the Italian city of Varese. Empirical data inform agents’ attitudes and modal choices costs and emissions. We evaluate ex ante the impact of policies for less polluting commuting choices.

This is a simulation model to explore possible outcomes of the Port of Mars cardgame. Port of Mars is a resource allocation game examining how people navigate conflicts between individual goals and common interests relative to shared resources. The game involves five players, each of whom must decide how much of their time and effort to invest in maintaining public infrastructure and renewing shared resources and how much to expend in pursuit of their individual goals. In the game, “Upkeep” is a number that represents the physical health of the community. This number begins at 100 and goes down by twenty-five points each round, representing resource consumption and wear and tear on infrastructure. If that number reaches zero, the community collapses and everyone dies.

A friendship game is a kind of network game: a game theory model on a network. This is a NetLogo model of an agent-based adaptation of “‘Friendship-based’ Games” by PJ Lamberson. The agents reach an equilibrium that depends on the strategy played and the topology of the network.

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