Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Parrondo Paradox in Scale Free Networks (1206.2733v1)

Published 13 Jun 2012 in physics.soc-ph and cs.SI

Abstract: Parrondo's paradox occurs in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. Several variations of Parrondo's games with paradoxical property have been introduced. In this paper, I examine whether Parrondo's paradox occurs or not in scale free networks. Two models are discussed by some theoretical analyses and computer simulations. As a result, I prove that Parrondo's paradox occurs only in the second model.

Summary

We haven't generated a summary for this paper yet.