RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Teor. Veroyatnost. i Primenen.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Teor. Veroyatnost. i Primenen., 1999, Volume 44, Issue 3, Pages 617–630 (Mi tvp806)  

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.

DOI: https://doi.org/10.4213/tvp806

Full text: PDF file (804 kB)

English version:
Theory of Probability and its Applications, 2000, 44:3, 511–522

Bibliographic databases:

Received: 17.07.1997
Revised: 11.11.1998
Language:

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

Citation in format AMSBIB
\Bibitem{Min99}
\by M.~Minozzo
\paper Purely game-theoretic random sequences:~I. Strong law of large numbers and law of the iterated logarithm
\jour Teor. Veroyatnost. i Primenen.
\yr 1999
\vol 44
\issue 3
\pages 617--630
\mathnet{http://mi.mathnet.ru/tvp806}
\crossref{https://doi.org/10.4213/tvp806}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1805823}
\zmath{https://zbmath.org/?q=an:0967.60027}
\transl
\jour Theory Probab. Appl.
\yr 2000
\vol 44
\issue 3
\pages 511--522
\crossref{https://doi.org/10.1137/S0040585X97977768}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000090154300005}


Linking options:
  • http://mi.mathnet.ru/eng/tvp806
  • https://doi.org/10.4213/tvp806
  • http://mi.mathnet.ru/eng/tvp/v44/i3/p617

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
    Cycle of papers
  • Теория вероятностей и ее применения Theory of Probability and its Applications
    Number of views:
    This page:158
    Full text:71
    First page:8

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021