812 citations · 1.5k across the 16 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.GT2012★ 147 cited
Bayes' Bluff: Opponent Modelling in Poker
Finnegan Southey, Michael P. Bowling, Bryce Larson +4
Poker is a challenging problem for artificial intelligence, with non-deterministic dynamics, partial observability, and the added difficulty of unknown adversaries. Modelling all o…
cs.GT2012★ 46 cited
No-Regret Learning in Extensive-Form Games with Imperfect Recall
Marc Lanctot, Richard Gibson, Neil Burch +2
Counterfactual Regret Minimization (CFR) is an efficient no-regret learning algorithm for decision problems modeled as extensive games. CFR's regret bounds depend on the requiremen…