Derandomization in game-theoretic probability

DOI10.1016/J.SPA.2014.08.004MaRDI QIDQ468727zbMATH OpenOpenAlexFDO

Authors 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 numberscompliancede-randomization

Mathematics Subject Classification ID

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

Abstract: We give a general method for constructing a deterministic strategy of Reality from a randomized strategy in game-theoretic probability. The construction can be seen as derandomization in game-theoretic probability.

Recommendations

• Convergence of random series and the rate of convergence of the strong law of large numbers in game-theoretic probability
• Purely game-theoretic random sequences. I: Strong law of large numbers and law of the iterated logarithm
• Randomization, derandomization and antirandomization: Three games
• On a simple strategy weakly forcing the strong law of large numbers in the bounded forecasting game
• Merging of opinions in game-theoretic probability

Cites work

• scientific article; zbMATH DE number 1955470 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• A polynomial-time algorithm for computing absolutely normal numbers
• Algorithmic randomness and complexity.
• Classical recursion theory. Vol. II
• Computability and randomness
• Computational Complexity
• Computational Complexity
• Convergence of random series and the rate of convergence of the strong law of large numbers in game-theoretic probability
• Degrees of Unsolvability. (AM-55)
• Game-theoretic versions of strong law of large numbers for unbounded variables
• Prequential randomness and probability
• Probability and Computing
• Probability and finance. It's only a game!
• The generality of the zero-one laws

Cited in

(10)

• scientific article; zbMATH DE number 2080255 (Why is no real title available?)
• When does a random Robin Hood win?
• Itô calculus without probability in idealized financial markets
• Derandomizing Arthur-Merlin games under uniform assumptions
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Randomization, derandomization and antirandomization: Three games
• Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games
• Random Perturbation in Games of Chance
• Relation between the rate of convergence of strong law of large numbers and the rate of concentration of Bayesian prior in game-theoretic probability
• Derandomizing Arthur-Merlin games using hitting sets

This page was built for publication: Derandomization in game-theoretic probability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468727)