Abstract
Comparison of simple genetic algorithm with motif preserving genetic algorithm is made for the sequence analysis of Parrondo games, which is an analogue to the flashing Brownian ratchet in non-equilibrium statistical physics. The original Parrondo game consists of two individual games: game A and game B. Here game A is a coin-tossing game with winning probability \(p_A\) slightly less than half, so that its persistent usage will be losing in the long run. Game B has two coins, and an integer parameter M. If the current cumulative capital (in discrete unit) is a multiple of M, an unfavorable coin with winning probability \(p_b<0.5\) is used, otherwise a favorable coin with winning probability \(p_g>0.5\) is used. Game B is also a losing game if played alone. Paradoxically, combination of game A and game B could lead to a winning game, either through random mixture, or deterministic switching. The resolution of this paradox can be made using Markov Chain analysis [1]. In this paper, we are interested in the analysis of finite deterministic switching sequences of N Parrondo game, so the number of possible sequences is \(2^N\). For small N, exhaustive search and backward induction have been applied successfully to short sequences. However, for long but finite deterministic sequence, the optimal ordering of games requires the use of combinatorial optimization techniques. Here we employ genetic algorithm to find the optimal game sequence. The structure found in short sequences using a problem-independent genetic algorithm, such as ABABB, is a motif. Using these motifs we invent motif-preserving point mutation operator and one-point crossover operator to exploit the structure of the optimal game sequences for large N. We show by numerical results the adapted motif-preserving genetic algorithm has great improvement in solution quality over simple genetic algorithm. The technique of motif preserving genetic algorithm can be applied to similar problem in sequence analysis once the condition of optimality is defined.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Wu, D., Szeto, K.Y.: Extended parrondo’s game and brownian ratchets: strong and weak parrondo effect. Phys. Rev. E 89, 022142 (2014)
Parrondo, J.M.R.: How to Cheat a Bad Mathematician. EEC HC&M Network on Complexity and Chaos (1996)
Allison, A., Abbott, D.: The physical basis for parrondo’s games. Fluctuation Noise Lett. 2, L327–L341 (2002)
Toral, R., Amengual, P., Mangioni, S.: Parrondo’s games as a discrete ratchet. Phys. A Stat. Mech. Appl. 327, 105–110 (2003)
Dinis, L.: Optimal sequence for parrondo games. Phys. Rev. E 77, 021124 (2008)
Dinis, L., Parrondo, J.M.R.: Optimal strategies in collective parrondo games. Europhys. Lett. (EPL) 63, 319–325 (2003)
Dins, L., Parrondo, J.M.: Inefficiency of voting in parrondo games. Phys. A Stat. Mech. Appl. 343, 701–711 (2004)
Parrondo, J.M.R., Dinis, L., Garca-Torao, E., Sotillo, B.: Collective decision making and paradoxical games. Eur. Phys. J. Special Topics 143, 39–46 (2007)
Goldberg, D.E., Holland, J.H.: Genetic algorithms and machine learning. Mach. Learn. 3, 9599 (1988)
Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. U Michigan Press (1975)
Clote, P.: An efficient algorithm to compute the landscape of locally optimal RNA secondary structures with respect to the nussinov-jacobson energy model. J. Comput. Biol. 12, 83101 (2005)
Ding, Y.S., Zhang, T.L.: Using chous pseudo amino acid composition to predict subcellular localization of apoptosis proteins: An approach with immune genetic algorithm-based ensemble classifier. Pattern Recogn. Lett. 29, 1887–1892 (2008)
Pond, S.L.K., Posada, D., Gravenor, M.B., Woelk, C.H., Frost, S.D.W.: GARD: a genetic algorithm for recombination detection. Bioinformatics 22, 3096–3098 (2006)
Doye, J.P.: Network topology of a potential energy landscape: a static scale-free network. Phys. Rev. Lett. 88, 238701 (2002)
Wales, D.J., Doye, J.P., Miller, M.A., Mortenson, P.N., Walsh, T.R.: Energy landscapes: from clusters to biomolecules. Adv. Chem. Phys. 115, 1112 (2000)
Wales, D.J., Miller, M.A., Walsh, T.R.: Archetypal energy landscapes. Nature 394, 758760 (1998)
Debenedetti, P.G., Stillinger, F.H.: Supercooled liquids and the glass transition. Nature 410, 259267 (2001)
Patel, A.N., Davis, D., Guthrie, C.F., Tuk, D., Nguyen, T.T., Williams, J., et al.: Optimizing cyclic steam oil production with genetic algorithms. In: SPE Western Regional Meeting, Society of Petroleum Engineers (2005)
Xia, C., Guo, P., Shi, T., Wang, M.: Speed control of brushless DC motor using genetic algorithm based fuzzy controller. In: Proceeding of the 2004 International Conference on Intelligent Mechatronics and Automation, Chengdu, China, 3rd edn. A Treatise on Electricity and Magnetism, vol 2, pp. 68–73 (2004)
Shiu, K.L., Szeto, K.Y.: Self-adaptive mutation only genetic algorithm: an application on the optimization of airport capacity utilization. In: Intelligent Data Engineering and Automated Learning IDEAL 2008, pp. 428–435. Springer (2008)
Messom, C.: Genetic Algorithms for Auto-tuning Mobile Robot Motion Control. (2002)
Fong, L.Y., Szeto, K.Y.: Rules extraction in short memory time series using genetic algorithms. Eur. Phys. J. B 20, 569572 (2001)
Szeto, K.Y., Fong, L.Y.: How adaptive agents in stock market perform in the presence of random news: a genetic algorithm approach. In: Intelligent Data Engineering and Automated LearningIDEAL 2000. Data Mining, Financial Engineering, and Intelligent Agents, pp. 505–510. Springer (2000)
Jiang, R., Szeto, K.Y., Luo, Y.P., Hu, D.C.: Distributed parallel genetic algorithm with path splitting scheme for the large traveling salesman problems. In: Proceedings of Conference on Intelligent Information Processing, 16th World Computer Congress, pp. 21–25 (2000)
Harmer, G.P., Abbott, D.: Game theory: losing strategies can win by parrondo’s paradox. Nature 402, 864–864 (1999)
Harmer, G.P., Abbott, D.: A review of parrondos paradox. Fluctuation and Noise Lett. 2, R71–R107 (2002)
Wagon, S., Velleman, D.: Parrondo’s paradox. Math. Educ. Res. 9, 8590 (2001)
Acknowledgments
K.Y. Szeto acknowledges the support of grant FS GRF13SC25 and FS GRF14SC28. Degang Wu would like to thank Zhangyu Chang and Claus Aranha for helpful discussions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Wu, D., Szeto, K.Y. (2016). Sequence Analysis with Motif-Preserving Genetic Algorithm for Iterated Parrondo Games. In: Merelo, J.J., Rosa, A., Cadenas, J.M., Dourado, A., Madani, K., Filipe, J. (eds) Computational Intelligence. IJCCI 2014. Studies in Computational Intelligence, vol 620. Springer, Cham. https://doi.org/10.1007/978-3-319-26393-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-26393-9_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26391-5
Online ISBN: 978-3-319-26393-9
eBook Packages: EngineeringEngineering (R0)