DeepAI AI Chat
Log In Sign Up

Aspects of Muchnik's paradox in restricted betting

by   George Barmpalias, et al.

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 enumerable strategy succeeds, but no such parity-restricted effectively enumerable strategy does. We characterize the effective Hausdorff dimension of such x, showing that it can be as low as 1/2 but not less. We also show that such reals that are random with respect to parity-restricted effectively enumerable strategies with packing dimension as low as log√(3). Finally we exhibit Muchnik's paradox in the case of computable integer-valued strategies.


page 1

page 2

page 3

page 4


Strategy Complexity of Parity Objectives in Countable MDPs

We study countably infinite MDPs with parity objectives. Unlike in finit...

Online Two-Dimensional Vector Packing with Advice

We consider the online two-dimensional vector packing problem, showing a...

Rounds, Color, Parity, Squares

This is a sequel to our paper "Permute, Graph, Map, Derange", involving ...

Monotonous betting strategies in warped casinos

Suppose that the outcomes of a roulette table are not entirely random, i...

Parity Games with Weights

Quantitative extensions of parity games have recently attracted signific...

Hamiltonian cycles and paths in hypercubes with disjoint faulty edges

An n-dimensional hypercube Q_n, is an undirected graph with 2^n nodes, e...

Permutations With Restricted Movement

We study restricted permutations of sets which have a geometrical struct...