Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T16:38:28.360Z Has data issue: false hasContentIssue false

On Parrondo's paradox: how to construct unfair games by composing fair games

Published online by Cambridge University Press:  17 February 2009

E. S. Key
Affiliation:
Department of Mathematical Sciences, University of Wisconsin Milwaukee, Milwaukee WI 53201, USA; e-mail: ericskey@uwm.edu.
M. M. Kłosek
Affiliation:
Department of Mathematical Sciences, University of Wisconsin Milwaukee, Milwaukee WI 53201, USA. Currently at the Center of Scientific Review, National Institutes of Health This article was written in a personal capacity and does not necessarily represent the opinions or reflect the views of the National Institutes of Health, the Department of Health and Human Services, or the Federal Government.
D. Abbott
Affiliation:
Centre for Biomedical Engineering (CBME), Department of Electrical & Electronic Engineering, University of Adelaide, Adelaide SA 5005Australia; e-mail: dabbott@eleceng.adelaide.edu.au.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We construct games of chance from simpler games of chance. We show that it may happen that the simpler games of chance are fair or unfavourable to a player and yet the new combined game is favourable—this is a counter-intuitive phenomenon known as Parrondo's paradox. We observe that all of the games in question are random walks in periodic environments (RWPE) when viewed on the proper time scale. Consequently, we use RWPE techniques to derive conditions under which Parrondo's paradox occurs.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2006