Abstract
Modeling games has a long history in the Artificial Intelligence community. Most of the games that have been considered solved in AI are perfect information games. Imperfect information games like Poker and Bridge represent a domain where there is a great deal of uncertainty involved and additional challenges with respect to modeling the behavior of the opponent etc. Techniques developed for playing imperfect games also have many real world applications like repeated online auctions, human computer interaction, opponent modeling for military applications etc. In this paper we explore different techniques for playing poker, the core of these techniques is opponent modeling via classifying the behavior of opponent according to classes provided by domain experts. We utilize windows of full observation in the game to classify the opponent. In Poker, the behavior of an opponent is classified into four standard poker-playing styles based on a subjective function.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Allen, J.D.: A Note on the Computer Solution of Connect-Four. Heuristic Programming in Artificial Intelligence 1, [7], 134–135 (1989)
Allis, L.V., Schoo, P.N.A.: Qubic Solved Again. Heuristic Programming in Artificial Intelligence 3, [9], 192–204 (1992)
Allis, L.V., van den Herik, H.J., Huntjens, M.P.H.: Go-Moku Solved by New Search Techniques. In: Proceedings of the 1993 AAAI Fall Symposium on Games: Planning and Learning. AAAI Press Technical Report FS93-02, Menlo Park (1993)
Baker, R.J.S., Cowling, P.I.: Bayesian Opponent Modeling in a Simple Poker Environment. In: IEEE Symposium on Computational Intelligence and Games (CIG 2007), Honolulu, USA (2007)
Baker, R.J.S., Cowling, P.I., Randall, T., Jiang, P.: Can Opponent Models Aid Poker Player Evolution? In: IEEE Symposium on Computational Intelligence and Games, pp. 23–30 (2008)
Billings, D., Papp, D., Schaeffer, J., Szafron, D.: Poker as a testbed for machine intelligence research. In: Mercer, R., Neufeld, E. (eds.) Advances in Artificial Intelligence, pp. 1–15. Springer, Heidelberg (1997)
Billings, D., Papp, D., Schaeffer, J., Szafron, D.: Poker as a Testbed for Machine Intelligence Research. In: Mercer, R., Neufeld, E. (eds.) AI 1998 Advances in Artificial Intelligence, pp. 1–15. Springer, Heidelberg (1998)
Billings, D., Peña, L., Schaeffer, J., Szafron, D.: Proceedings of AAAI 1999 (Sixteenth National Conference of the American Association for Artificial Intelligence) (1999)
Blair, J.R.S., Mutchler, D., Lin, C.: Games with Imperfect Information. In: Proceedings of the AAAI Fall Symposium on Games: Planning and Learning, pp. 59–67. AAAI Press Technical Report FS93-02, Menlo Park (1993)
Chaddock, G., Pickett, M., Armstrong, T., Oates, T.: Models of strategic deficiency and poker. In: Working Notes of the AAAI Workshop on Plan, Activity, and Intent Recognition (PAIR), pp. 31–36 (2007)
Davidson, A.: Opponent Modeling in Poker: Learning and Acting in a Hostile and Uncertain Environment, University of Alberta M.Sc. thesis (2002)
Findler, N.: Studies in machine cognition using the game of poker. Communications of the ACM 20(4), 230–245 (1977)
Griffiths, M.D.: The cognitive psychology of gambling. Journal of Gambling Studies (1990)
Koller, D., Pfeffer, A.: Representations and solutions for game-theoretic problems. Artificial Intelligence 94(1-2), 167–215 (1997)
Popma, R., Allis, L.V.: Life and Death Refined. Heuristic Programming in Artificial Intelligence 3, 157–164 (1992)
Rosenbloom, P.S.: A World-Championship-Level Othello Program. Computer Games 2, [6], 365–408 (1979)
Schaeffer, J., Burch, N., Bjornsson, Y., Kishimoto, A., Muller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is Solved. Science (2007)
Schauenberg, T.: Opponent Modelling and Search in Poker. M.Sc. thesis (2006)
Strachey, C.S.: Logical or Nonmathematical Programs. In: Procd. of the ACM Conf., Toronto (1952)
Ulgee, I.H.: Letters beyond Numbers. Heuristic Programming in Artificial Intelligence 3, [9], 63–66 (1992)
Wheen, R.: Brute Force Programming for Solving Double Dummy Bridge Problems. Heuristic Programming in Artificial Intelligence 1, [7], 88–94 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahmad, M.A., Elidrisi, M. (2010). Opponent Classification in Poker. In: Chai, SK., Salerno, J.J., Mabry, P.L. (eds) Advances in Social Computing. SBP 2010. Lecture Notes in Computer Science, vol 6007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12079-4_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-12079-4_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12078-7
Online ISBN: 978-3-642-12079-4
eBook Packages: Computer ScienceComputer Science (R0)