Optimal sequence for Parrondo games
arXiv:1409.6497 · doi:10.1103/PhysRevE.77.021124
Abstract
An algorithm based on backward induction is devised in order to compute the optimal sequence of games to be played in Parrondo games. The algorithm can be used to find the optimal sequence for any finite number of turns or in the steady state, showing that ABABB... is the sequence with the highest steady state average gain. The algorithm can also be generalised to find the optimal adaptive strategy in a multi-player version of the games, where a finite number of players may choose, at every turn, the game the whole ensemble should play.
7 pages, 3 figures
References in corpus (8)
- Optimal finite-time processes in stochastic thermodynamics
- Feedback control in a collective flashing ratchet
- Quantum Parrondo's Games
- Optimal strategies in collective Parrondo games
- Closed-loop control strategy with improved current for a flashing ratchet
- Inefficiency of voting in Parrondo games
- Quantum Implementation of Parrondo's Paradox
- Collective decision making and paradoxical games
Cited by in corpus (10)
- Optimal potentials for temperature ratchets
- Extended Parrondo's Game and Brownian Ratchets: Strong and Weak Parrondo Effect
- Winning in Sequential Parrondo Games by Players with Short-Term Memory
- Higher-order evolutionary dynamics with game transitions
- Parrondo's paradox in quantum walks with inhomogeneous coins
- Parrondo games as disordered systems
- Characteristics of the polymer transport in ratchet systems
- How strong can the Parrondo effect be? II
- Multi player Parrondo games with rigid coupling
- Parrondo games with spatial dependence, III