background: the aim of this study was to survey the iranian parasitology researchers’ performance, and analyse and visualize the scientific outputs of their co-authorship network. methods: this study was conducted using scientometric method and social network analysis (sna). the data extracted from the web of science (wos) databases in july 10th 2014. totally, 1048documents of all types in rese...

Cooperation plays a key role in the evolution of complex systems. However, the level of cooperation extensively varies with the topology of agent networks in the widely used models of repeated games. Here we show that cooperation remains rather stable by applying the reinforcement learning strategy adoption rule, Q-learning on a variety of random, regular, small-word, scale-free and modular net...

We simulate the prisoner’s dilemma and hawk-dove games on a real social acquaintance network. Using a discrete analogue of replicator dynamics, we show that surprisingly high levels of cooperation can be achieved, contrary to what happens in unstructured mixing populations. Moreover, we empirically show that cooperation in this network is stable with respect to invasion by defectors.

The world in which we are living is a huge network of networks and should be described by interdependent networks. The interdependence between networks significantly affects the evolutionary dynamics of cooperation on them. Meanwhile, due to the diversity and complexity of social and biological systems, players on different networks may not interact with each other by the same way, which should...

We study the effect of contingent movement on the persistence of cooperation on complex networks with empty nodes. Each agent plays Prisoner's Dilemma game with its neighbors and then it either updates the strategy depending on the payoff difference with neighbors or it moves to another empty node if not satisfied with its own payoff. If no neighboring node is empty, each agent stays at the sam...

Cooperation, a necessity for any peer-to-peer (P2P) cooperative service, is often achieved by rewarding good behavior now with the promise of future benefits. However, in most cases, interactions with a particular peer or the service itself eventually end, resulting in some last exchange in which departing participants have no incentive to contribute. Without cooperation in the last round, coop...

We develop a game-theoretic framework to investigate the effect of cooperation on the energy efficiency in wireless networks. We address two examples of network architectures, resembling ad-hoc network and network with central infrastructure node. Most present approaches address the issue of energy efficiency in communication networks by using complex algorithms to enforce cooperation in the ne...

In a cooperative coding scheme, network nodes work together to achieve higher transmission rates. To obtain a better understanding of cooperation, we consider a model in which two transmitters send rate-limited descriptions of their messages to a “cooperation facilitator”, a node that sends back rate-limited descriptions of the pair to each transmitter. This model includes the conferencing enco...

The performance of user-cooperation in a multiaccess network is compared to that of using a wireless relay. Using the total transmit and processing power consumed at all nodes as a cost metric, the outage probabilities achieved by dynamic decode-and-forward (DDF) and amplify-and-forward (AF) are compared for the two networks. A high SNR outage analysis in conjunction with area-averaged numerica...

Axelrod (The evolution of cooperation, 1984) and others explain how cooperation can emerge in repeated 2-person prisoner’s dilemmas. But in public good games with anonymous contributions, we expect a breakdown of cooperation because direct reciprocity fails. However, if agents are situated in a social network determining which agents interact, and if they can influence the network, then coopera...