Machine learning for optimal blackjack counting strategies
From MaRDI portal
Publication:1205466
DOI10.1016/0378-3758(92)90001-9zbMath0781.62011OpenAlexW1983294126MaRDI QIDQ1205466
Publication date: 1 April 1993
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(92)90001-9
algorithmglobal minimumnoisy measurementsgamessequential decisionautomatic learningblackjackmulti-modal discontinuous objective functionoptimal counting strategiesstochastic minimizationten-count standing numbers
Sequential statistical methods (62L99) Statistical decision theory (62C99) Artificial intelligence (68T99)
Related Items
A decision model and methodology for the AIDS epidemic ⋮ Sequential design with applications to the trim-loss problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonparametric bandit methods
- A statistical foundation for machine learning, with application to Go- Moku
- Convergence of the random search method in the presence of noise
- Random optimization
- On sequential search for the maximum of an unknown function
- The Optimum Strategy in Blackjack
- Automatic Learning for Dynamic Markov Fields with Application to Epidemiology
- Optimization Strategies in Adaptive Control: A Selective Survey
- The uniform convergence of nearest neighbor regression function estimators and their application in optimization
- Progressive global random search of continuous functions
- Random Search in the Presence of Noise, with Application to Machine Learning
- Probability Inequalities for Sums of Bounded Random Variables
- 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
