Bayes-relational learning of opponent models from incomplete information in no-limit poker

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2008, Pages 1485-1486

  Ponsen, Marc ^a   Ramon, Jan ^b   Croonenborghs, Tom ^c   Driessens, Kurt ^b   Tuyls, Karl ^d  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c Thomas More University College   (Belgium)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BIONICS;

INCOMPLETE INFORMATIONS; MODELING APPROACHES; OPPONENT MODELS; RELATIONAL LEARNINGS; RELATIONAL REGRESSION TREES;

ARTIFICIAL INTELLIGENCE;

EID: 57749083242     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (2)

1. Billings, D.; Davidson, A.; Schauenberg, T.; Burch, N.; Bowling, M.; Holte, R. G; Schaeffer, J.; and Szafron, D. 2006. Game-tree search with adaptation in stochastic imperfect-information games. In van den Herik, H. J.; Björnsson, Y.; and Netanyahu, N. S., eds., The 4th Computers and Games International Conference (CG 2004), Revised Papers, volume 3846 of Lecture Notes in Computer Science, 21-34. Ramat-Gan, Israel: Springer.
2. Blocked, H., and De Raedt, L. 1998. Top-down induction of first order logical decision trees. Artificial Intelligence 101(1-2):285-297.