{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:15:40Z","timestamp":1760242540031,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T00:00:00Z","timestamp":1509926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Games"],"abstract":"<jats:p>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\u2019 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.<\/jats:p>","DOI":"10.3390\/g8040049","type":"journal-article","created":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T11:39:38Z","timestamp":1509968378000},"page":"49","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Computing Human-Understandable Strategies: Deducing Fundamental Rules of Poker Strategy"],"prefix":"10.3390","volume":"8","author":[{"given":"Sam","family":"Ganzfried","sequence":"first","affiliation":[{"name":"Florida International University, School of Computing and Information Sciences; Miami, FL 33199, USA"}]},{"given":"Farzana","family":"Yusuf","sequence":"additional","affiliation":[{"name":"Florida International University, School of Computing and Information Sciences; Miami, FL 33199, USA"}]}],"member":"1968","published-online":{"date-parts":[[2017,11,6]]},"reference":[{"key":"ref_1","unstructured":"Paruchuri, P., Pearce, J.P., Marecki, J., Tambe, M., Ordonez, F., and Kraus, S. (2008, January 12\u201316). Playing games with security: An efficient exact algorithm for Bayesian Stackelberg Games. Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Estoril, Portugal."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1126\/science.1259433","article-title":"Heads-up Limit Hold\u2019em Poker is Solved","volume":"347","author":"Bowling","year":"2015","journal-title":"Science"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/0899-8256(92)90035-Q","article-title":"The Complexity of Two-Person Zero-Sum Games in Extensive Form","volume":"4","author":"Koller","year":"1992","journal-title":"Games Econ. Behav."},{"key":"ref_4","unstructured":"Bertsimas, D., Chang, A., and Rudin, C. (2011). Ordered Rules for Classification: A Discrete Optimization Approach to Associative Classification, Massachusetts Institute of Technology, Operations Research Center."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Jung, J., Concannon, C., Shroff, R., Goel, S., and Goldstein, D.G. (arXiv, 2017). Simple rules for complex decisions, arXiv.","DOI":"10.2139\/ssrn.2919024"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Lakkaraju, H., Bach, S.H., and Leskovec, J. (2016, January 13\u201317). Interpretable decision sets: A joint framework for description and prediction. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/2939672.2939874"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1214\/15-AOAS848","article-title":"Interpretable classifiers using rules and Bayesian analysis: Building a better stroke prediction model","volume":"9","author":"Letham","year":"2015","journal-title":"Ann. Appl. Stat."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.31887\/DCNS.2012.14.1\/jmarewski","article-title":"Heuristic decision making in medicine","volume":"14","author":"Marewski","year":"2012","journal-title":"Dialogues Clin. Neurosci."},{"key":"ref_9","unstructured":"Ankenman, J., and Chen, B. (2006). The Mathematics of Poker, ConJelCo LLC."},{"key":"ref_10","unstructured":"Ganzfried, S., and Sandholm, T. (2010, January 10\u201314). Computing equilibria by incorporating qualitative models. Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Toronto, ON, Canada."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/2904104.2904105","article-title":"Reflections on the First Man vs. Machine No-Limit Texas Hold \u2019em Competition","volume":"14","author":"Ganzfried","year":"2015","journal-title":"ACM SIGecom Exch."},{"key":"ref_12","unstructured":"Brown, N., and Sandholm, T. (2017, January 4\u20135). Safe and Nested Endgame Solving in Imperfect-Information Games. Proceedings of the TheWorkshops of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17), San Francisco, CA, USA."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Moravc\u00edk, M., Schmid, M., Burch, N., Lis\u00fd, V., Morrill, D., Bard, N., Davis, T., Waugh, K., Johanson, M., and Bowling, M.H. (arXiv, 2017). DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker, arXiv.","DOI":"10.1126\/science.aam6960"},{"key":"ref_14","unstructured":"Ganzfried, S., and Sandholm, T. (2015, January 4\u20138). Endgame Solving in Large Imperfect-Information Games. Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Istanbul, Turkey."},{"key":"ref_15","unstructured":"Johanson, M. (2013). Measuring the Size of Large No-Limit Poker Games, University of Alberta. Technical Report."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Burch, N., Johanson, M., and Bowling, M. (2014, January 27\u201331). Solving Imperfect Information Games Using Decomposition. Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), Qu\u00e9bec City, QC, Canada.","DOI":"10.1609\/aaai.v28i1.8810"},{"key":"ref_17","unstructured":"Moravcik, M., Schmid, M., Ha, K., Hladik, M., and Gaukrodger, S.J. (2016, January 12\u201317). Solving Imperfect Information Games Using Decomposition. Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), Phoenix, AZ, USA."},{"key":"ref_18","unstructured":"Gilpin, A., Sandholm, T., and S\u00f8rensen, T.B. (2007, January 22\u201326). Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold\u2019em Poker. Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), Vancouver, BC, Canada."},{"key":"ref_19","unstructured":"Johanson, M., Burch, N., Valenzano, R., and Bowling, M. (2013, January 6\u201310). Evaluating State-Space Abstractions in Extensive-Form Games. Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Saint Paul, MN, USA."},{"key":"ref_20","unstructured":"Fox, L. (1966). Game-playing and game-learning automata. Advances in Programming and Non-Numerical Computation, Pergamon."},{"key":"ref_21","unstructured":"Gurobi Optimization, Inc. (2014). Gurobi Optimizer Reference Manual, Gurobi Optimization, Inc.. Version 6.0."},{"key":"ref_22","unstructured":"Gordon, P. (2011). Phil Gordon\u2019s Little Gold Book: Advanced Lessons for Mastering Poker 2.0, Gallery Books."},{"key":"ref_23","unstructured":"Ganzfried, S., and Sandholm, T. (2011, January 2\u20136). Game theory-based opponent modeling in large imperfect-information games. Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Taipei, Taiwan."}],"container-title":["Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-4336\/8\/4\/49\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:48:21Z","timestamp":1760208501000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-4336\/8\/4\/49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,6]]},"references-count":23,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,12]]}},"alternative-id":["g8040049"],"URL":"https:\/\/doi.org\/10.3390\/g8040049","relation":{},"ISSN":["2073-4336"],"issn-type":[{"type":"electronic","value":"2073-4336"}],"subject":[],"published":{"date-parts":[[2017,11,6]]}}}