Parrondo's games with chaotic switching

Tze Wei Tang; Andrew G. Allison; Derek Abbott

doi:10.1117/12.561307

25 May 2004 Parrondo's games with chaotic switching

Tze Wei Tang, Andrew G. Allison, Derek Abbott

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

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available