A Minimal Information Prisoner’s Dilemma on Evolving Networks
نویسندگان
چکیده
We study by computer simulation a group of individuals playing the prisoner’s dilemma game with minimal information of their environment. The network of relationships between players, and their strategy can change over time following simple rules based on players’ degree of satisfaction and despair. We investigated both synchronous and asynchronous network dynamics, observing that cooperation can emerge and remain stable for a range of the parameters. In these regions the network self-organizes such that cooperators form highly connected clusters. Outside this parameter range cooperation drops and the network becomes more random.
منابع مشابه
Modeling Cooperation between Nodes in Wireless Networks by APD Game
Cooperation is the foundation of many protocols in wireless networks. Without cooperation, the performance of a network significantly decreases. Hence, all nodes in traditional networks are required to cooperate with each other. In this paper, instead of traditional networks, a network of rational and autonomous nodes is considered, which means that each node itself can decide whe...
متن کاملModeling Cooperation between Nodes in Wireless Networks by APD Game
Cooperation is the foundation of many protocols in wireless networks. Without cooperation, the performance of a network significantly decreases. Hence, all nodes in traditional networks are required to cooperate with each other. In this paper, instead of traditional networks, a network of rational and autonomous nodes is considered, which means that each node itself can decide whe...
متن کاملPrisoner’s dilemma on co-evolving networks under perfect rationality
We consider the prisoner’s dilemma being played repeatedly on a dynamic network, where agents may choose their actions as well as their co-players. This leads to co-evolution of network structure and strategy patterns of the players. Individual decisions are made fully rationally and are based on local information only. They are made such that links to defecting agents are resolved and that coo...
متن کاملEvolving networks for social optima in the "weakest link game"
Previous models have applied evolving networks based on node-level “copy and rewire” rules to simple two player games (e.g. the Prisoner’s Dilemma). It was found that such models tended to evolve toward socially optimal behavior. Here we apply a similar technique to a more tricky co-ordination game (the weakest link game) requiring interactions from several players (nodes) that may play several...
متن کاملAn Experimental Study of N-Person Iterated Prisoner's Dilemma Games
The Iterated Prisoner’s Dilemma game has been used extensively in the study of the evolution of cooperative behaviours in social and biological systems. There have been a lot of experimental studies on evolving strategies for 2-player Iterated Prisoner’s Dilemma games (2IPD). However, there are many real world problems, especially many social and economic ones, which cannot be modelled by the 2...
متن کامل