Boosting Brownian-inspired games with network synchronization

In this study, we have applied a mean-field synchronization approach to a network of dynamic agents. We consider a network of connecting agents whose positions are affected by mean-field synchronization. Based on this position, one can choose which of the two Parrondo's games to play using a decision-making heuristic. This study reveals the counterintuitive result of achieving a winning outcome by combining two losing strategies through network synchronization and utilizing a real-world decision-making heuristic of preferences. We have also investigated the effects of varying network parameters on the emergence of Parrondo's paradox.