Background Competitiveness is a relevant social behavior and in several contexts, from economy to sport activities, has a fundamental role. We analyze this social behavior in the domain of evolutionary game theory, using as reference the Prisoner’s Dilemma. Methods In particular, we investigate whether, in an agent population, it is possible to identify a relation between competitiveness and cooperation. The agent population is embedded both in continuous and in discrete spaces, hence agents play the Prisoner’s Dilemma with their neighbors. In continuous spaces, each agent computes its neighbors by an Euclidean distance-based rule, whereas in discrete spaces agents have as neighbors those directly connected with them. We map competitiveness to the amount of opponents each agent wants to face; therefore, this value is used to define the set of neighbors. Notably, in continuous spaces, competitive agents have a high interaction radius used to compute their neighbors. Instead, since discrete spaces are implemented as directed networks, competitiveness corresponds to the out-degree of each agent, i.e., to the number of arrows starting from the considered agent and directed to those agents it wants to face. Results and conclusions Then, we study the evolution of the system with the aim to investigate if, and under which conditions, cooperation among agents emerges. As result, numerical simulations of the proposed model show that competitiveness strongly increases cooperation. Furthermore, we found other relevant phenomena as the emergence of hubs in directed networks.
The role of competitiveness in the Prisoner's Dilemma
JAVARONE, MARCO ALBERTO;
2015-01-01
Abstract
Background Competitiveness is a relevant social behavior and in several contexts, from economy to sport activities, has a fundamental role. We analyze this social behavior in the domain of evolutionary game theory, using as reference the Prisoner’s Dilemma. Methods In particular, we investigate whether, in an agent population, it is possible to identify a relation between competitiveness and cooperation. The agent population is embedded both in continuous and in discrete spaces, hence agents play the Prisoner’s Dilemma with their neighbors. In continuous spaces, each agent computes its neighbors by an Euclidean distance-based rule, whereas in discrete spaces agents have as neighbors those directly connected with them. We map competitiveness to the amount of opponents each agent wants to face; therefore, this value is used to define the set of neighbors. Notably, in continuous spaces, competitive agents have a high interaction radius used to compute their neighbors. Instead, since discrete spaces are implemented as directed networks, competitiveness corresponds to the out-degree of each agent, i.e., to the number of arrows starting from the considered agent and directed to those agents it wants to face. Results and conclusions Then, we study the evolution of the system with the aim to investigate if, and under which conditions, cooperation among agents emerges. As result, numerical simulations of the proposed model show that competitiveness strongly increases cooperation. Furthermore, we found other relevant phenomena as the emergence of hubs in directed networks.File | Dimensione | Formato | |
---|---|---|---|
Computational Social Networks_2015_2.pdf
accesso aperto
Descrizione: articolo
Tipologia:
versione editoriale (VoR)
Dimensione
2.22 MB
Formato
Adobe PDF
|
2.22 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.