Computer Poker and Imperfect Information Games
Papers from the 2017 AAAI Workshop
Viliam Lisy, Michael Thielscher, Thanh Nguyen, Organizers
AAAI Technical Report WS-17-06
This technical report was published as part of The Workshops of the Thirty-First AAAI Conference on Artificial Intelligence: Technical Reports WS-17-01 – WS-17-15 by The AAAI Press, Palo Alto, California
Contents
Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning
Noam Brown, Tuomas Sandholm
Safe and Nested Endgame Solving for Imperfect-Information Games
Noam Brown, Tuomas Sandholm
AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games
Neil Burch, Martin Schmid, Matej Moravcik, Michael Bowling
Towards Solving Imperfect Recall Games
Jiri Cermak, Branislav Bosansky
Combining Incremental Strategy Generation and Branch and Bound Search for Computing Maxmin Strategies in Imperfect Recall Games
Jiri Cermak, Branislav Bosansky, Michal Pechoucek
Learning Human-Understandable Strategies
Sam Ganzfried, Farzana Yusuf
Strategic Information Revelation and Commitment in Security Games
Qingyu Guo, Bo An, Branislav Bosansky, Christopher Kiekintveld
Targeted CFR
Eric Griffin Jackson
Evolving Adaptive Poker Players for Effective Opponent Exploitation
Xun Li, Risto Miikkulainen
Eqilibrium Approximation Quality of Current No-Limit Poker Bots
Viliam Lisy, Michael Bowling
Spoofing the Limit Order Book: An Agent-Based Model
Xintong Wang, Michael Paul Wellman
AAAI Digital Library
AAAI relies on your generous support through membership and donations. If you find these resources useful, we would be grateful for your support.