Continual Depth-limited Responses for Computing Counter-strategies in Sequential Games

Safe strategies for agent modelling in games. In AAAI Fall Symposium on Artificial Multi-agent Learning . 103–110

Peter McCracken and Michael Bowling. 2004 · 2004

Earlier work this paper cites.

Computing robust counter-strategies. In Advances in neural information processing systems . 721–728

Michael Johanson, Martin Zinkevich, and Michael Bowling. 2008 · 2008

Earlier work this paper cites.

Regret minimization in games with incomplete information. In Advances in Neural Information Processing Systems . 1729–1736

Martin Zinkevich, Michael Johanson, Michael Bowling, and Carmelo Piccione. 2008 · 2008

Earlier work this paper cites.

Data biased robust counter strategies. In Artificial Intelligence and Statistics . 264–271

Michael Johanson and Michael Bowling. 2009 · 2009

Earlier work this paper cites.

Bayes’ bluff: Opponent modelling in poker

Original

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

Earlier work this paper cites.

Online implicit agent modelling. In Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems . 255–262

Nolan Bard, Michael Johanson, Neil Burch, and Michael Bowling. 2013 · 2013

Earlier work this paper cites.

Bayesian poker

Original

Kevin B Korb, Ann Nicholson, and Nathalie Jitnah. 2013 · 2013

Earlier work this paper cites.

Solving imperfect information games using decomposition. In Twenty-eighth AAAI conference on artificial intelligence

Neil Burch, Michael Johanson, and Michael Bowling. 2014 · 2014

Earlier work this paper cites.

Using response functions to measure strategy strength. In Twenty-Eighth AAAI Conference on Artificial Intelligence

Trevor Davis, Neil Burch, and Michael Bowling. 2014 · 2014

Earlier work this paper cites.

Safe opponent exploitation

Sam Ganzfried and Tuomas Sandholm. 2015 · 2015

Cited alongside, same era.

Opponent modeling by expectation–maximization and sequence prediction in simplified poker

Richard Mealing and Jonathan L Shapiro. 2015 · 2015

Cited alongside, same era.

Refining subgames in large imperfect information games. In Proceedings of the AAAI Conference on Artificial Intelligence , Vol. 30

Matej Moravcik, Martin Schmid, Karel Ha, Milan Hladik, and Stephen Gaukrodger. 2016 · 2016

Cited alongside, same era.

Safe and nested endgame solving for imperfect-information games. In Workshops at the thirty-first AAAI conference on artificial intelligence

Noam Brown and Tuomas Sandholm. 2017 · 2017

Cited alongside, same era.

Targeted cfr. In Workshops at the thirty-first AAAI conference on artificial intelligence

Eric Griffin Jackson. 2017 · 2017

Cited alongside, same era.

Computing Approximate Equilibria in Sequential Adversarial Games by Exploitability Descent. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19 . 464–470

Edward Lockhart, Marc Lanctot, Julien Pérolat, Jean-Baptiste Lespiau, Dustin Morrill, Finbarr TImbers, and Karl Tuyls. 2019 · 2019

Later among the works it cites.

Approximate exploitability: Learning a best response in large games

Original

Finbarr Timbers, Edward Lockhart, Marc Lanctot, Martin Schmid, Julian Schrittwieser, Thomas Hubert, and Michael Bowling. 2020 · 2020

Later among the works it cites.

Unlocking the potential of deep counterfactual value networks

Original

Ryan Zarick, Bryan Pellegrino, Noam Brown, and Caleb Banister. 2020 · 2020

Later among the works it cites.

Complexity and Algorithms for Exploiting Quantal Opponents in Large Two-Player Games. In Proceedings of the AAAI Conference on Artificial Intelligence , Vol. 35. 5575–5583

David Milec, Jakub Černý, Viliam Lisý, and Bo An. 2021 · 2021

Closest in time.