Sequential optimizing strategy in multi-dimensional bounded forecasting games |
| |
Authors: | Masayuki Kumon Akimichi Takemura Kei Takeuchi |
| |
Affiliation: | a Graduate School of Information Science and Technology, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japanb Emeritus, Graduate School of Economics, University of Tokyo, Japan |
| |
Abstract: | ![]() We propose a sequential optimizing betting strategy in the multi-dimensional bounded forecasting game in the framework of game-theoretic probability of Shafer and Vovk (2001) [10]. By studying the asymptotic behavior of its capital process, we prove a generalization of the strong law of large numbers, where the convergence rate of the sample mean vector depends on the growth rate of the quadratic variation process. The growth rate of the quadratic variation process may be slower than the number of rounds or may even be zero. We also introduce an information criterion for selecting efficient betting items. These results are then applied to multiple asset trading strategies in discrete-time and continuous-time games. In the case of a continuous-time game we present a measure of the jaggedness of a vector-valued continuous process. Our results are examined by several numerical examples. |
| |
Keywords: | Game-theoretic probability Hö lder exponent Information criterion Kullback-Leibler divergence Quadratic variation Strong law of large numbers Universal portfolio |
本文献已被 ScienceDirect 等数据库收录! |