Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
World-class interpretable poker
by
Bertsimas, Dimitris
, Paskov, Alex
in
Algorithms
/ Artificial intelligence
/ Decision theory
/ Decision trees
/ Gambling
/ Games
/ Human performance
/ Iterative methods
/ Machine learning
/ Neural networks
/ Optimization
/ Representations
2022
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
World-class interpretable poker
by
Bertsimas, Dimitris
, Paskov, Alex
in
Algorithms
/ Artificial intelligence
/ Decision theory
/ Decision trees
/ Gambling
/ Games
/ Human performance
/ Iterative methods
/ Machine learning
/ Neural networks
/ Optimization
/ Representations
2022
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
World-class interpretable poker
2022
Request Book From Autostore
and Choose the Collection Method
Overview
We address the problem of interpretability in iterative game solving for imperfect-information games such as poker. This lack of interpretability has two main sources: first, the use of an uninterpretable feature representation, and second, the use of black box methods such as neural networks, for the fitting procedure. In this paper, we present advances on both fronts. Namely, first we propose a novel, compact, and easy-to-understand game-state feature representation for Heads-up No-limit (HUNL) Poker. Second, we make use of globally optimal decision trees, paired with a counterfactual regret minimization (CFR) self-play algorithm, to train our poker bot which produces an entirely interpretable agent. Through experiments against Slumbot, the winner of the most recent Annual Computer Poker Competition, we demonstrate that our approach yields a HUNL Poker agent that is capable of beating the Slumbot. Most exciting of all, the resulting poker bot is highly interpretable, allowing humans to learn from the novel strategies it discovers.
Publisher
Springer Nature B.V
This website uses cookies to ensure you get the best experience on our website.