Abstract
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincide. One notion is the prequential version of the measure-theoretic definition due to Martin-Löf, and the other is the prequential version of the game-theoretic definition due to Schnorr and Levin. This is another manifestation of the close relation between the two main paradigms of randomness.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bienvenu, L.: Caractérisations de l’aléatoire par les jeux: impredictibilité et stochasticité. PhD thesis, Université de Provence (2008)
Chernov, A., Shen, A., Vereshchagin, N., Vovk, V.: On-line probability, complexity and randomness. These Proceedings
Dawid, A.P.: Statistical theory: the prequential approach. Journal of the Royal Statistical Society A 147, 278–292 (1984)
Dawid, A.P.: Calibration-based empirical probability (with discussion). Annals of Statistics 13, 1251–1285 (1985)
Dawid, A.P.: Prequential analysis. In: Kotz, S., Read, C.B., Banks, D.L. (eds.) Encyclopedia of Statistical Sciences, vol. 1, pp. 464–470. Wiley, New York (1997)
Dawid, A.P., Vovk, V.: Prequential probability: principles and properties. Bernoulli 5, 125–162 (1999)
Engelking, R.: General Topology, 2nd edn. Heldermann, Berlin (1989)
Gács, P.: Exact expressions for some randomness tests. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 26, 385–394 (1980)
Gács, P.: Uniform test of algorithmic randomness over a general space. Theoretical Computer Science 341, 91–137 (2005)
Kelly, J.L.: A new interpretation of information rate. Bell System Technical Journal 35, 917–926 (1956)
Kolmogorov, A.N., Uspensky, V.A.: Algorithms and randomness. Theory of Probability and Its Applications 32, 389–412 (1987); Teopия вepoятностeй и ee пpимeнeния 32(3), 425–455 (1987) (Russian original)
Levin, L.A.: On the notion of a random sequence. Soviet Mathematics Doklady 14, 1413–1416 (1973); Доклады AN SSSR 212(1), 548–550 (1973) (Russian original)
Levin, L.A.: Uniform tests of randomness. Soviet Mathematics Doklady 17, 337–340 (1976); Доклады AN SSSR 227(1), 33–35, (1976) (Russian original) Erratum: 227(1), 33–35 (1976)
Martin-Löf, P.: The definition of random sequences. Information and Control 9, 602–619 (1966)
Martin-Löf, P.: Notes on Constructive Mathematics. Almqvist & Wiksell, Stockholm (1970)
Pearl, J.: Causal diagrams for empirical research (with discussion). Biometrika 82, 669–710 (1995)
Pearl, J.: Causation, action and counterfactuals. In: Gammerman, A. (ed.) Computational Learning and Probabilistic Reasoning, ch. 6, pp. 103–124. Wiley, Chichester (1996)
Schnorr, C.P.: Zufälligkeit und Wahrscheinlichkeit. Springer, Berlin (1971)
Shafer, G., Vovk, V.: Probability and Finance: It’s Only a Game. Wiley, New York (2001)
Ville, J.: Etude critique de la notion de collectif. Gauthier-Villars, Paris (1939)
Vovk, V., V’yugin, V.V.: On the empirical validity of the Bayesian method. Journal of Royal Statistical Society B 55, 253–266 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vovk, V., Shen, A. (2008). Prequential Randomness. In: Freund, Y., Györfi, L., Turán, G., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 2008. Lecture Notes in Computer Science(), vol 5254. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87987-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-87987-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87986-2
Online ISBN: 978-3-540-87987-9
eBook Packages: Computer ScienceComputer Science (R0)