Implications of contrarian and one-sided strategies for the fair-coin game

Yasunori Horikoshi and Akimichi Takemura

Papers from arXiv.org

Abstract: We derive some results on contrarian and one-sided strategies by Skeptic for the fair-coin game in the framework of the game-theoretic probability of Shafer and Vovk \cite{sv}. In particular, concerning the rate of convergence of the strong law of large numbers (SLLN), we prove that Skeptic can force that the convergence has to be slower than or equal to $O(n^{-1/2})$. This is achieved by a very simple contrarian strategy of Skeptic. This type of result, bounding the rate of convergence from below, contrasts with more standard results of bounding the rate of SLLN from above by using momentum strategies. We also derive a corresponding one-sided result.

Date: 2007-03
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Published in Stochastic Processes and their Applications 118 (2008) 2125-2142

Downloads: (external link)
http://arxiv.org/pdf/math/0703743 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:math/0703743

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().