| Regret minimization in games with incomplete information M Zinkevich, M Johanson, M Bowling, C Piccione Advances in Neural Information Processing Systems 20, 1729-1736, 2008 | 514 | 2008 |
| Deepstack: Expert-level artificial intelligence in heads-up no-limit poker M Moravčík, M Schmid, N Burch, V Lisý, D Morrill, N Bard, T Davis, ... Science 356 (6337), 508-513, 2017 | 482 | 2017 |
| Heads-up limit hold’em poker is solved M Bowling, N Burch, M Johanson, O Tammelin Science 347 (6218), 145-149, 2015 | 346 | 2015 |
| Solving heads-up limit Texas Hold'em O Tammelin, N Burch, M Johanson, M Bowling Twenty-fourth international joint conference on artificial intelligence, 2015 | 107 | 2015 |
| Robust Strategies and Counter-Strategies: Building a Champion Level Computer Poker Program MB Johanson University of Alberta, 2007 | 107* | 2007 |
| Computing robust counter-strategies M Johanson, M Zinkevich, M Bowling Advances in neural information processing systems 20, 721-728, 2007 | 96 | 2007 |
| Accelerating Best Response Calculation in Large Extensive Games M Johanson, K Waugh, M Zinkevich, M Bowling Twenty-Second International Joint Conference on Artificial Intelligence, 2011 | 91 | 2011 |
| A Practical Use of Imperfect Recall. K Waugh, M Zinkevich, M Johanson, M Kan, D Schnizlein, MH Bowling SARA, 2009 | 76 | 2009 |
| Evaluating State-Space Abstractions in Extensive-Form Games M Johanson, N Burch, R Valenzano, M Bowling AAMAS 2013, 2013 | 75 | 2013 |
| Measuring the Size of Large No-Limit Poker Games M Johanson arXiv preprint arXiv:1302.7008, 2013 | 72 | 2013 |
| Efficient Nash Equilibrium Approximation through Monte Carlo Counterfactual Regret Minimization M Johanson, N Bard, M Lanctot, R Gibson, M Bowling AAMAS 2012, 2012 | 70 | 2012 |
| Finding Optimal Abstract Strategies in Extensive-Form Games M Johanson, N Bard, N Burch, M Bowling AAAI 2012, 1371-1379, 2012 | 68 | 2012 |
| Data biased robust counter strategies M Johanson, M Bowling Artificial Intelligence and Statistics, 264-271, 2009 | 67 | 2009 |
| Solving Imperfect Information Games Using Decomposition N Burch, M Johanson, M Bowling Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence …, 2014 | 63 | 2014 |
| Online Implicit Agent Modelling N Bard, M Johanson, N Burch, M Bowling AAMAS 2013, 2013 | 47 | 2013 |
| Solving 7×7 Hex: Virtual connections and game-state reduction RB Hayward, Y Björnsson, M Johanson, M Kan, N Po, J van Rijswijck Advances in Computer Games 263, 261-278, 2004 | 36 | 2004 |
| Strategy evaluation in extensive games with importance sampling M Bowling, M Johanson, N Burch, D Szafron Proceedings of the 25th international conference on Machine learning, 72-79, 2008 | 32 | 2008 |
| Dead cell analysis in Hex and the Shannon game Y Björnsson, R Hayward, M Johanson, J van Rijswijck Graph Theory in Paris, 45-59, 2006 | 30 | 2006 |
| Solving 7x7 Hex with domination, fill-in, and virtual connections R Hayward, Y Bjornsson, M Johanson, M Kan, N Po, J Van Rijswijck Theoretical computer science 349 (2), 123-139, 2005 | 28 | 2005 |
| A demonstration of the Polaris poker system. MH Bowling, N Abou Risk, N Bard, D Billings, N Burch, J Davidson, ... AAMAS (2), 1391-1392, 2009 | 25 | 2009 |
Michael BowlingUniversity of Alberta / DeepMindVerified email at ualberta.ca
