Hostname: page-component-7b7567c8c-8p88z Total loading time: 0 Render date: 2026-11-19T08:42:17.267Z Has data issue: false hasContentIssue false

An asymmetric St. Petersburg game with trimming

Published online by Cambridge University Press:  01 February 2019

Allan Gut*
Affiliation:
Uppsala University
Anders Martin-Löf*
Affiliation:
Stockholm University
*
Department of Mathematics, Uppsala University, Box 480, SE-751 06 Uppsala, Sweden. Email address: allan.gut@math.uu.se
Department of Mathematics, Stockholm University, SE-106 91 Stockholm, Sweden. Email address: andersml@math.su.se
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Original Article
Copyright
Copyright © Applied Probability Trust 2018