World-class interpretable poker

DOI10.1007/S10994-022-06179-8OpenAlexW4281685852WikidataQ120689895 ScholiaQ120689895MaRDI QIDQ2102358FDOQ2102358

Authors: Alex Paskov, Dimitris Bertsimas 

Publication date: 28 November 2022

Published in: Machine Learning (Search for Journal in Brave)

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

zbMATH Keywords

interpretabilitypokerartificial intelligenceregret minimizationoptimal decision treesdeep reinforcement learninggame solving

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

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

Cited In (2)

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

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)