A Fast Bundle-based Anytime Algorithm for Poker and other Convex Games

By H. Brendan McMahan, Geoffrey J. Gordon. 2007

25 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Johannes Heinrich
2. Marc Lanctot
3. David Silver
4. Viliam Lisý
5. Branislav Bosanský
6. Kaiqing Zhang
7. Yuxi Li
8. Christopher Kiekintveld

Citations in the corpus

• An Exact Double-Oracle Algorithm for Zero-Sum Extensive-Form Games with Imperfect Information (2014, methodology): “However, the algorithm converges extremely slowly and it can take a very long time (several hours for a small game) for the algorithm to achieve a small error (see the experimental evaluation in McMahan, 2006; McMahan & Gordon, 2007).”
• Fictitious Self-Play in Extensive-Form Games (2015, background): “Despite the popularity of fictitious play to date, it has seen use in few large-scale applications, e.g. (Lambert III et al., 2005; McMahan & Gordon, 2007; Ganzfried & Sandholm, 2009; Heinrich & Silver, 2015).”