Simulation to replicate and extend an analytical model (Konrad & Skaperdas, 2010) of the provision of security as a collective good. We simulate bandits preying upon peasants in an anarchy condition.

A multithreaded replication of the PPHPC model in Java for testing different ABM parallelization strategies.

Agents co-operate or defect towards other agents in a prisoner’s dilemma, with strategy choice depending on whether agents share tags or are kin in different social structures.

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 basic premise of the model is to simulate several ‘agents’ going through build-buy cycles: Build: Factories follow simple rules of strategy in the allocation of resources between making exploration and exploitation type products. Buy: Each of two types of Consumers, early-adopters and late adopters, follow simple purchase decision rules in deciding to purchase a product from one of two randomly chosen factories. Thus, the two working ‘agents’ of the model are ‘factories’ and […]

This model studies the effect of the agents’ adaptive expectation on cooperation frequency in the prisoner’s dilemma game in complex networks from an agent based approach. The model is implemented in Repast simphony 1.2.

Complete Library for object oriented development of Classifier Systems. See for the concept behind.