Related papers: Betting strategies with bounded splits
Whether Kolmogorov-Loveland randomness (KLR) is the same as Martin-L\"of randomness (MLR) is a major open problem in the study of algorithmic randomness. More general classes of betting strategies than Kolmogorov-Loveland ones have been…
We introduce the sequence-set betting game, a generalization of An. A. Muchnik's non-monotonic betting game. Instead of successively partitioning the infinite binary strings by their value of a bit at a chosen position, as in the…
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Martin-Loef randomness and computable randomness. The latter…
We study the problem of whether a betting-strategy can be decomposed into an equivalent set of simpler betting-strategies, such as betting-strategies that bet on a restricted set of stages or bet on a restricted of favorable outcomes. We…
Randomness in the sense of Martin-L\"of can be defined in terms of lower semicomputable supermartingales. We show that such a supermartingale cannot be replaced by a pair of supermartingales that bet only on the even bits (the first one)…
Muchnik's paradox says that enumerable betting strategies are not always reducible to enumerable strategies whose bets are restricted to either even rounds or odd rounds. In other words, there are outcome sequences x where an effectively…
In two-player finite-state stochastic games of partial observation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distribution over the successor states.…
The Ku\v{c}era-G\'acs theorem is a landmark result in algorithmic randomness asserting that every real is computable from a Martin-L\"of random real. If the computation of the first $n$ bits of a sequence requires $n+h(n)$ bits of the…
Suppose that the outcomes of a roulette table are not entirely random, in the sense that there exists a successful betting strategy. Is there a successful `separable' strategy, in the sense that it does not use the winnings from betting on…
We consider turn-based stochastic two-player games with a combination of a parity condition that must hold surely, that is in all possible outcomes, and of a parity condition that must hold almost-surely, that is with probability 1. The…
Chances of a gambler are always lower than chances of a casino in the case of an ideal, mathematically perfect roulette, if the capital of the gambler is limited and the minimum and maximum allowed bets are limited by the casino. However, a…
A decision maker observes the evolving state of the world while constantly trying to predict the next state given the history of past states. The ability to benefit from such predictions depends not only on the ability to recognize patters…
We consider multiplayer stochastic games in which the payoff of each player is a bounded and Borel-measurable function of the infinite play. By using a generalization of the technique of Martin (1998) and Maitra and Sudderth (1998), we show…
Suppose a gambler starts with a fortune in (0,1) and wishes to attain a fortune of 1 by making a sequence of bets. Assume thay whenever the gambler stakes the amount s, the gambler's fortune increases by s with probability w and decreases…
Can a probabilistic gambler get arbitrarily rich when all deterministic gamblers fail? We study this problem in the context of algorithmic randomness, introducing a new notion -- almost everywhere computable randomness. A binary sequence…
Kolmogorovs axiomatic framework is the best-known approach to describing probabilities and, due to its use of the Lebesgue integral, leads to remarkably strong continuity properties. However, it relies on the specification of a probability…
Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a…
In this paper, we prove the following Theorems 1. An extremally disconnected space $X$ has the semi-Menger property if and only if One does not have a winning strategy in the game $G_{fin}(sO,sO)$. 2. An extremally disconnected space $X$…
In Major League Baseball, strategy and planning are major factors in determining the outcome of a game. Previous studies have aided this by building machine learning models for predicting the winning team of any given game. We extend this…
Consider a gambling game in which we are allowed to repeatedly bet a portion of our bankroll at favorable odds. We investigate the question of how to minimize the expected number of rounds needed to increase our bankroll to a given target…