Derandomization in game-theoretic probability

DOI10.1016/j.spa.2014.08.004zbMath1403.91056arXiv1402.5513OpenAlexW2051017920MaRDI QIDQ468727

Kenshi Miyabe, Akimichi Takemura

Publication date: 7 November 2014

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.5513

zbMATH Keywords

game theorystrong law of large numbersde-randomizationcompliance

Mathematics Subject Classification ID

2-person games (91A05) Strong limit theorems (60F15) Other game-theoretic models (91A40) Probabilistic measure theory (60A10)

Related Items

Itô calculus without probability in idealized financial markets ⋮ Relation between the rate of convergence of strong law of large numbers and the rate of concentration of Bayesian prior in game-theoretic probability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time algorithm for computing absolutely normal numbers
• The generality of the zero-one laws
• Convergence of random series and the rate of convergence of the strong law of large numbers in game-theoretic probability
• Prequential randomness and probability
• Classical recursion theory. Vol. II
• Probability and Finance
• Algorithmic Randomness and Complexity
• Computational Complexity
• Game-theoretic versions of strong law of large numbers for unbounded variables
• Probability and Computing
• Degrees of Unsolvability. (AM-55)
• Computational Complexity