Theory of Cooperation in Complex Social Networks
Authors: Bijan Ranjbar-Sahraei, Haitham Bou Ammar, Daan Bloembergen, Karl Tuyls, Gerhard Weiss
AAAI 2014 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | This paper presents a theoretical as well as empirical study on the evolution of cooperation on complex social networks, following the continuous action iterated prisoner s dilemma (CAIPD) model. In particular, convergence to network-wide agreement is proven for both evolutionary networks with fixed interaction dynamics, as well as for coevolutionary networks where these dynamics change over time. Moreover, an extension to the CAIPD model is proposed that allows to model influence on the evolution of cooperation in social networks. As such, this work contributes to a better understanding of behavioral change on social networks, and provides a first step towards their active control. |
| Researcher Affiliation | Academia | 1Maastricht University, The Netherlands 2University of Pennsylvania, PA, United States 3University of Liverpool, United Kingdom |
| Pseudocode | No | The paper does not contain any pseudocode or clearly labeled algorithm blocks. |
| Open Source Code | No | The paper does not provide a statement or link indicating that its source code is open or publicly available. |
| Open Datasets | Yes | In what comes next, experiments are performed on two sample networks, shown in Figure 1, each consisting of N = 50 individuals. The scale-free network follows (Barab asi and Albert 1999) and has an average degree of two; the small world network follows (Watts and Strogatz 1998) and has average degree 4 and rewiring probability 0.1. |
| Dataset Splits | No | The paper mentions initializing networks with cooperators and defectors, but it does not specify explicit training, validation, or test dataset splits. |
| Hardware Specification | No | The paper does not provide any specific hardware specifications used for running the experiments. |
| Software Dependencies | No | The paper does not provide specific software dependencies with version numbers. |
| Experiment Setup | Yes | Both networks are initialized with 25 pure cooperators and 25 pure defectors. The benefits that cooperators share and the costs of cooperation are b = 4 and c = 1, respectively. The sigmoid function used to calculate the strategy adoption strength uses β = 1. |