{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T09:12:05Z","timestamp":1720775525148},"reference-count":0,"publisher":"National Library of Serbia","issue":"4","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2014]]},"abstract":"<jats:p>Poker is used to measure progresses in extensive-form games research due to\n   its unique characteristics: it is a game where playing agents have to deal\n   with incomplete information and stochastic scenarios and a large number of\n   decision points. The development of Poker agents has seen significant\n   advances in one-on-one matches but there are still no consistent results in\n   multiplayer and in games against human experts. In order to allow for experts\n   to aid the improvement of the agents? performance, we have created a\n   high-level strategy specification language. To support strategy definition,\n   we have also developed an intuitive graphical tool. Additionally, we have\n   also created a strategy inferring system, based on a dynamically weighted\n   Euclidean distance. This approach was validated through the creation of\n   simple agents and by successfully inferring strategies from 10 human players.\n   The created agents were able to beat previously developed mid-level agents by\n   a good profit margin.<\/jats:p>","DOI":"10.2298\/csis130921029t","type":"journal-article","created":{"date-parts":[[2014,5,26]],"date-time":"2014-05-26T14:00:00Z","timestamp":1401112800000},"page":"1249-1269","source":"Crossref","is-referenced-by-count":1,"title":["Rule based strategies for large extensive-form games: A specification language for No-Limit Texas Hold\u2019em agents"],"prefix":"10.2298","volume":"11","author":[{"suffix":"Filipe","given":"Lu\u00eds","family":"Te\u00f3filo","sequence":"first","affiliation":[{"name":"LIACC - Artificial Intelligence and Computer Science Lab. R. Campo Alegre, Porto, Portugal + FEUP-Faculty of Engineering, University of Porto - DEI Rua Dr. Roberto Frias, Porto, Portugal"}]},{"suffix":"Paulo","given":"Lu\u00eds","family":"Reis","sequence":"additional","affiliation":[{"name":"LIACC - Artificial Intelligence and Computer Science Lab. R. Campo Alegre, Porto, Portugal + EEUM-School of Engineering, University of Minho - DSI Campus de Azur\u00e9m, Guimar\u00e3es, Portugal"}]},{"suffix":"Lopes","given":"Henrique","family":"Cardoso","sequence":"additional","affiliation":[{"name":"LIACC - Artificial Intelligence and Computer Science Lab. R. Campo Alegre, Porto, Portugal+FEUP - Faculty of Engineering, University of Porto - DEI Rua Dr. Roberto Frias, Porto, Portugal"}]},{"given":"Pedro","family":"Mendes","sequence":"additional","affiliation":[{"name":"FEUP-Faculty of Engineering, University of Porto - DEI Rua Dr. Roberto Frias, Porto, Portugal"}]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:31:37Z","timestamp":1685349097000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141400029T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014]]}},"URL":"https:\/\/doi.org\/10.2298\/csis130921029t","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}