World-class interpretable poker

DOI10.1007/S10994-022-06179-8MaRDI QIDQ2102358zbMATH OpenOpenAlexWikidataFDO

Authors Alex Paskov, Dimitris Bertsimas

Publication date 28 November 2022

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10994-022-06179-8

zbMATH Keywords

artificial intelligencedeep reinforcement learninggame solvinginterpretabilityoptimal decision treespokerregret minimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
• Computing human-understandable strategies: deducing fundamental rules of poker strategy
• DeepStack: expert-level artificial intelligence in heads-up no-limit poker
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• Lossless abstraction of imperfect information games
• Optimal classification trees
• Superhuman AI for heads-up no-limit poker: Libratus beats top professionals

Cited in

(2)

• Superhuman AI for multiplayer poker
• Discovering interpretable structure in longitudinal predictors via coefficient trees

Describes a project that uses

Uses Software

• GameShrink
• DeepStack

This page was built for publication: World-class interpretable poker

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102358)