Seasonality as a Parrondian game

Switching strategies can be related to the so-called Parrondian games, where the alternation of two losing games yields a winning game. We consider two dynamics that by themselves yield undesirable behaviors, but when alternated, yield a desirable oscillatory behavior. In the analysis of the alternate-logistic map, we prove that alternating parameter values yielding extinction with parameter values associated with chaotic dynamics results in periodic trajectories. Ultimately, we consider a four season logistic model with either migration or immigration.     

Evolutionary Game Dynamics in a Fitness-Dependent Wright-FisherProcess with Noise

Evolutionary game dynamics in finite size populations can be described by a fitness-dependent Wright-Fisher process. We consider symmetric 2$\times $2 games in a well-mixed population. In our model, two parameters to describe the level of player's rationality and noise intensity in environment are introduced. In contrast with the fixation probability method that used in a noiseless case, the introducing of the noise intensity parameter makes the process an ergodic Markov process and based on the limit distribution of the process, we can analysis the evolutionary stable strategy (ESS) of the games. We illustrate the effects of the two parameters on the ESS of games using the Prisoner's dilemma games (PDG) and the snowdrift games (SG). We also compare the ESS of our model with that of the replicator dynamics in infinite size populations. The results are determined by simulation experiments.     

From simple to complex oscillatory behavior in metabolic and genetic control networks

We present an overview of mechanisms responsible for simple or complex oscillatory behavior in metabolic and genetic control networks. Besides simple periodic behavior corresponding to the evolution toward a limit cycle we consider complex modes of oscillatory behavior such as complex periodic oscillations of the bursting type and chaos. Multiple attractors are also discussed, e.g., the coexistence between a stable steady state and a stable limit cycle (hard excitation), or the coexistence between two simultaneously stable limit cycles (birhythmicity). We discuss mechanisms responsible for the transition from simple to complex oscillatory behavior by means of a number of models serving as selected examples. The models were originally proposed to account for simple periodic oscillations observed experimentally at the cellular level in a variety of biological systems. In a second stage, these models were modified to allow for complex oscillatory phenomena such as bursting, birhythmicity, or chaos. We consider successively (1) models based on enzyme regulation, proposed for glycolytic oscillations and for the control of successive phases of the cell cycle, respectively; (2) a model for intracellular Ca(2+) oscillations based on transport regulation; (3) a model for oscillations of cyclic AMP based on receptor desensitization in Dictyostelium cells; and (4) a model based on genetic regulation for circadian rhythms in Drosophila. Two main classes of mechanism leading from simple to complex oscillatory behavior are identified, namely (i) the interplay between two endogenous oscillatory mechanisms, which can take multiple forms, overt or more subtle, depending on whether the two oscillators each involve their own regulatory feedback loop or share a common feedback loop while differing by some related process, and (ii) self-modulation of the oscillator through feedback from the system's output on one of the parameters controlling oscillatory behavior. However, the latter mechanism may also be viewed as involving the interplay between two feedback processes, each of which might be capable of producing oscillations. Although our discussion primarily focuses on the case of autonomous oscillatory behavior, we also consider the case of nonautonomous complex oscillations in a model for circadian oscillations subjected to periodic forcing by a light-dark cycle and show that the occurrence of entrainment versus chaos in these conditions markedly depends on the wave form of periodic forcing. (c) 2001 American Institute of Physics.     

Combinatorial games with a pass: a dynamical systems approach

By treating combinatorial games as dynamical systems, we are able to address a longstanding open question in combinatorial game theory, namely, how the introduction of a "pass" move into a game affects its behavior. We consider two well known combinatorial games, 3-pile Nim and 3-row Chomp. In the case of Nim, we observe that the introduction of the pass dramatically alters the game's underlying structure, rendering it considerably more complex, while for Chomp, the pass move is found to have relatively minimal impact. We show how these results can be understood by recasting these games as dynamical systems describable by dynamical recursion relations. From these recursion relations, we are able to identify underlying structural connections between these "games with passes" and a recently introduced class of "generic (perturbed) games." This connection, together with a (non-rigorous) numerical stability analysis, allows one to understand and predict the effect of a pass on a game.     

Is there switching for replicator dynamics and bimatrix games?

We consider heteroclinic networks for replicator dynamics and bimatrix games, that is, in a simplex or product of simplices, with equilibria at the vertices and connections at the edges-edge networks. Switching dynamics near a heteroclinic network occurs whenever every (infinite) sequence of connections in the network is shadowed by at least one trajectory in its neighborhood. Aguiar and Castro [M.A.D. Aguiar, S.B.S.D. Castro Chaotic switching in a two-person game, Physica D 239 (16), 1598-1609] prove switching near an edge network for the dynamics of the rock-scissors-paper game. Here we give conditions for switching dynamics in general bimatrix games and show that switching near an edge network can never occur for replicator dynamics.     

Hawking radiation and propagation of massive charged scalar field on a three-dimensional Gödel black hole

In this paper we consider the three-dimensional Gödel black hole as a background and we study the vector particle tunneling from this background in order to obtain the Hawking temperature. Then, we study the propagation of a massive charged scalar field and we find the quasinormal modes analytically, which turns out be unstable as a consequence of the existence of closed time-like curves. Also, we consider the flux at the horizon and at infinity, and we compute the reflection and transmission coefficients as well as the absorption cross section. Mainly, we show that massive charged scalar waves can be superradiantly amplified by the three-dimensional Gödel black hole and that the coefficients have an oscillatory behavior. Moreover, the absorption cross section is null at the high frequency limit and for certain values of the frequency.     

Collective decision making and paradoxical games

We study an ensemble of individuals playing the two games of the so-called Parrondo paradox. In our study, players are allowed to choose the game to be played by the whole ensemble in each turn. The choice cannot conform to the preferences of all the players and, consequently, they face a simple frustration phenomenon that requires some strategy to make a collective decision. We consider several such strategies and analyze how fluctuations can be used to improve the performance of the system.     

Coevolving agent strategies and network topology for the public goods games

Much of human cooperation remains an evolutionary riddle. Coevolutionary public goods games in structured populations are studied where players can change from an unproductive public goods game to a productive one, by evaluating the productivity of the public goods games. In our model, each individual participates in games organized by its neighborhood plus by itself. Coevolution here refers to an evolutionary process entailing both deletion of existing links and addition of new links between agents that accompanies the evolution of their strategies. Furthermore, we investigate the effects of time scale separation of strategy and structure on cooperation level. This study presents the following: Foremost, we observe that high cooperation levels in public goods interactions are attained by the entangled coevolution of strategy and structure. Presented results also confirm that the resulting networks show many features of real systems, such as cooperative behavior and hierarchical clustering. The heterogeneity of the interaction network is held responsible for the observed promotion of cooperation. We hope our work may offer an explanation for the origin of large-scale cooperative behavior among unrelated individuals.     

The equivalence of Bell's inequality and the Nash inequality in a quantum game-theoretic setting

The interaction of competing agents is described by classical game theory. It is now well known that this can be extended to the quantum domain, where agents obey the rules of quantum mechanics. This is of emerging interest for exploring quantum foundations, quantum protocols, quantum auctions, quantum cryptography, and the dynamics of quantum cryptocurrency, for example. In this paper, we investigate two-player games in which a strategy pair can exist as a Nash equilibrium when the games obey the rules of quantum mechanics. Using a generalized Einstein–Podolsky–Rosen (EPR) setting for two-player quantum games, and considering a particular strategy pair, we identify sets of games for which the pair can exist as a Nash equilibrium only when Bell's inequality is violated. We thus determine specific games for which the Nash inequality becomes equivalent to Bell's inequality for the considered strategy pair.     

Average consensus of multi-agent systems with communication time delays and noisy links

In this paper,we consider the average-consensus problem with communication time delays and noisy links.We analyze two different cases of coupling topologies:fixed and switching topologies.By utilizing the stability theory of the stochastic differential equations,we analytically show that the average consensus could be achieved almost surely with the perturbation of noise and the communication time delays even if the time delay is time-varying.The theoretical results show that multi-agent systems can tolerate relatively large time delays if the noise is weak,and they can tolerate relatively strong noise if the time delays are low.The simulation results show that systems with strong noise intensities yield slow convergence.     

Two Party Non-Local Games

In this work we have introduced two party games with respective winning conditions. One cannot win these games deterministically in the classical world if they are not allowed to communicate at any stage of the game. Interestingly we find out that in quantum world, these winning conditions can be achieved if the players share an entangled state. We also introduced a game which is impossible to win if the players are not allowed to communicate in classical world (both probabilistically and deterministically), yet there exists a perfect quantum strategy by following which, one can attain the winning condition of the game.     

Conservative Langevin dynamics of solid-on-solid interfaces

We study the dynamics of an interface between two phases in interaction with a wall in the case when the evolution is dominated by surface diffusion. For this, we use an SOS model governed by a conservative Langevin equation and suitable boundary conditions. In the partial wetting case, we study various scaling regimes and show oscillatory behavior in the relaxation of the interface toward its equilibrium shape. We also consider complete wetting and the structure of the precursor film.     

Switching ability of nitro-spiropyran on Au(111): electronic structure changes as a sensitive probe during a ring-opening reaction

Spiropyran is a prototype molecular switch which undergoes a reversible ring-opening reaction by photoinduced cleavage of a C-O bond in the spiropyran (SP) to the merocyanine (MC) isomer. While the electronic states and switching behavior are well characterized in solution, adsorption on metal surfaces crucially affects these properties. Using two-photon photoemission and scanning tunneling spectroscopy, we resolve the molecular energy levels on a Au(111) surface of both isomeric forms. Illumination at various wavelengths does not yield any observable switching rate, thus evidencing a very small upper limit of the quantum efficiency. Electron-induced switching from the SP to the MC isomer via generation of a negative ion resonance can be detected with a quantum yield of (2.2 ± 0.2) × 10(-10) events/electron in tunneling spectroscopy. In contrast, the back reaction could not be observed. This study reveals that the switching properties of surface-bound molecular switches can be very different compared with free molecules, reflecting the strong influence of the interaction with the metal substrate.     

The paradox of group behaviors based on Parrondo’s games

We assume a multi-agent model based on Parrondo’s games. The model consists of game A between individuals and game B. In game A, two behavioral patterns are defined: competition and inaction. A controlled alternation strategy of behavioral pattern that gives a single player the highest return is proposed when game A+B is played randomly. Interesting phenomena can be found in collective games where a large number of individuals choose the behavioral pattern by voting. When game B is the capital-dependent version, the outcome can be better for the players to vote randomly than to vote according to their own capital. An explanation of such counter-intuitive phenomena is given by noting that selfish voting prevents the competition behavior of game A that is essential for the total capital to grow. However, if game B is the history-dependent version, this counter-intuitive phenomenon will not happen. The reason is selfish voting results in the competition behavior of game A, and finally it produces the winning results.     

Universal behavior in non-stationary Mean Field Games

Mean Field Games provide a powerful framework to analyze the dynamics of a large number of controlled objects in interaction. Though these models are much simpler than the underlying differential games they describe in some limit, their behavior is still far from being fully understood. When the system is confined, a notion of “ergodic state” has been introduced that characterizes most of the dynamics for long optimization times. Here we consider a class of models without such an ergodic state, and show the existence of a scaling solution that plays a similar role. Its universality and scaling behavior can be inferred from a mapping to an electrostatic problem.     

The coevolution of partner switching and strategy updating in non-excludable public goods game

Spatial public goods game is a popular metaphor to model the dilemma of collective cooperation on graphs, yet the non-excludable property of public goods has seldom been considered in previous models. Based upon a coevolutionary model where agents play public goods games and adjust their partnerships, the present model incorporates the non-excludable property of public goods: agents are able to adjust their participation in the games hosted by others, whereas they cannot exclude others from their own games. In the coevolution, a directed and dynamical network which represents partnerships among autonomous agents is evolved. We find that non-excludable property counteracts the positive effect of partner switching, i.e., the equilibrium level of cooperation is lower than that in the situation of excludable public goods game. Therefore, we study the effect of individual punishment that cooperative agents pay a personal cost to decrease benefits of those defective neighbors who participate in their hosted games. It is found that the cooperation level in the whole population is heightened in the presence of such a costly behavior.     

Statistical physics approach to graphical games: local and global interactions

In a graphical game agents play with their neighbors on a graph to achieve an appropriate state of equilibrium. Here relevant problems are characterizing the equilibrium set and discovering efficient algorithms to find such an equilibrium (solution). We consider a representation of games that extends over graphical games to deal conveniently with both local a global interactions and use the cavity method of statistical physics to study the geometrical structure of the equilibria space. The method also provides a distributive and local algorithm to find an equilibrium. For simplicity we consider only pure Nash equilibria but the methods can as well be extended to deal with (approximated) mixed Nash equilirbia.     

Designer gene networks: Towards fundamental cellular control

The engineered control of cellular function through the design of synthetic genetic networks is becoming plausible. Here we show how a naturally occurring network can be used as a parts list for artificial network design, and how model formulation leads to computational and analytical approaches relevant to nonlinear dynamics and statistical physics. We first review the relevant work on synthetic gene networks, highlighting the important experimental findings with regard to genetic switches and oscillators. We then present the derivation of a deterministic model describing the temporal evolution of the concentration of protein in a single-gene network. Bistability in the steady-state protein concentration arises naturally as a consequence of autoregulatory feedback, and we focus on the hysteretic properties of the protein concentration as a function of the degradation rate. We then formulate the effect of an external noise source which interacts with the protein degradation rate. We demonstrate the utility of such a formulation by constructing a protein switch, whereby external noise pulses are used to switch the protein concentration between two values. Following the lead of earlier work, we show how the addition of a second network component can be used to construct a relaxation oscillator, whereby the system is driven around the hysteresis loop. We highlight the frequency dependence on the tunable parameter values, and discuss design plausibility. We emphasize how the model equations can be used to develop design criteria for robust oscillations, and illustrate this point with parameter plots illuminating the oscillatory regions for given parameter values. We then turn to the utilization of an intrinsic cellular process as a means of controlling the oscillations. We consider a network design which exhibits self-sustained oscillations, and discuss the driving of the oscillator in the context of synchronization. Then, as a second design, we consider a synthetic network with parameter values near, but outside, the oscillatory boundary. In this case, we show how resonance can lead to the induction of oscillations and amplification of a cellular signal. Finally, we construct a toggle switch from positive regulatory elements, and compare the switching properties for this network with those of a network constructed using negative regulation. Our results demonstrate the utility of model analysis in the construction of synthetic gene regulatory networks. (c) 2001 American Institute of Physics.     

Mean-field approximation for two- and three-person Prisoner’s Dilemmas

We consider the mean-field approximation (MFA) to the system of interacting agents playing two- and three-person Prisoner’s Dilemma games (2-PD and 3-PD). The agents have three available strategies: All-C, All-D, and a third one, which we choose in various ways. Long-time distribution of the strategies is compared for both games. The latter game admits coexistence of larger number of strategies in the long run. In the case of external pressure for cooperation, more pressure is in general necessary for 3-PD than for 2-PD to guarantee cooperation for almost all initial compositions of the strategies. Results for different types of tit-for-tat strategies for 3-PD are discussed. Unlike the 2-PD case, the more forgiving tit-for-tat strategy can survive in the long run in 3-PD.     

Quantum Prisoner’s Dilemma game on hypergraph networks

We study the possible advantages of adopting quantum strategies in multi-player evolutionary games. We base our study on the three-player Prisoner’s Dilemma (PD) game. In order to model the simultaneous interaction between three agents we use hypergraphs and hypergraph networks. In particular, we study two types of networks: a random network and a SF-like network. The obtained results show that in the case of a three-player game on a hypergraph network, quantum strategies are not necessarily stochastically stable strategies. In some cases, the defection strategy can be as good as a quantum one.