Parrondo's games with chaotic switching
Computer Science and Game Theory
2009-11-10 v1
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.
Keywords
Cite
@article{arxiv.cs/0404016,
title = {Parrondo's games with chaotic switching},
author = {T. W. Tang and A. Allison and D. Abbott},
journal= {arXiv preprint arXiv:cs/0404016},
year = {2009}
}
Comments
11 pages, 9 figures