Abstract
We consider infinite games where a gambler plays a coin-tossing game against an adversary. The gambler puts stakes on heads or tails, and the adversary tosses a fair coin, but has to choose his outcome according to a previously given law known to the gambler. In other words, the adversary is not allowed to play all infinite heads-tails-sequences, but only a certain subset F of them.
We present an algorithm for the player which, depending on the structure of the set F, guarantees an optimal exponent of increase of the player’s capital, independently on which one of the allowed heads-tails-sequences the adversary chooses.
Using the known upper bound on the exponent provided by the maximum Kolmogorov complexity of sequences in F we show the optimality of our result.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. Calude, Information and Randomness. An Algorithmic Perspective. Springer-Verlag, Berlin, 1994.
G. A. Edgar, Measure, Topology, and Fractal Geometry. Springer, New York, 1990.
K.J. Falconer, Fractal Geometry. Wiley, Chichester, 1990.
M. Li and P.M.B. Vitânyi, An Introduction to Kolmogorov Complexity and its Applications. Springer—Verlag, New York, 1993.
B. Ya. Ryabko, “Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity”, Problemy Peredachi Informatsii, 22 1986, No. 3, 16–26 (in Russian; English tranitation: Problems of Information Transmission, 22, 1986, No. 3, 170–179 ).
B. Ya. Ryabko, “An algorithmic approach to prediction problems”, Problemy Peredachi Informatsii, 29, 1993, No. 2, 96–103 (in Russian).
C.P. Schnorr, Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Math. No. 218, Springer-Verlag, Berlin 1971.
L. Staiger, “Kolmogorov complexity and Hausdorff dimension”, Inform. and Comput., 102, 1993, No. 2, 159 — 194.
L. Staiger, “w-languages”, Handbook of Formal Languages, (G. Rozenberg and A. Salomaa Eds.), Vol. 3, Springer-Verlag, Berlin 1997, 339 — 387.
L. Staiger, “A tight upper bound on Kolmogorov complexity and uniformly optimal prediction”, Theory of Computing Systems, 31, 1998, 215 — 229.
M. van Lambalgen, Random sequences, Ph. D. Thesis, Univ. of Amsterdam, 1987.
A.K. Zvonkin and L.A. Levin, “Complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms”, Russian Math. Surveys, 25, 1970, 83 —124.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Staiger, L. (2000). How Much can You Win when Your Adversary is Handicapped?. In: Althöfer, I., et al. Numbers, Information and Complexity. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6048-4_34
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6048-4_34
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4967-7
Online ISBN: 978-1-4757-6048-4
eBook Packages: Springer Book Archive