Skip to main content Accessibility help
×
×
Home

An asymmetric St. Petersburg game with trimming

  • Allan Gut (a1) and Anders Martin-Löf (a2)

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.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      An asymmetric St. Petersburg game with trimming
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      An asymmetric St. Petersburg game with trimming
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      An asymmetric St. Petersburg game with trimming
      Available formats
      ×

Copyright

Corresponding author

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

References

Hide All
[1]Adler, A. (1990).Generalized one-sided laws of the iterated logarithm for random variables barely with or without finite mean.J. Theoret. Prob. 3,587597.
[2]Adler, A. and Rosalsky, A. (1989).On the Chow-Robbins ``fair'' games problem.Bull. Inst. Math. Acad. Sinica 17,211227.
[3]Berkes, I.,Csáki, E. and Csörgő, S. (1999).Almost sure limit theorems for the St. Petersburg game.Statist. Prob. Lett. 45,2330.
[4]Berkes, I.,Györfi, L. and Kevei, P. (2017).Tail probabilities of St. Petersburg sums, trimmed sums, and their limit.J. Theoret. Prob. 30,11041129.
[5]Chow, Y. S. and Robbins, H. (1961).On sums of independent random variables with infinite moments and ``fair'' games.Proc. Nat. Acad. Sci. USA 47,330335.
[6]Csörgő, S. (2002).Rates of merge in generalized St. Petersburg games.Acta Sci. Math. (Szeged) 68,815847.
[7]Csörgő, S. (2007).Merging asymptotic expansions in generalized St. Petersburg games.Acta Sci. Math. (Szeged) 73,297331.
[8]Csörgő, S. and Simons, G. (1996).A strong law of large numbers for trimmed sums, with applications to generalized St. Petersburg games.Statist. Prob. Lett. 26,6573.
[9]Feller, W. (1945).Note on the law of large numbers and ``fair'' games.Ann. Math. Statist. 16,301304.
[10]Feller, W. (1968).An Introduction to Probability Theory and Its Applications, Vol. I,3rd edn.John Wiley,New York.
[11]Feller, W. (1971).An Introduction to Probability Theory and Its Applications, Vol. II,2nd edn.John Wiley,New York.
[12]Gut, A. (2004).An extension of the Kolmogorov-Feller weak law of large numbers with an application to the St. Petersburg game.J. Theoret. Prob. 17,769779.
[13]Gut, A. (2010).Limit theorems for a generalized St. Petersburg game.J. Appl. Prob. 47,752760. (Correction: available at http://www.math.uu.se/∼allan/86correction.pdf.)
[14]Gut, A. (2013).Probability: A Graduate Course,2nd edn.Springer,New York.
[15]Gut, A. and Martin-Löf, A. (2015).Extreme-trimmed St. Petersburg games.Statist. Prob. Lett. 96,341345.
[16]Gut, A. and Martin-Löf, A. (2015). Generalized St. Petersburg games revisited. Preprint. Available at https://arxiv.org/abs/1506.09015v1.
[17]Gut, A. and Martin-Löf, A. (2016).A maxtrimmed St. Petersburg game.J. Theoret. Prob. 29,277291.
[18]Martin-Löf, A. (1985).A limit theorem which clarifies the `Petersburg paradox'.J. Appl. Prob. 22,634643.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Advances in Applied Probability
  • ISSN: 0001-8678
  • EISSN: 1475-6064
  • URL: /core/journals/advances-in-applied-probability
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed