The notion of a strategy in the multi-player version of the Parrondo game is reviewed. We calculate the gain for the greedy strategy as a function of the number N of players, including exact analytic results for N < 4 and in the limit N→∞. We show that the greedy strategy is optimal for N = 1 and N = 2 but not for N = 3. In the limit N→∞ our analysis reveals a very rich behavior including the possibility of phase transitions as a function of the chosen strategy.

Date Published: 25 May 2004
PDF: 10 pages
Proc. SPIE 5471, Noise in Complex Systems and Stochastic Dynamics II, (25 May 2004); doi: 10.1117/12.544274

Published in SPIE Proceedings Vol. 5471:
Noise in Complex Systems and Stochastic Dynamics II
Zoltan Gingl, Editor(s)