In social and biological systems, there are obvious individual divergence and asymmetric payoff phenomenon due to the strength, power and influence differences. In this paper, we introduce an asymmetric payoff mechanism to evolutionary Prisoner’s Dilemma Game (PDG) on scale-free networks. The...

In this paper, we propose a max-flow-min-cost (MFMC) problem to obtain the upper bound of network capacity and develop an efficient packet routing strategy. The MFMC problem is formulated as two linear programs (LP). The optimal solutions of the two LPs are the upper bound of network capacity...

In this paper, we study the information traffic flow in communication networks with scale-free topology. We consider the situation arising when packets are delivered to non-homogeneously selected destinations. It is found that the network capacity Rc increases with the increase of 〈k〉...

In this paper, the packet traffic flow on weighted scale-free networks is investigated based on the local routing strategy using link weights: Pl→i=wliα∑jwljα. The capacity of links is controlled by max(βwlj,1), and the capacity of nodes is controlled by node strength: max(γsi,1). It is...

Considering the heterogeneity of individuals’ influence in the real world, we introduce a preferential selection mechanism to evolutionary games (the Prisoner’s Dilemma Game and the Snowdrift Game) on scale-free networks and focus on the cooperative behavior of the system. In every step,...

We introduce a preferential selection mechanism into a spatial public goods game where players are located on a square lattice. Each individual chooses one of its neighbors as a reference with a probability proportional to exp(Py∗A), where Py is the neighbor’s payoff and A (≥0) is a...

Considering the difference between the actual and expected payoffs, we bring a stochastic learning updating rule into an evolutionary Prisoners Dilemma game and the Snowdrift game on scale-free networks, and then investigate how the expectation level A and environmental noise κ influence...

This paper investigates the evolutionary prisoner’s dilemma on weighted scale-free networks. The weighted networks are generated by adopting Barabási–Albert scale-free network and assigning link weight with wij=(ki×kj)β. Simulation results show that the cooperation frequency has a strong...

We present a simple model for examining the wealth distribution with agents playing evolutionary games (the Prisoners’ Dilemma and the Snowdrift Game) on complex networks. Pareto’s power law distribution of wealth (from 1897) is reproduced on a scale-free network, and the Gibbs or log-normal...

In this paper, we investigate the wealth distribution with agents playing evolutionary games on a scale-free social network adopting the Richest-Following strategy. Pareto's power-law distribution (1897) of wealth is demonstrated with power factor in agreement with that of US or Japan. Moreover,...