An asymmetric St. Petersburg game with trimming
- 1 December 2018
- journal article
- research article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 50 (A) , 115-129
Abstract
Let Sn,n≥1, be the successive sums of the payoffs in the classical St. Petersburg game. The celebrated Feller weak law states that Sn∕(nlog2n)→ℙ1 as n→∞. In this paper we review some earlier results of ours and extend some of them as we consider an asymmetric St. Petersburg game, in which the distribution of the payoff X is given by ℙ(X=srk-1)=pqk-1,k=1,2,…, where p+q=1 and s,r>0. Two main results are extensions of the Feller weak law and the convergence in distribution theorem of Martin-Löf (1985). Moreover, it is well known that almost-sure convergence fails, though Csörgő and Simons (1996) showed that almost-sure convergence holds for trimmed sums and also for sums trimmed by an arbitrary fixed number of maxima. In view of the discreteness of the distribution we focus on `max-trimmed sums', that is, on the sums trimmed by the random number of observations that are equal to the largest one, and prove limit theorems for simply trimmed sums, for max-trimmed sums, as well as for the `total maximum'. Analogues with respect to the random number of summands equal to the minimum are also obtained and, finally, for joint trimming.Keywords
This publication has 12 references indexed in Scilit:
- Extreme-trimmed St. Petersburg gamesStatistics & Probability Letters, 2015
- A Maxtrimmed St. Petersburg GameJournal of Theoretical Probability, 2014
- Limit Theorems for a Generalized ST Petersburg GameJournal of Applied Probability, 2010
- An Extension of the Kolmogorov–Feller Weak Law of Large Numbers with an Application to the St. Petersburg GameJournal of Theoretical Probability, 2004
- Almost sure limit theorems for the St. Petersburg gameStatistics & Probability Letters, 1999
- A strong law of large numbers for trimmed sums, with applications to generalized St. Petersburg games*1Statistics & Probability Letters, 1996
- Generalized one-sided laws of the iterated logarithm for random variables barely with or without finite meanJournal of Theoretical Probability, 1990
- A limit theorem which clarifies the ‘Petersburg Paradox'Journal of Applied Probability, 1985
- ON SUMS OF INDEPENDENT RANDOM VARIABLES WITH INFINITE MOMENTS AND „FAIR” GAMESProceedings of the National Academy of Sciences, 1961
- Note on the Law of Large Numbers and "Fair" GamesThe Annals of Mathematical Statistics, 1945