Next Article in Journal
Game Theoretic Interaction and Decision: A Quantum Analysis
Previous Article in Journal
Construction of Subgame-Perfect Mixed-Strategy Equilibria in Repeated Games
Article Menu

Export Article

Open AccessArticle
Games 2017, 8(4), 49; https://doi.org/10.3390/g8040049

Computing Human-Understandable Strategies: Deducing Fundamental Rules of Poker Strategy

Florida International University, School of Computing and Information Sciences; Miami, FL 33199, USA
*
Author to whom correspondence should be addressed.
Received: 21 August 2017 / Revised: 3 October 2017 / Accepted: 23 October 2017 / Published: 6 November 2017
Full-Text   |   PDF [1109 KB, uploaded 8 November 2017]   |  

Abstract

Algorithms for equilibrium computation generally make no attempt to ensure that the computed strategies are understandable by humans. For instance the strategies for the strongest poker agents are represented as massive binary files. In many situations, we would like to compute strategies that can actually be implemented by humans, who may have computational limitations and may only be able to remember a small number of features or components of the strategies that have been computed. For example, a human poker player or military leader may not have access to large precomputed tables when making real-time strategic decisions. We study poker games where private information distributions can be arbitrary (i.e., players are dealt cards from different distributions, which depicts the phenomenon in large real poker games where at some points in the hand players have different distribution of hand strength by applying Bayes’ rule given the history of play in the hand thus far). We create a large training set of game instances and solutions, by randomly selecting the information probabilities, and present algorithms that learn from the training instances to perform well in games with unseen distributions. We are able to conclude several new fundamental rules about poker strategy that can be easily implemented by humans. View Full-Text
Keywords: game theory; Nash equilibrium; human understandable; imperfect information; poker; decision tree; machine learning game theory; Nash equilibrium; human understandable; imperfect information; poker; decision tree; machine learning
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Ganzfried, S.; Yusuf, F. Computing Human-Understandable Strategies: Deducing Fundamental Rules of Poker Strategy. Games 2017, 8, 49.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Games EISSN 2073-4336 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top