How to gamble against all odds

DOI10.1016/j.geb.2015.10.006zbMath1347.91077arXiv1311.2109OpenAlexW1515220588MaRDI QIDQ894618

Gilad Bavly, Ron Peretz

Publication date: 2 December 2015

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.2109

zbMATH Keywords

repeated gamespredictabilitypseudo-randomnessgamblingalgorithmic randomness

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Multistage and repeated games (91A20) Probabilistic games; gambling (91A60)

Related Items (4)

Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers ⋮ Effective martingales with restricted wagers ⋮ Granularity of wagers in games and the possibility of saving ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018

Cites Work

• How to build a probability-free casino
• How powerful are integer-valued martingales?
• Effective martingales with restricted wagers
• On calibration error of randomized forecasting algorithms
• A savings paradox for integer-valued gambling strategies
• Unpredictability of complex (pure) strategies
• Expressible inspections
• Probabilistic Algorithmic Randomness
• A unified approach to the definition of random sequences

This page was built for publication: How to gamble against all odds