| Superhuman AI for heads-up no-limit poker: Libratus beats top professionals N Brown, T Sandholm Science 359 (6374), 418-424, 2018 | 538 | 2018 |
| Superhuman AI for multiplayer poker N Brown, T Sandholm Science 365 (6456), 885-890, 2019 | 495 | 2019 |
| Safe and nested subgame solving for imperfect-information games N Brown, T Sandholm Neural Information Processing Systems, 2017 | 168* | 2017 |
| Deep counterfactual regret minimization N Brown, A Lerer, S Gross, T Sandholm International Conference on Machine Learning, 2019 | 132 | 2019 |
| Solving imperfect-information games via discounted regret minimization N Brown, T Sandholm Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1829-1836, 2019 | 102 | 2019 |
| Libratus: The Superhuman AI for No-Limit Poker. N Brown, T Sandholm IJCAI, 5226-5228, 2017 | 84 | 2017 |
| Hierarchical abstraction, distributed equilibrium computation, and post-processing, with application to a champion no-limit Texas Hold'em agent N Brown, S Ganzfried, T Sandholm Workshops at the twenty-ninth AAAI conference on artificial intelligence, 2015 | 77 | 2015 |
| Depth-limited solving for imperfect-information games N Brown, T Sandholm, B Amos Advances in neural information processing systems 31, 2018 | 59 | 2018 |
| Combining deep reinforcement learning and search for imperfect-information games N Brown, A Bakhtin, A Lerer, Q Gong Advances in Neural Information Processing Systems 33, 17057-17069, 2020 | 54 | 2020 |
| Improving Policies via Search in Cooperative Partially Observable Games A Lerer, H Hu, J Foerster, N Brown AAAI Conference on Artificial Intelligence, 2020 | 44 | 2020 |
| Dynamic thresholding and pruning for regret minimization N Brown, C Kroer, T Sandholm Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 43 | 2017 |
| Reduced space and faster convergence in imperfect-information games via pruning N Brown, T Sandholm International conference on machine learning, 596-604, 2017 | 35* | 2017 |
| Simultaneous abstraction and equilibrium finding in games N Brown, T Sandholm Twenty-fourth international joint conference on artificial intelligence, 2015 | 34 | 2015 |
| Regret-based pruning in extensive-form games N Brown, T Sandholm Advances in neural information processing systems 28, 2015 | 33 | 2015 |
| Regret transfer and parameter optimization N Brown, T Sandholm Workshops at the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014 | 31 | 2014 |
| Stable-predictive optimistic counterfactual regret minimization G Farina, C Kroer, N Brown, T Sandholm International conference on machine learning, 1853-1862, 2019 | 25 | 2019 |
| DREAM: Deep regret minimization with advantage baselines and model-free learning E Steinberger, A Lerer, N Brown arXiv preprint arXiv:2006.10410, 2020 | 22 | 2020 |
| Off-belief learning H Hu, A Lerer, B Cui, L Pineda, N Brown, J Foerster International Conference on Machine Learning, 4369-4379, 2021 | 20 | 2021 |
| Strategy-based warm starting for regret minimization in games N Brown, T Sandholm Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016 | 20 | 2016 |
| Human-level performance in no-press diplomacy via equilibrium search J Gray, A Lerer, A Bakhtin, N Brown arXiv preprint arXiv:2010.02923, 2020 | 19 | 2020 |
