We build a stylized model of a network of business angel investors and start-up entrepreneurs. Decisions are based on trust as a decision making tool under true uncertainty.

This model describes and analyses the Travel-Tour Case study.

This model introduces individual bias to the model of exploration and exploitation, simulates knowledge diffusion within organizations, aiming to investigate the effect of individual bias and other related factors on organizational objectivity.

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

A general model of human mate choice in which agents are localized in space, interact with close neighbors, and tend to range either near or far. At the individual level, our model uses two oft-used but incompletely understood decision rules: one based on preferences for similar partners, the other for maximally attractive partners.

Perpetual Motion Machine - A simple economy that operates at both a biophysical and economic level, and is sustainable. The goal: to determine the necessary and sufficient conditions of sustainability, and the attendant necessary trade-offs.

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.