Derandomization in game-theoretic probability
The authors give a general method for constructing a deterministic strategy of reality from a randomized strategy in game-theoretic probability -- a probability theory based on a betting game between two players, skeptic and reality. In this theory, skeptic has winning strategy, if he can increase his capital to infinity without risking bankruptcy given some almost sure event does not happen. A number of skeptic winning strategies have been constructed so far corresponding to well known proofs in measure-theoretic probability that a certain event happens with probability one. There is no counterpart of reality's strategy in measure-theoretic probability, because in measure-theoretic probability reality is simply generating random variables under a given probability distribution without any specific strategy. Reality's strategies correspond to the notion of de-randomization, since if reality is following a strategy she is not random in the measure-theoretic sense.NEWLINENEWLINEThe construction of reality's strategy proposed in the paper goes as follows: {\parindent=6mm \begin{itemize} \item[1.] Take a randomized strategy. \item [2.] Construct a strategy of skeptic that forces the random event. \item [3.] Construct a strategy of reality using it.NEWLINENEWLINE\end{itemize}} Each step is straightforward and does not require coming up with a new strategy. Since this approach constructs a deterministic strategy from a randomized one, it is called de-randomization in game-theoretic probability. The generated strategy complies with the success and the failure of the strong law of large numbers. General theory of the notion of compliance as well as some examples are also presented.
- 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
- 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
- scientific article; zbMATH DE number 1955470 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Prequential randomness and probability
- Probability and Computing
- Probability and finance. It's only a game!
- The generality of the zero-one laws
- Randomization, derandomization and antirandomization: Three games
- When does a random Robin Hood win?
- Derandomizing Arthur-Merlin games under uniform assumptions
- Relation between the rate of convergence of strong law of large numbers and the rate of concentration of Bayesian prior in game-theoretic probability
- scientific article; zbMATH DE number 2080255 (Why is no real title available?)
- Random Perturbation in Games of Chance
- Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games
- Itô calculus without probability in idealized financial markets
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- 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)
