On Parrondo's paradox: how to construct unfair games by composing fair games
From MaRDI portal
Publication:3430021
DOI10.1017/S1446181100010099zbMath1147.60061arXivmath/0206151OpenAlexW2145414427MaRDI QIDQ3430021
M. M. Kłosek, Derek Abbott, Eric S. Key
Publication date: 20 March 2007
Published in: The ANZIAM Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0206151
2-person games (91A05) Processes in random environments (60K37) Probabilistic games; gambling (91A60)
Related Items (2)
Cites Work
- Quantum strategies
- Recurrence and transience criteria for random walk in a random environment
- Computable examples of the maximal Lyapunov exponent
- Parrondo's paradox.
- How to benefit from noise
- Optimal Investment Strategy for Risky Assets
- Quantum Games and Quantum Strategies
- Quantum Gambling
- Efficient generation of fair dice with few biased coins
This page was built for publication: On Parrondo's paradox: how to construct unfair games by composing fair games