English
Related papers

Related papers: Recycling Parrondo games

200 papers

In this note, we consider repeated play of a finite game using learning rules whose period-by-period behavior probabilities or empirical distributions converge to some notion of equilibria of the stage game. Our primary focus is on…

Computer Science and Game Theory · Computer Science 2013-10-22 M. Sadegh Talebi

In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…

Logic in Computer Science · Computer Science 2025-02-26 Pablo F. Castro , Pedro D'Argenio

In a series of papers, G. Harmer and D. Abbott study the behavior of random walks associated with games introduced in 1997 by J. M. R. Parrondo. These games illustrate an apparent paradox that random and deterministic mixtures of losing…

Probability · Mathematics 2007-05-23 R. Pyke

We present a deterministic algorithm, solving discounted games with $n$ nodes in $n^{O(1)}\cdot (2 + \sqrt{2})^n$-time. For bipartite discounted games our algorithm runs in $n^{O(1)}\cdot 2^n$-time. Prior to our work no deterministic…

Data Structures and Algorithms · Computer Science 2020-10-27 Alexander Kozachinskiy

That there exist two losing games that can be combined, either by random mixture or by nonrandom alternation, to form a winning game is known as Parrondo's paradox. We establish a strong law of large numbers and a central limit theorem for…

Probability · Mathematics 2009-09-04 S. N. Ethier , Jiyeon Lee

In this paper, the existence of non-trivial time periodic solutions of first order mean field games is proved. It is assumed that there is a non-trivial periodic orbit contained in the Mather set. The whole system is autonomous with a…

Analysis of PDEs · Mathematics 2024-01-17 Panrui Ni

We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…

Dynamical Systems · Mathematics 2014-04-21 Jesús San Martín , Mason A. Porter

Both single-player Parrondo games (SPPG) and multi-player Parrondo games (MPPG) display the Parrondo Effect (PE) wherein two or more individually fair (or Llosing) games yield a net winning outcome if alternated periodically or randomly.…

Physics and Society · Physics 2009-11-13 J. B. Satinover , D. Sornette

We present a new form of a Parrondo game using discrete-time quantum walk on a line. The two players A and B with different quantum coins operators, individually losing the game can develop a strategy to emerge as joint winners by using…

Quantum Physics · Physics 2011-03-25 C. M. Chandrashekar , Subhashish Banerjee

Zero-determinant strategies are a class of strategies in repeated games which unilaterally control payoffs. Zero-determinant strategies have attracted much attention in studies of social dilemma, particularly in the context of evolution of…

Statistical Mechanics · Physics 2024-11-11 Masahiko Ueda

Analytical perturbations of a family of finite-dimensional Poisson systems are considered. It is shown that the family is analytically orbitally conjugate in $U \subset \mathbb{R}^n$ to a planar harmonic oscillator defined on the symplectic…

Mathematical Physics · Physics 2019-11-22 Isaac A. García , Benito Hernández-Bermejo

We apply periodic orbit theory to a quantum billiard on a torus with a variable number N of small circular scatterers distributed randomly. Provided these scatterers are much smaller than the wave length they may be regarded as sources of…

chao-dyn · Physics 2009-10-31 Per Dahlqvist

Let game B be Toral's cooperative Parrondo game with (one-dimensional) spatial dependence, parameterized by N (3 or more) and p_0, p_1, p_2, p_3 in [0,1], and let game A be the special case p_0=p_1=p_2=p_3=1/2. In previous work we…

Probability · Mathematics 2013-01-16 S. N. Ethier , Jiyeon Lee

We study the existence of asymptotically stable periodic trajectories induced by reset feedback. The analysis is developed for a planar system. Casting the problem into the hybrid setting, we show that a periodic orbit arises from the…

Systems and Control · Computer Science 2021-02-26 Andrea Bisoffi , Fulvio Forni , Mauro Da Lio , Luca Zaccarian

The Parrondo's paradox is a counterintuitive phenomenon in which individually losing strategies, canonically termed game A and game B, are combined to produce winning outcomes. In this paper, a co-evolution of game dynamics and network…

Physics and Society · Physics 2019-10-11 Ye Ye , Xiao Rong Hang , Jin Ming Koh , Jarosław Adam Miszczak , Kang Hao Cheong , Neng-gang Xie

Analytic methods to investigate periodic orbits in galactic potentials. To evaluate the quality of the approximation of periodic orbits in the logarithmic potential constructed using perturbation theory based on Hamiltonian normal forms.…

Astrophysics · Physics 2011-10-05 Giuseppe Pucacco , Dino Boccaletti , Cinzia Belmonte

We study dynamics and bifurcations of two-dimensional reversible maps having non-transversal heteroclinic cycles containing symmetric saddle periodic points. We consider one-parameter families of reversible maps unfolding generally the…

Dynamical Systems · Mathematics 2015-06-03 A. Delshams , S. V. Gonchenko , V. S. Gonchenko , J. T. Lázaro , O. Sten'kin

The original Parrondo game, denoted as AB3, contains two independent games: A and B. The winning or losing of A and B game is defined by the change of one unit of capital. Game A is a losing game if played continuously, with winning…

Physics and Society · Physics 2016-06-22 Ka Wai Cheung , Ho Fai Ma , Degang Wu , Ga Ching Lui , Kwok Yip Szeto

For an eco-epidemic model with disease in the prey and periodic coefficients it is conjectured in [Xingge Niu, Tailei Zhang, Zhidong Teng, The asymptotic behavior of a nonautonomous eco-epidemic model with disease in the prey, Applied…

Dynamical Systems · Mathematics 2016-01-21 César M. Silva

The optimal value computation for turned-based stochastic games with reachability objectives, also known as simple stochastic games, is one of the few problems in $NP \cap coNP$ which are not known to be in $P$. However, there are some…

Computational Complexity · Computer Science 2014-08-10 David Auger , Pierre COUCHENEY , Yann Strozecki