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. 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.

Full Text
Paper version not known

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 call

Disclaimer: 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.