Machine learning for optimal blackjack counting strategies
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3139352 (Why is no real title available?)
- scientific article; zbMATH DE number 3219315 (Why is no real title available?)
- scientific article; zbMATH DE number 3254520 (Why is no real title available?)
- scientific article; zbMATH DE number 3189714 (Why is no real title available?)
- scientific article; zbMATH DE number 3085434 (Why is no real title available?)
- A statistical foundation for machine learning, with application to Go- Moku
- Automatic Learning for Dynamic Markov Fields with Application to Epidemiology
- Convergence of the random search method in the presence of noise
- Nonparametric bandit methods
- On sequential search for the maximum of an unknown function
- Optimization Strategies in Adaptive Control: A Selective Survey
- Probability Inequalities for Sums of Bounded Random Variables
- Progressive global random search of continuous functions
- Random Search in the Presence of Noise, with Application to Machine Learning
- Random optimization
- Some Results on the Complete and Almost Sure Convergence of Linear Combinations of Independent Random Variables and Martingale Differences
- Some aspects of the sequential design of experiments
- The Optimum Strategy in Blackjack
- The uniform convergence of nearest neighbor regression function estimators and their application in optimization
Cited in
(2)
This page was built for publication: Machine learning for optimal blackjack counting strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1205466)