Related papers: Recycling Parrondo games
We prove the existence of an effective universal upper bound for the order of any integral periodic orbit of any integral algebraic dynamical system in a fixed ambient space. Using this, we demonstrate the decidability of periodicity in…
Parrondo's paradox was introduced by Juan Parrondo in 1996. In game theory, this paradox is described as: A combination of losing strategies becomes a winning strategy. At first glance, this paradox is quite surprising, but we can easily…
We define and study a collection of matroid isomorphism games corresponding to various axiomatic characterizations of matroids. These are nonlocal games played between two cooperative players. Each game is played on two matroids, and the…
This paper introduces a new class of Dynkin games, where the two players are allowed to make their stopping decisions at a sequence of exogenous Poisson arrival times. The value function and the associated optimal stopping strategy are…
This paper provides effective methods for the polyhedral formulation of impartial finite combinatorial games as lattice games. Given a rational strategy for a lattice game, a polynomial time algorithm is presented to decide (i) whether a…
We investigate combinatorial issues relating to the use of random orbit approximations to the attractor of an iterated function system with the aim of clarifying the role of the stochastic process during generation the orbit. A Baire…
Periodic orbit theory allows calculations of long time properties of chaotic systems from traces, dynamical zeta functions and spectral determinants of deterministic evolution operators, which are in turn evaluated in terms of periodic…
We present a topological method of obtaining the existence of infinite number of symmetric periodic orbits for systems with reversing symmetry. The method is based on covering relations. We apply the method to a four-dimensional reversible…
Optimal behavior in (competitive) situation is traditionally determined with the help of utility functions that measure the payoff of different actions. Given an ordering on the space of revenues (payoffs), the classical axiomatic approach…
We deal with the orbit determination problem for hyperbolic maps. The problem consists in determining the initial conditions of an orbit and, eventually, other parameters of the model from some observations. We study the behaviour of the…
We introduce games with probabilistic uncertainty, a natural model for controller synthesis in which the controller observes the state of the system through imprecise sensors that provide correct information about the current state with a…
Regular games form a well-established class of games for analysis and synthesis of reactive systems. They include coloured Muller games, McNaughton games, Muller games, Rabin games, and Streett games. These games are played on directed…
We study dissipative polygonal outer billiards, i.e. outer billiards about convex polygons with a contractive reflection law. We prove that dissipative outer billiards about any triangle and the square are asymptotically periodic, i.e. they…
Non-linear parametric resonances occur frequently in nature. Here we summarize how they can be studied by means of perturbative methods. We show in particular how resonances can affect the motion of a test particle orbiting in the vicinity…
The dynamics in games involving multiple players, who adaptively learn from their past experience, is not yet well understood. We analyzed a class of stochastic games with Markov strategies in which players choose their actions…
We examine the routing problem for self-interested vehicles using stochastic decision strategies. By approximating the road latency functions and a non-linear variable transformation, we frame the problem as an aggregative game. We…
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…
We define rules for cellular automata played on quasiperiodic tilings of the plane arising from the multigrid method in such a way that these cellular automata are isomorphic to Conway's Game of Life. Although these tilings are nonperiodic,…
This paper considers a class of reinforcement-based learning (namely, perturbed learning automata) and provides a stochastic-stability analysis in repeatedly-played, positive-utility, finite strategic-form games. Prior work in this class of…
We present how a probabilistic model can describe the asymptotic behaviour of the iterations, especially for ODE with an approach of the Poincar\'e-Bendixon's problem in $\mathbb{R}^d$. On pr\'esente un mod\`ele probabiliste pour d\'ecrire…