{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:13:35Z","timestamp":1771024415224,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642313677","type":"print"},{"value":"9783642313684","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31368-4_26","type":"book-chapter","created":{"date-parts":[[2012,6,20]],"date-time":"2012-06-20T07:29:22Z","timestamp":1340177362000},"page":"220-227","source":"Crossref","is-referenced-by-count":11,"title":["Adapting Strategies to Opponent Models in Incomplete Information Games: A Reinforcement Learning Approach for Poker"],"prefix":"10.1007","author":[{"given":"Lu\u00eds Filipe","family":"Te\u00f3filo","sequence":"first","affiliation":[]},{"given":"Nuno","family":"Passos","sequence":"additional","affiliation":[]},{"given":"Lu\u00eds Paulo","family":"Reis","sequence":"additional","affiliation":[]},{"given":"Henrique Lopes","family":"Cardoso","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Billings, D.: Algorithms and Assessment in Computer Poker. Ph.D. University of Alberta, Edmonton, Alberta, Canada (2006)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Newborn, M.: Kasparov versus Deep Blue: Computer Chess Comes of Age, 1st edn. Springer (1996)","DOI":"10.1007\/978-1-4612-2260-6_1"},{"key":"26_CR3","unstructured":"Sklansky, D.: The Theory of Poker: A Professional Poker Player Teaches You How to Think Like One, 4th edn. Two Plus Two (2007)"},{"key":"26_CR4","unstructured":"Billings, D.: Computer Poker. M.Sc. University of Alberta, Canada (1995)"},{"key":"26_CR5","unstructured":"Davidson, A.: Opponent Modeling in Poker: Learning and Acting in a Hostile and Uncertain Environment. M.Sc. University Alberta, Edmonton, Alberta, Canada (2002)"},{"key":"26_CR6","unstructured":"Schauenberg, T.: Opponent Modeling and Search in Poker. M.Sc. University Alberta, Edmonton, Alberta, Canada (2006)"},{"key":"26_CR7","first-page":"500","volume-title":"Proceedings 15th National\/10th Conference on Artificial Intelligence\/Innovative Applications of Artificial Intelligence","author":"I. Frank","year":"1998","unstructured":"Frank, I., Basin, D., Matsubara, H.: Finding optimal strategies for imperfect information games. In: Proceedings 15th National\/10th Conference on Artificial Intelligence\/Innovative Applications of Artificial Intelligence, pp. 500\u2013507. American Association for Artificial Intelligence, Menlo Park (1998)"},{"key":"26_CR8","unstructured":"Johanson, M.: Robust Strategies and Counter-Strategies: Building a Champion Level Computer Poker Player. M.Sc. University Alberta, Edmonton, Alberta, Canada (2007)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Gilpin, A., Sandholm, T.: A competitive Texas Hold\u2019em poker player via automated abstraction and real-time equilibrium computation. In: Proceedings 5th International Joint Conference on Autonomous Agents and Multiagent Systems, Hakodate, Japan, pp. 1453\u20131454 (2006)","DOI":"10.1145\/1160633.1160911"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Gilpin, A., Sandholm, T.: Better automated abstraction techniques for im-perfect information games, with application to Texas Hold\u2019em poker. In: Proceedings 6th International Joint Conference on Autonomous agents and Multiagent Systems. Article 192, Honolulu, Hawaii, United States, 8 pages (2007)","DOI":"10.1145\/1329125.1329358"},{"key":"26_CR11","unstructured":"Billings, D., Burch, N., Davidson, A., Holte, R.C., Schaeffer, J., Schauenberg, T., Szafron, D.: Approximating game-theoretic optimal strategies for full-scale poker. In: Proceedings 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico, pp. 661\u2013668 (2003)"},{"key":"26_CR12","first-page":"264","volume":"5","author":"M. Johanson","year":"2009","unstructured":"Johanson, M., Bowling, M.: Data Biased Robust Counter Strategies. Journal of Machine Learning Research\u00a05, 264\u2013271 (2009)","journal-title":"Journal of Machine Learning Research"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-21538-4_8","volume-title":"Autonomous and Intelligent Systems","author":"L.F. Te\u00f3filo","year":"2011","unstructured":"Te\u00f3filo, L.F., Reis, L.P.: Building a No Limit Texas Hold\u2019em Poker Agent Based on Game Logs Using Supervised Learning. In: Kamel, M., Karray, F., Gueaieb, W., Khamis, A. (eds.) AIS 2011. LNCS, vol.\u00a06752, pp. 73\u201382. Springer, Heidelberg (2011)"},{"key":"26_CR14","unstructured":"Kleij, A.A.J.: Monte Carlo Tree Search and Opponent Modeling through Player Clustering in no-limit Texas Hold\u2019em Poker. M.Sc. University of Groningen, Netherlands (2010)"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-642-05224-8_28","volume-title":"Advances in Machine Learning","author":"G. Broeck Van den","year":"2009","unstructured":"Van den Broeck, G., Driessens, K., Ramon, J.: Monte-Carlo Tree Search in Poker Using Expected Reward Distributions. In: Zhou, Z.-H., Washio, T. (eds.) ACML 2009. LNCS, vol.\u00a05828, pp. 367\u2013381. Springer, Heidelberg (2009)"},{"key":"26_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-44795-4_8","volume-title":"Machine Learning: ECML 2001","author":"F.A. Dahl","year":"2001","unstructured":"Dahl, F.A.: A Reinforcement Learning Algorithm Applied to Simplified Two-Player Texas Hold\u2019em Poker. In: Flach, P.A., De Raedt, L. (eds.) ECML 2001. LNCS (LNAI), vol.\u00a02167, pp. 85\u201396. Springer, Heidelberg (2001)"},{"key":"26_CR17","unstructured":"Open Meerkat Poker Testbed (2012), \n                    \n                      http:\/\/code.google.com\/p\/opentestbed\/"}],"container-title":["Lecture Notes in Computer Science","Autonomous and Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31368-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T07:02:08Z","timestamp":1556866928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31368-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642313677","9783642313684"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31368-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}