Irreducibility of enumerable betting strategies
George Barmpalias, Lu Liu

TL;DR
This paper demonstrates that certain classes of enumerable betting strategies are fundamentally irreducible, showing that complex strategies cannot be simplified into more restricted forms, with implications for understanding randomness and supermartingales.
Contribution
It proves the existence of irreducible members within effectively enumerable betting strategies and extends results on the limitations of simplified supermartingales in detecting randomness.
Findings
Existence of irreducible enumerable betting strategies.
Certain non-1-random reals cannot be succeeded on by restricted supermartingales.
Supports conjecture that natural classes of supermartingales defining 1-randomness cannot be simplified.
Abstract
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 show that the class of effectively enumerable betting-strategies has irreducible members which cannot be decomposed into an equivalent set of simpler betting-strategies. We answer questions of Kastermans and Hitchcock by constructing a real on which no kastergale (which is a left-c.e. supermartingale whose favorable outcomes are effectively determined) succeeds, but some unrestricted left-c.e. supermartingale succeeds on it. We generalize a result of Muchnick by showing that there is a non-1-random real such that no muchgale (which is a left-c.e. supermartingale who does not bet on certain stages) succeeds on it. Our methodology is then used to obtain…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBenford’s Law and Fraud Detection · Auction Theory and Applications · Game Theory and Voting Systems
