Change search
ReferencesLink to record
Permanent link

Direct link
Extreme-trimmed St. Petersburg games
Stockholm University, Faculty of Science, Department of Mathematics.
2015 (English)In: Statistics and Probability Letters, ISSN 0167-7152, Vol. 96, 341-345 p.Article in journal (Refereed) Published
Abstract [en]

Let S-n, n >= 1, describe the successive sums of the payoffs in the classical St. Petersburg game. Feller's famous weak law, Feller (1945), states that s(n)/n log(2) n (sic) 1 as n -> infinity. However, almost sure convergence fails, more precisely, lim supn ->infinity S-n/n log(2) n = +infinity a.s. and lim inf(n ->infinity) S-n/n log(2) n = 1 a.s. as n -> infinity. Csorgo and Simons (1996) have shown that almost sure convergence holds for trimmed sums, that is, for S-n - max(1 <= k <= n) X-k and, moreover, that this remains true if the sums are trimmed by an arbitrary fixed number of maximal sums. A predecessor of the present paper was devoted to sums trimmed by the random number of maximal summands. The present paper concerns analogs for the random number of summands equal to the minimum, as well as analogs for joint trimmings.

Place, publisher, year, edition, pages
2015. Vol. 96, 341-345 p.
Keyword [en]
St. Petersburg game, Trimmed sums, LLN, Convergence along subsequences
National Category
URN: urn:nbn:se:su:diva-113560DOI: 10.1016/j.spl.2014.09.006ISI: 000346894500046OAI: diva2:786534


Available from: 2015-02-05 Created: 2015-02-04 Last updated: 2015-02-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Martin-Löf, Anders
By organisation
Department of Mathematics
In the same journal
Statistics and Probability Letters

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 22 hits
ReferencesLink to record
Permanent link

Direct link