资源论文Decision Generalisation from Game Logs in No Limit Texas Hold’em? Jonathan Rubin and Ian Watson

Decision Generalisation from Game Logs in No Limit Texas Hold’em? Jonathan Rubin and Ian Watson

2019-11-11 | |  40 |   31 |   0
Abstract Given a set of data, recorded by observing the decisions of an expert player, we present a case-based framework that allows the successful generalisation of those decisions in the game of no limit Texas Hold’em. We address the problems of determining a suitable action abstraction and the resulting state translation that is required to map real-value bet amounts into a discrete set of abstract actions. We also detail the similarity metrics used in order to identify similar scenarios, without which no generalisation of playing decisions would be possible. We show that we were able to successfully generalise no limit betting decisions from recorded data via our agent, SartreNL, which achieved a 5th place finish out of 11 opponents at the 2012 Annual Computer Poker Competition.

上一篇:At Home with Agents: Exploring Attitudes Towards Future Smart EnergyInfrastructures1

下一篇:Modeling The Interplay of People’s Location, Interactions, and Social Ties? Adam Sadilek Henry Kautz Jeffrey P. Bigham

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...