Applications of Genetic Algorithm on Optimal Sequence for Parrondo Games

Degang Wu, Kwok Yip Szeto

Abstract

Parrondo game, which introduction is inspired by the flashing Brownian ratchet, presents an apparently paradoxical situation at it shows that there are ways to combine two losing games into a winning one. The original Parrondo game consists of two individual games, game A and game B. Game A is a slightly losing coin-tossing game. Game B has two coins, with an integer parameter $M$. If the current cumulative capital (in discrete unit) is a multiple of $M$, an unfavorable coin $p_b$ is used, otherwise a favorable $p_g$ coin 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. In deterministic switching, one plays according to a sequence such as ABABB. Exhaustive search and backward induction have been applied to the search for optimal finite game sequence. In this paper, we apply genetic algorithm (GA) to search for optimal game sequences with a given length $N$ for large $N$. Based on results obtained through a problem-independent GA, we adapt the point mutation operator and one-point crossover operator to exploit the structure of the optimal game sequences. We show by numerical results the adapted problem-dependent GA has great improvement in performance.

References

  1. Allison, A. and Abbott, D. (2002). The physical basis for parrondo's games. Fluctuation and Noise Letters, 2(04):L327L341.
  2. Clote, P. (2005). An efficient algorithm to compute the landscape of locally optimal RNA secondary structures with respect to the nussinov-jacobson energy model. Journal of computational biology, 12(1):83101.
  3. Debenedetti, P. G. and Stillinger, F. H. (2001). percooled liquids and the glass transition. 410(6825):259267.
  4. Ding, Y.-S. and Zhang, T.-L. (2008). Using chous pseudo amino acid composition to predict subcellular localization of apoptosis proteins: An approach with immune genetic algorithm-based ensemble classifier. Pattern Recognition Letters, 29(13):1887-1892.
  5. Dinis, L. (2008). Optimal sequence for parrondo games. Physical Review E, 77(2):021124.
  6. Dinis, L. and Parrondo, J. M. R. (2003). Optimal strategies in collective parrondo games. Europhysics Letters (EPL), 63:319-325.
  7. Dins, L. and Parrondo, J. M. (2004). Inefficiency of voting in parrondo games. Physica A: Statistical Mechanics and its Applications, 343:701-711.
  8. Doye, J. P. (2002). Network topology of a potential energy landscape: A static scale-free network. Physical review letters, 88(23):238701.
  9. Fong, L. Y. and Szeto, K. Y. (2001). Rules extraction in short memory time series using genetic algorithms. The European Physical Journal B-Condensed Matter and Complex Systems, 20(4):569572.
  10. Goldberg, D. E. and Holland, J. H. (1988). Genetic algorithms and machine learning. Machine learning, 3(2):9599.
  11. Harmer, G. P. and Abbott, D. (1999). Game theory: Losing strategies can win by parrondo's paradox. Nature, 402(6764):864864.
  12. Harmer, G. P. and Abbott, D. (2002). A review of parrondos paradox. Fluctuation and Noise Letters, 2(2):R71R107.
  13. Holland, J. H. (1975). Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. U Michigan Press.
  14. Jiang, R., Szeto, K. Y., Luo, Y. P., and Hu, D. C. (2000). 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, page 2125.
  15. Messom, C. (2002). Genetic algorithms for auto-tuning mobile robot motion control.
  16. Parrondo, J. M. R. (1996). How to cheat a bad mathematician. EEC HC&M Network on Complexity and Chaos.
  17. Parrondo, J. M. R., Dinis, L., Garca-Torao, E., and Sotillo, B. (2007). Collective decision making and paradoxical games. The European Physical Journal Special Topics, 143(1):39-46.
  18. Patel, A. N., Davis, D., Guthrie, C. F., Tuk, D., Nguyen, T. T., Williams, J., and others (2005). Optimizing cyclic steam oil production with genetic algorithms. In SPE Western Regional Meeting. Society of Petroleum Engineers.
  19. Pond, S. L. K., Posada, D., Gravenor, M. B., Woelk, C. H., and Frost, S. D. W. (2006). GARD: a genetic algorithm for recombination detection. Bioinformatics, 22(24):3096-3098.
  20. Shiu, K. L. and Szeto, K. Y. (2008). Self-adaptive mutation only genetic algorithm: An application on the optimization of airport capacity utilization. In Intelligent Data Engineering and Automated LearningIDEAL 2008, page 428435. Springer.
  21. Szeto, K. Y. and Fong, L. Y. (2000). 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, page 505510. Springer.
  22. Toral, R., Amengual, P., and Mangioni, S. (2003). Parrondo's games as a discrete ratchet. Physica A: Statistical Mechanics and its Applications, 327(1-2):105- 110.
  23. Wagon, S. and Velleman, D. (2001). Parrondo's paradox. Mathematica in Education and Research, 9(3- 4):8590.
  24. Wales, D. J., Doye, J. P., Miller, M. A., Mortenson, P. N., and Walsh, T. R. (2000). Energy landscapes: from clusters to biomolecules. Advances in Chemical Physics, 115:1112.
  25. Wales, D. J., Miller, M. A., and Walsh, T. R. (1998). Archetypal energy landscapes. Nature, 394(6695):758760.
  26. Wu, D. and Szeto, K. Y. (2014). Extended parrondo's game and brownian ratchets: Strong and weak parrondo effect. Physical Review E, 89(2):022142.
  27. Xia, C., Guo, P., Shi, T., and Wang, M. (2004). 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, volume 2, page 6873.
Download


Paper Citation


in Harvard Style

Wu D. and Szeto K. (2014). Applications of Genetic Algorithm on Optimal Sequence for Parrondo Games . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014) ISBN 978-989-758-052-9, pages 30-37. DOI: 10.5220/0005070400300037


in Bibtex Style

@conference{ecta14,
author={Degang Wu and Kwok Yip Szeto},
title={Applications of Genetic Algorithm on Optimal Sequence for Parrondo Games},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014)},
year={2014},
pages={30-37},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005070400300037},
isbn={978-989-758-052-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014)
TI - Applications of Genetic Algorithm on Optimal Sequence for Parrondo Games
SN - 978-989-758-052-9
AU - Wu D.
AU - Szeto K.
PY - 2014
SP - 30
EP - 37
DO - 10.5220/0005070400300037