Computing human-understandable strategies: deducing fundamental rules of poker strategy

DOI10.3390/g8040049zbMath1410.91132OpenAlexW2767831164MaRDI QIDQ1656987

Sam Ganzfried, Farzana Yusuf

Publication date: 13 August 2018

Published in: Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/g8040049

zbMATH Keywords

pokergame theoryNash equilibriumdecision treemachine learningimperfect informationhuman understandable

Mathematics Subject Classification ID

Probabilistic games; gambling (91A60) Decision theory for games (91A35) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (1)

World-class interpretable poker

Uses Software

• Gurobi
• DeepStack

Cites Work

• Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model
• The complexity of two-person zero-sum games in extensive form
• DeepStack: Expert-level artificial intelligence in heads-up no-limit poker
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing human-understandable strategies: deducing fundamental rules of poker strategy