Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox
Picture for Neil Burch

Neil Burch

Solving Common-Payoff Games with Approximate Policy Iteration


Jan 11, 2021
Samuel Sokota, Edward Lockhart, Finbarr Timbers, Elnaz Davoodi, Ryan D'Orazio, Neil Burch, Martin Schmid, Michael Bowling, Marc Lanctot

Figure 1 for Solving Common-Payoff Games with Approximate Policy Iteration
Figure 2 for Solving Common-Payoff Games with Approximate Policy Iteration
Figure 3 for Solving Common-Payoff Games with Approximate Policy Iteration
Figure 4 for Solving Common-Payoff Games with Approximate Policy Iteration
* AAAI 2021 
  Access Paper or Ask Questions

Human-Agent Cooperation in Bridge Bidding


Nov 28, 2020
Edward Lockhart, Neil Burch, Nolan Bard, Sebastian Borgeaud, Tom Eccles, Lucas Smaira, Ray Smith

Figure 1 for Human-Agent Cooperation in Bridge Bidding

  Access Paper or Ask Questions

From Poincaré Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization


Feb 19, 2020
Julien Perolat, Remi Munos, Jean-Baptiste Lespiau, Shayegan Omidshafiei, Mark Rowland, Pedro Ortega, Neil Burch, Thomas Anthony, David Balduzzi, Bart De Vylder, Georgios Piliouras, Marc Lanctot, Karl Tuyls

Figure 1 for From Poincaré Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization
Figure 2 for From Poincaré Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization
Figure 3 for From Poincaré Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization
Figure 4 for From Poincaré Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization
* 43 pages 
  Access Paper or Ask Questions

Rethinking Formal Models of Partially Observable Multiagent Decision Making


Jun 26, 2019
Vojtěch Kovařík, Martin Schmid, Neil Burch, Michael Bowling, Viliam Lisý

Figure 1 for Rethinking Formal Models of Partially Observable Multiagent Decision Making
Figure 2 for Rethinking Formal Models of Partially Observable Multiagent Decision Making
Figure 3 for Rethinking Formal Models of Partially Observable Multiagent Decision Making
Figure 4 for Rethinking Formal Models of Partially Observable Multiagent Decision Making

  Access Paper or Ask Questions

The Hanabi Challenge: A New Frontier for AI Research


Feb 01, 2019
Nolan Bard, Jakob N. Foerster, Sarath Chandar, Neil Burch, Marc Lanctot, H. Francis Song, Emilio Parisotto, Vincent Dumoulin, Subhodeep Moitra, Edward Hughes, Iain Dunning, Shibl Mourad, Hugo Larochelle, Marc G. Bellemare, Michael Bowling

Figure 1 for The Hanabi Challenge: A New Frontier for AI Research
Figure 2 for The Hanabi Challenge: A New Frontier for AI Research
Figure 3 for The Hanabi Challenge: A New Frontier for AI Research
Figure 4 for The Hanabi Challenge: A New Frontier for AI Research
* 37 pages, 5 figures, submitted to Artificial Intelligence 
  Access Paper or Ask Questions

Bayesian Action Decoder for Deep Multi-Agent Reinforcement Learning


Nov 04, 2018
Jakob N. Foerster, Francis Song, Edward Hughes, Neil Burch, Iain Dunning, Shimon Whiteson, Matthew Botvinick, Michael Bowling

Figure 1 for Bayesian Action Decoder for Deep Multi-Agent Reinforcement Learning
Figure 2 for Bayesian Action Decoder for Deep Multi-Agent Reinforcement Learning
Figure 3 for Bayesian Action Decoder for Deep Multi-Agent Reinforcement Learning
Figure 4 for Bayesian Action Decoder for Deep Multi-Agent Reinforcement Learning

  Access Paper or Ask Questions

Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games using Baselines


Sep 09, 2018
Martin Schmid, Neil Burch, Marc Lanctot, Matej Moravcik, Rudolf Kadlec, Michael Bowling

Figure 1 for Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games using Baselines
Figure 2 for Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games using Baselines
Figure 3 for Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games using Baselines
Figure 4 for Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games using Baselines

  Access Paper or Ask Questions

DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker


Mar 03, 2017
Matej Moravčík, Martin Schmid, Neil Burch, Viliam Lisý, Dustin Morrill, Nolan Bard, Trevor Davis, Kevin Waugh, Michael Johanson, Michael Bowling


  Access Paper or Ask Questions

AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games


Jan 19, 2017
Neil Burch, Martin Schmid, Matej Moravčík, Michael Bowling

Figure 1 for AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games
Figure 2 for AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games
Figure 3 for AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games
Figure 4 for AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games
* To appear at AAAI-17 Workshop on Computer Poker and Imperfect Information Games 
  Access Paper or Ask Questions

Predicting the Performance of IDA* using Conditional Distributions


Jan 15, 2014
Uzi Zahavi, Ariel Felner, Neil Burch, Robert C. Holte

Figure 1 for Predicting the Performance of IDA* using Conditional Distributions
Figure 2 for Predicting the Performance of IDA* using Conditional Distributions
Figure 3 for Predicting the Performance of IDA* using Conditional Distributions
Figure 4 for Predicting the Performance of IDA* using Conditional Distributions
* Journal Of Artificial Intelligence Research, Volume 37, pages 41-83, 2010 
  Access Paper or Ask Questions

Bayes' Bluff: Opponent Modelling in Poker


Jul 04, 2012
Finnegan Southey, Michael P. Bowling, Bryce Larson, Carmelo Piccione, Neil Burch, Darse Billings, Chris Rayner

Figure 1 for Bayes' Bluff: Opponent Modelling in Poker
Figure 2 for Bayes' Bluff: Opponent Modelling in Poker
Figure 3 for Bayes' Bluff: Opponent Modelling in Poker
Figure 4 for Bayes' Bluff: Opponent Modelling in Poker
* Appears in Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (UAI2005) 
  Access Paper or Ask Questions

No-Regret Learning in Extensive-Form Games with Imperfect Recall


May 03, 2012
Marc Lanctot, Richard Gibson, Neil Burch, Martin Zinkevich, Michael Bowling

Figure 1 for No-Regret Learning in Extensive-Form Games with Imperfect Recall
Figure 2 for No-Regret Learning in Extensive-Form Games with Imperfect Recall
Figure 3 for No-Regret Learning in Extensive-Form Games with Imperfect Recall
* 21 pages, 4 figures, expanded version of article to appear in Proceedings of the Twenty-Ninth International Conference on Machine Learning 
  Access Paper or Ask Questions