This model, realized on the NetLogo platform, compares utility levels at home and abroad to simulate agents’ migration and their eventual return. Our model is based on two fundamental individual features, i.e. risk aversion and initial expectation, which characterize the dynamics of different agents according to the evolution of their social contacts.

This model expands approaches from social practice theories and is used to investigate the ability of the underlying conceptual model to explain the emergence of social practices, defined as routine behaviour that is similar amoung peers.

MoPAgrIB model simulates the movement of cultivated patches in a savannah vegetation mosaic ; how they move and relocate through the landscape, depending on farming practices, population growth, social rules and vegetation growth.

This model uses ’satisficing’ as a model for farmers’ decision making to learn about influences of alternative decision-making models on simulation results and to exemplify a way to transform a rather theoretical concept into a feasible decision-making model for agent-based farming models.

The provided source code is the result of our efforts in replicating Epstein’s Demographic Prisoner’s Dilemma. The simulation model is written in Repast/J 3.1.

The Axelrod’s model of cultural dissemination is an agent-model designed to investigate the dissemination of culture among interacting agents on a society.

This MAS simulates the traffic of Barcelona Eixample. Uses a centralized AI system in order to control the traffic lights. Car agents are reactive and have no awareness of the intelligence of the system. They (try to) avoid collisions.

This is a relatively simple foraging-radius model, as described first by Robert Kelly, that allows one to quantify the effect of increased logistical mobility (as represented by increased effective foraging radius, r_e) on the likelihood that 2 randomly placed central place foragers will encounter one another within 5000 time steps.

This model is an extended version of the matching problem including the mate search problem, which is the generalization of a traditional optimization problem. The matching problem is extended to a form of asymmetric two-sided matching problem.

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