How to build a probability-free casino

DOI10.1016/J.IC.2011.12.004MaRDI QIDQ418145zbMATH OpenOpenAlexFDO

Authors Adam Chalcraft, Randall Dougherty, Chris Freiling, Jason Teutsch

Publication date 24 May 2012

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2011.12.004

zbMATH Keywords

algorithmic randomnessfinitely-valued martingales

Mathematics Subject Classification ID

Probabilistic games; gambling (91A60)

Recommendations

• A savings paradox for integer-valued gambling strategies
• Uniform van Lambalgen's theorem fails for computable randomness
• Monotonous betting strategies in warped casinos
• Effective martingales with restricted wagers
• Purely game-theoretic random sequences. II: Limiting empirical distributions and strong central limit theorem

Cites work

• Algorithmic randomness and complexity.

Cited in

(9)

• Granularity of wagers in games and the possibility of saving
• A savings paradox for integer-valued gambling strategies
• Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
• Dynamics of gambling. Origins of randomness in mechanical systems
• How to gamble against all odds
• Effective martingales with restricted wagers
• Monotonous betting strategies in warped casinos
• scientific article; zbMATH DE number 1421008 (Why is no real title available?)
• Computability theory. Abstracts from the workshop held January 7--13, 2018

This page was built for publication: How to build a probability-free casino

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418145)