Abstract
In this paper, we show that a generalized form of Parrondo's paradoxical game can be applied to discrete systems, working out the logistic map as a concrete example, to generate stable orbits. Written in Parrondo's terms, this reads: chaos1 + chaos2 + ⋯ + chaosN = order, where chaosi, i = 1, 2, …, N, are denoted as the chaotic behaviors generated by N values of the parameter control, and by order one understands some stable behavior. The numerical results are sustained by quantitative dynamics generated by Parrondo's game. The implementation of the generalized Parrondo's game is realized here via the parameter switching (PS) algorithm for continuous-time systems [Danca, 2013] adapted to the logistic map. Some related results for more general maps on averaging, which represent discrete analogies of the PS method for ODE, are also presented and discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
