Phys. Rev. E 77, 021124 (2008) [6 pages]Optimal sequence for Parrondo gamesReceived 14 November 2007; published 26 February 2008 An algorithm based on backward induction is devised in order to compute the optimal sequence of games to be played in Parrondo games. The algorithm can be used to find the optimal sequence for any finite number of turns or in the steady state, showing that ABABB… is the sequence with the highest steady state average gain. The algorithm can also be generalized to find the optimal adaptive strategy in a multiplayer version of the games, where a finite number of players may choose, at every turn, the game the whole ensemble should play. © 2008 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevE.77.021124
DOI:
10.1103/PhysRevE.77.021124
PACS:
05.40.−a, 02.30.Yy
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.