Building the Checkers 10-piece Endgame Databases. - Jonathan Schaeffer 001; Yngvi Björnsson; Neil Burch; Robert Lake; Paul Lu; Steve Sutphen (ACG, 2003)

Approximating Game-Theoretic Optimal Strategies for Full-scale Poker. - Darse Billings; Neil Burch; Aaron Davidson; Robert C. Holte; Jonathan Schaeffer 001; Terence Schauenberg; Duane Szafron (IJCAI, 2003)

Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games. - Darse Billings; Aaron Davidson; Terence Schauenberg; Neil Burch; Michael H. Bowling; Robert C. Holte; Jonathan Schaeffer 001; Duane Szafron (Computers and Games, 2004)

Solving Checkers. - Jonathan Schaeffer 001; Yngvi Björnsson; Neil Burch; Akihiro Kishimoto; Martin Müller 003; Robert Lake; Paul Lu; Steve Sutphen (IJCAI, 2005)

Bayes? Bluff: Opponent Modelling in Poker. - Finnegan Southey; Michael H. Bowling; Bryce Larson; Carmelo Piccione; Neil Burch; Darse Billings; D. Chris Rayner (UAI, 2005)

A New Algorithm for Generating Equilibria in Massive Zero-Sum Games. - Martin Zinkevich; Michael H. Bowling; Neil Burch (AAAI, 2007)

Predicting the Performance of IDA* with Conditional Distributions. - Uzi Zahavi; Ariel Felner; Neil Burch; Robert C. Holte (AAAI, 2008)

Strategy evaluation in extensive games with importance sampling. - Michael H. Bowling; Michael Johanson; Neil Burch; Duane Szafron (ICML, 2008)

A demonstration of the Polaris poker system. - Michael H. Bowling; Nicholas Abou Risk; Nolan Bard; Darse Billings; Neil Burch; Joshua Davidson; John Alexander Hawkin; Robert Holte; Michael Johanson; Morgan Kan; Bryce Paradis; Jonathan Schaeffer 001; et al. (AAMAS (2), 2009)

Memory-Based Heuristics for Explicit State Spaces. - Nathan R. Sturtevant; Ariel Felner; Max Barer; Jonathan Schaeffer 001; Neil Burch (IJCAI, 2009)

Automating Layouts of Sewers in Subdivisions. - Neil Burch; Robert C. Holte; Martin Müller 003; David O'Connell; Jonathan Schaeffer 001 (ECAI, 2010)

Predicting the Performance of IDA* using Conditional Distributions. - Uzi Zahavi; Ariel Felner; Neil Burch; Robert C. Holte (J. Artif. Intell. Res., 2010)

Block A*: Database-Driven Search with Applications in Any-Angle Path-Planning. - Peter Yap; Neil Burch; Robert C. Holte; Jonathan Schaeffer 001 (AAAI, 2011)

Any-Angle Path Planning for Computer Games. - Peter Kai Yue Yap; Neil Burch; Robert C. Holte; Jonathan Schaeffer 001 (AIIDE, 2011)

Automatic Move Pruning in General Single-Player Games. - Neil Burch; Robert C. Holte (SOCS, 2011)

Abstract: Block A* and Any-Angle Path-Planning. - Peter Kai Yue Yap; Neil Burch; Robert C. Holte; Jonathan Schaeffer 001 (SOCS, 2011)

Generalized Sampling and Variance in Counterfactual Regret Minimization. - Richard G. Gibson; Marc Lanctot; Neil Burch; Duane Szafron; Michael Bowling (AAAI, 2012)

Finding Optimal Abstract Strategies in Extensive-Form Games. - Michael Johanson; Nolan Bard; Neil Burch; Michael Bowling (AAAI, 2012)

No-Regret Learning in Extensive-Form Games with Imperfect Recall. - Marc Lanctot; Richard G. Gibson; Neil Burch; Michael Bowling (ICML, 2012)

Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions. - Richard G. Gibson; Neil Burch; Marc Lanctot; Duane Szafron (NIPS, 2012)

Automatic Move Pruning Revisited. - Neil Burch; Robert C. Holte (SOCS, 2012)

No-Regret Learning in Extensive-Form Games with Imperfect Recall - Marc Lanctot; Richard G. Gibson; Neil Burch; Martin Zinkevich; Michael H. Bowling (CoRR, 2012)

Rating players in games with real-valued outcomes. - Christopher Archibald; Neil Burch; Michael Bowling; Matthew J. Rutherford (AAMAS, 2013)

Online implicit agent modelling. - Nolan Bard; Michael Johanson; Neil Burch; Michael Bowling (AAMAS, 2013)

Evaluating state-space abstractions in extensive-form games. - Michael Johanson; Neil Burch; Richard Anthony Valenzano; Michael Bowling (AAMAS, 2013)

CFR-D: Solving Imperfect Information Games Using Decomposition - Neil Burch; Michael Bowling (CoRR, 2013)

Solving Imperfect Information Games Using Decomposition. - Neil Burch; Michael Johanson; Michael Bowling (AAAI, 2014)

Using Response Functions to Measure Strategy Strength. - Trevor Davis 001; Neil Burch; Michael Bowling (AAAI, 2014)

Automatic move pruning for single-agent search. - Robert C. Holte; Neil Burch (AI Commun., 2014)

Solving Heads-Up Limit Texas Hold'em. - Oskari Tammelin; Neil Burch; Michael Johanson; Michael Bowling (IJCAI, 2015)

AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games. - Neil Burch; Martin Schmid; Matej Moravcik; Michael Bowling (AAAI Workshops, 2017)

Heads-up limit hold'em poker is solved. - Michael Bowling; Neil Burch; Michael Johanson; Oskari Tammelin (Commun. ACM, 2017)

DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker. - Matej Moravcík; Martin Schmid; Neil Burch; Viliam Lisý; Dustin Morrill; Nolan Bard; Trevor Davis 001; Kevin Waugh; Michael Johanson; Michael H. Bowling (CoRR, 2017)

AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games. - Neil Burch; Martin Schmid; Matej Moravcik; Dustin Morrill; Michael Bowling (AAAI, 2018)

Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games Using Baselines. - Martin Schmid; Neil Burch; Marc Lanctot; Matej Moravcik; Rudolf Kadlec; Michael Bowling (AAAI, 2019)

Bayesian Action Decoder for Deep Multi-Agent Reinforcement Learning. - Jakob N. Foerster; H. Francis Song; Edward Hughes 001; Neil Burch; Iain Dunning; Shimon Whiteson; Matthew M. Botvinick; Michael Bowling (ICML, 2019)

Revisiting CFR+ and Alternating Updates. - Neil Burch; Matej Moravcik; Martin Schmid (J. Artif. Intell. Res., 2019)

The Hanabi challenge: A new frontier for AI research. - Nolan Bard; Jakob N. Foerster; Sarath Chandar; Neil Burch; Marc Lanctot; H. Francis Song; Emilio Parisotto; Vincent Dumoulin; Subhodeep Moitra; Edward Hughes 001; Iain Dunning; Shibl Mourad; et al. (Artif. Intell., 2020)

Sound Search in Imperfect Information Games. - Michal Sustr; Martin Schmid; Matej Moravcík; Neil Burch; Marc Lanctot; Michael Bowling (CoRR, 2020)

Human-Agent Cooperation in Bridge Bidding. - Edward Lockhart; Neil Burch; Nolan Bard; Sebastian Borgeaud; Tom Eccles; Lucas Smaira; Ray Smith (CoRR, 2020)

Solving Common-Payoff Games with Approximate Policy Iteration. - Samuel Sokota; Edward Lockhart; Finbarr Timbers; Elnaz Davoodi; Ryan D'Orazio; Neil Burch; Martin Schmid; Michael Bowling; Marc Lanctot (AAAI, 2021)

Sound Algorithms in Imperfect Information Games. - Michal Sustr; Martin Schmid; Matej Moravcík; Neil Burch; Marc Lanctot; Michael Bowling (AAMAS, 2021)

From Poincaré Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization. - Julien Pérolat; Rémi Munos; Jean-Baptiste Lespiau; Shayegan Omidshafiei; Mark Rowland 001; Pedro A. Ortega; Neil Burch; Thomas W. Anthony 001; David Balduzzi; Bart De Vylder; Georgios Piliouras; Marc Lanctot; et al. (ICML, 2021)

Player of Games. - Martin Schmid; Matej Moravcik; Neil Burch; Rudolf Kadlec; Joshua Davidson; Kevin Waugh; Nolan Bard; Finbarr Timbers; Marc Lanctot; G. Zacharias Holland; Elnaz Davoodi; Alden Christianson; et al. (CoRR, 2021)

Approximate Exploitability: Learning a Best Response. - Finbarr Timbers; Nolan Bard; Edward Lockhart; Marc Lanctot; Martin Schmid; Neil Burch; Julian Schrittwieser; Thomas Hubert; Michael Bowling (IJCAI, 2022)

Rethinking formal models of partially observable multiagent decision making. - Vojtech Kovarík; Martin Schmid; Neil Burch; Michael Bowling; Viliam Lisý (Artif. Intell., 2022)

Mastering the Game of Stratego with Model-Free Multiagent Reinforcement Learning. - Julien Pérolat; Bart De Vylder; Daniel Hennes; Eugene Tarassov; Florian Strub; Vincent de Boer; Paul Muller; Jerome T. Connor; Neil Burch; Thomas W. Anthony 001; Stephen McAleer; Romuald Elie; et al. (CoRR, 2022)

Figure Data for the paper "Mastering the Game of Stratego with Model-Free Multiagent Reinforcement Learning". - Julien Pérolat; Bart De Vylder; Daniel Hennes; Eugene Tarassov; Florian Strub; Vincent de Boer; Paul Muller; Jerome T. Connor; Neil Burch; Thomas Anthony 001; Stephen McAleer; Romuald Elie; et al. (Zenodo, 2022)

Rethinking Formal Models of Partially Observable Multiagent Decision Making (Extended Abstract). - Vojtech Kovarík; Martin Schmid; Neil Burch; Michael Bowling; Viliam Lisý (IJCAI, 2023)

Population-based Evaluation in Repeated Rock-Paper-Scissors as a Benchmark for Multiagent Reinforcement Learning. - Marc Lanctot; John Schultz; Neil Burch; Max Olan Smith; Daniel Hennes; Thomas Anthony 001; Julien Pérolat (Trans. Mach. Learn. Res., 2023)

Look-ahead Search on Top of Policy Networks in Imperfect Information Games. - Ondrej Kubícek; Neil Burch; Viliam Lisý (IJCAI, 2024)