A Survey on Game Theory Optimal Poker

Prathamesh Sonawane, Arav Chheda
1/2/2024
cs.GTcs.AI

No confident code implementation found for this paper.

Abstract

Poker is in the family of imperfect information games unlike other games such as chess, connect four, etc which are perfect information game instead. While many perfect information games have been solved, no non-trivial imperfect information game has been solved to date. This makes poker a great test bed for Artificial Intelligence research. In this paper we firstly compare Game theory optimal poker to Exploitative poker. Secondly, we discuss the intricacies of abstraction techniques, betting models, and specific strategies employed by successful poker bots like Tartanian[1] and Pluribus[6]. Thirdly, we also explore 2-player vs multi-player games and the limitations that come when playing with more players. Finally, this paper discusses the role of machine learning and theoretical approaches in developing winning strategies and suggests future directions for this rapidly evolving field.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{sonawane2024survey,
  title  = {A Survey on Game Theory Optimal Poker},
  author = {Prathamesh Sonawane and Arav Chheda},
  year   = {2024},
  eprint = {2401.06168},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.06168v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.06168.svg)](https://codeofpaper.com/paper/2401.06168)

Discussion