One Dimensional Asynchronous Cooperative Parrondo's Games

Simple item page
dc.creatorMihailovic, Zoran
dc.creatorRajkovic, Milan
dc.date2003-07-09
dc.date.accessioned2026-07-07T02:52:15Z
dc.date.available2026-07-07T02:52:15Z
dc.descriptionAn analytical result and an algorithm are derived for the probability distribution of the one-dimensional cooperative Parrondo's games. We show that winning and the occurrence of the paradox depends on the number of players. Analytical results are compared to the results of the computer simulation and to the results based on the mean-field approach.
dc.description10 pages, 4 figures, submitted to Fluctuations and Noise Letters
dc.identifierhttps://arxiv.org/abs/cond-mat/0307193
dc.identifierhttp://arxiv.org/abs/cond-mat/0307193
dc.identifierFluct. Noise Lett. 3 (2003) L389-L398
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/21770
dc.subjectStatistical Mechanics
dc.titleOne Dimensional Asynchronous Cooperative Parrondo's Games
dc.typetext

Files

Collections

arXiv