|
This article is cited in 1 scientific paper (total in 1 paper)
Purely game-theoretic random sequences: I. Strong law of large numbers and law of the iterated logarithm
M. Minozzo Department of Statistical Sciences, University of Perugia, Italy
Abstract:
Random sequences are usually defined with respect to a probability distribution $\mathbf{P}$ (a $\sigma$-additive set function, normed to one, defined over a $\sigma$-algebra) assuming Kolmogorov's axioms for probability theory. In this paper, without using this axiomatics, we give a definition of random (typical) sequences taking as primitive the notion of a martingale and using the principle of the excluded gambling strategy. In this purely game-theoretic framework, no probability distribution or, partially or fully specified, system of conditional probability distributions needs to be introduced. For these typical sequences, we prove direct algorithmic versions of Kolmogorov's strong law of large numbers (SLLN) and of the upper half of Kolmogorov's law of the iterated logarithm (LIL).
Keywords:
algorithmic probability theory, almost sure limit theorems, martingales, typical sequences.
Received: 17.07.1997 Revised: 11.11.1998
Citation:
M. Minozzo, “Purely game-theoretic random sequences: I. Strong law of large numbers and law of the iterated logarithm”, Teor. Veroyatnost. i Primenen., 44:3 (1999), 617–630; Theory Probab. Appl., 44:3 (2000), 511–522
Linking options:
https://www.mathnet.ru/eng/tvp806https://doi.org/10.4213/tvp806 https://www.mathnet.ru/eng/tvp/v44/i3/p617
|
|