Cooperation in the Minority Game with local information

Abstract

The Minority Game was introduced to show basic properties of competitive systems with limited common information resources. M. Paczuski and K. E. Bassler introduced a Minority Game with personal limited information resources, where each agent knows the past actions of randomly chosen neighbours [M. Paczuski, K.E. Bassler, Self-organized Networks of Competing Boolean Agents (1999)]. They asked whether such a system can show cooperation. In this paper we show that agents who are placed in a circle are able to cooperate due to self-organization. Furthermore, we introduce a new evolution method to optimize the cooperation among the agents.