A gambler that bets forever and the strong law of large numbers
From MaRDI portal
Publication:5037313
Abstract: In this expository note, we give a simple proof that a gambler repeating a game with positive expected value never goes broke with a positive probability. This does not immediately follow from the strong law of large numbers or other basic facts on random walks. Using this result, we provide an elementary proof of the strong law of large numbers. The ideas of the proofs come from the maximal ergodic theorem and Birkhoff's ergodic theorem.
Recommendations
- The strong limit theorem of bounded gambling system
- Game-theoretic versions of strong law of large numbers for unbounded variables
- scientific article; zbMATH DE number 1932355
- Weak laws of large numbers for cooperative gamblers
- An extension of the Kolmogorov-Feller weak law of large numbers with an application to the St. Petersburg game
Cites work
Cited in
(2)
This page was built for publication: A gambler that bets forever and the strong law of large numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037313)