Investigation of chaotic switching strategies in Parrondo's games

Abstract

An analysis of Parrondo's games with different chaotic switching strategies is carried out. We generalize a fair way to compare between different switching strategies. The performance of Parrondo's games with chaotic switching strategies is compared to random and periodic switching strategies. The rate of winning of Parrondo's games with chaotic switching strategies depends on coefficient(s) defining the chaotic generator, initial conditions of the chaotic sequence and the proportion of Game A played. Maximum rate of winning can be obtained with all the above mentioned factors properly set, and this occurs when chaotic switching strategy approaches periodic-like behavior.