Parrondo's games with chaotic switching

Tze Wei Tang; Andrew G. Allison; Derek Abbott

doi:10.1117/12.561307

Translator Disclaimer

25 May 2004 Parrondo's games with chaotic switching

Tze Wei Tang; Andrew G. Allison; Derek Abbott

Author Affiliations +

Proceedings Volume 5471, Noise in Complex Systems and Stochastic Dynamics II; (2004) https://doi.org/10.1117/12.561307
Event: Second International Symposium on Fluctuations and Noise, 2004, Maspalomas, Gran Canaria Island, Spain

Abstract

This paper investigates the different effects of chaotic switching on Parrondo's games, as compared to random and periodic switching. The rate of winning of Parrondo's games with chaotic switching 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 approaches periodic behavior.

Citation Download Citation

Tze Wei Tang, Andrew G. Allison, and Derek Abbott "Parrondo's games with chaotic switching", Proc. SPIE 5471, Noise in Complex Systems and Stochastic Dynamics II, (25 May 2004); https://doi.org/10.1117/12.561307

ACCESS THE FULL ARTICLE