Effective short-term opponent exploitation in simplified poker

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2005, Pages 783-788

  Hoehn, Bret ^a   Southey, Finnegan ^a   Holte, Robert C ^a   Bulitko, Valeriy ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b ATHABASCA UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERT ALGORITHMS; NASH EQUILIBRIUM STRATEGIES; POKER STEMS;

ALGORITHMS; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; EXPERT SYSTEMS; LEARNING ALGORITHMS; LEARNING SYSTEMS; PARAMETER ESTIMATION;

GAME THEORY;

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

References (6)

1. Auer, P.; Cesa-Bianchi, N.; Freund, Y.; and Schapire, R. E. 1995. Gambling in a rigged casino: the adversarial multi-armed bandit problem. In Proc. of the 36th Annual Symp. on Foundations of Comp. Sci., 322-331.
2. Billings, D.; Davidson, A.; Schauenberg, T.; Burch, N.; Bowling, M.; Holte, R.; Schaeffer, J.; and Szafron, D. Game Tree Search with Adaptation in Stochastic Imperfect Information Games. In Computers and Games '04.
3. Billings, D.; Burch, N.; Davidson, A.; Holte, R.; Schaeffer, J.; Schauenberg, T.; and Szafron, D. 2003. Approximating game-theoretic optimal strategies for full-scale poker. In 18th Intl. Joint Conf. on Artificial Intelligence (IJCAI'2003).
4. Koller, D., and Pfeffer, A. 1997. Representations and solutions for game-theoretic problems. Artificial Intelligence 94(1):167-215.
5. Korb, K., and Nicholson, A. 1999. Bayesian poker. In Uncertainty in Artificial Intelligence, 343-350.
6. Kuhn, H. W. 1950. A simplified two-person poker. Contributions to the Theory of Games 1:97-103.