Parrondo’s Games Based on Complex Networks and the Paradoxical Effect

Abstract

Parrondo’s games were first constructed using a simple tossing scenario, which demonstrates the following paradoxical situation: in sequences of games, a winning expectation may be obtained by playing the games in a random order, although each game (game A or game B) in the sequence may result in losing when played individually. The available Parrondo’s games based on the spatial niche (the neighboring environment) are applied in the regular networks. The neighbors of each node are the same in the regular graphs, whereas they are different in the complex networks. Here, Parrondo’s model based on complex networks is proposed, and a structure of game B applied in arbitrary topologies is constructed. The results confirm that Parrondo’s paradox occurs. Moreover, the size of the region of the parameter space that elicits Parrondo’s paradox depends on the heterogeneity of the degree distributions of the networks. The higher heterogeneity yields a larger region of the parameter space where the strong paradox occurs. In addition, we use scale-free networks to show that the network size has no significant influence on the region of the parameter space where the strong or weak Parrondo’s paradox occurs. The region of the parameter space where the strong Parrondo’s paradox occurs reduces slightly when the average degree of the network increases.

Complex Information Game Problem Based on Artificial Neural Network

“…When the game is incompletely informative and dynamic, the concept of Bayesian Nash equilibrium is too weak, because it is the same as the Nash equilibrium in the dynamic game of complete information, allowing existence of empty threat [24]. Therefore, the scholars extended the perfect idea of sub-game to solve the game of incomplete information [25].…”

Noise-induced polarization switching in complex networks

“…This effect can be observed even when dynamical correlations between constituents are not significant, like in the Ising model on interconnected complex networks [9]. Heterogeneity and nontrivial topological features in the patterns of interaction can further impact the dynamics [10][11][12][13].…”

Random Walks in the Presence of Absorbing Barriers in Parrondo's Games

“…Game A is modified where a player i gives away one unit of his capital to a randomly chosen player j. Ye [10] proposed a multi-agent Parrondo's model based on the network evolution and performed a study of a mechanism depending on the evolution of the network structure (the rewiring mechanism) instead of game A. Ethier [11] has considered a collective version of Parrondo's games with probabilities parametrized by ρ ∈ (0, 1] in which a fraction of an infinite number of players collectively choose and individually play at each turn the game that yields the maximum average profit at that turn. Ye [12] proposed a Parrondo's model based on complex networks, and a structure of game B applied in arbitrary topologies was constructed.…”