Optimal Blackjack Betting Strategies Through Dynamic Programming and Expected Utility Theory
Lucas Bordeu, Javier Castro

TL;DR
This paper develops optimal Blackjack betting and playing strategies using Markov Decision Processes and Expected Utility Theory, comparing their effectiveness to traditional methods through simulations.
Contribution
It introduces a rigorous mathematical framework for optimizing Blackjack strategies considering different risk preferences and compares their performance to standard approaches.
Findings
Optimized strategies slightly outperform basic strategies.
Deck composition-based betting strategies outperform Hi-Lo counting.
Strategies are adaptable for mental and computational use.
Abstract
This study presents a rigorous mathematical approach to the optimization of round and betting policies in Blackjack, using Markov Decision Processes (MDP) and Expected Utility Theory. The analysis considers a direct confrontation between a player and the dealer, simplifying the dynamics of the game. The objective is to develop optimal strategies that maximize expected utility for risk profiles defined by constant (CRRA) and absolute (CARA) aversion utility functions. Dynamic programming algorithms are implemented to estimate optimal gambling and betting policies with different levels of complexity. The evaluation is performed through simulations, analyzing histograms of final returns. The results indicate that the advantage of applying optimized round policies over the "basic strategy" is slight, highlighting the efficiency of the last one. In addition, betting strategies based on the…
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
TopicsAuction Theory and Applications · Law, Economics, and Judicial Systems · Risk and Portfolio Optimization
