Parrondo对策的最优序列
Optimal sequence for Parrondo games
摘要：
为了计算Parrondo博弈中的最优博弈序列，设计了一种基于逆向归纳的算法。该算法可用于寻找任何有限圈数或稳态的最优序列，表明ABABB…是具有最高稳态平均增益的序列。该算法也可以推广到找到最佳的自适应策略，在一个多玩家版本的游戏，其中有限数量的玩家可以选择，在每一个回合，整个合奏应该玩的游戏。
英文摘要：
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 generalised to find the optimal adaptive strategy in a multi-player version of the games, where a finite number of players may choose, at every turn, the game the whole ensemble should play.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
