no code implementations • 17 Aug 2023 • Tom Zahavy, Vivek Veeriah, Shaobo Hou, Kevin Waugh, Matthew Lai, Edouard Leurent, Nenad Tomasev, Lisa Schut, Demis Hassabis, Satinder Singh
In particular, we investigate whether a team of diverse AI systems can outperform a single AI in challenging tasks by generating more ideas as a group and then selecting the best ones.
no code implementations • 6 Dec 2021 • Martin Schmid, Matej Moravcik, Neil Burch, Rudolf Kadlec, Josh Davidson, Kevin Waugh, Nolan Bard, Finbarr Timbers, Marc Lanctot, G. Zacharias Holland, Elnaz Davoodi, Alden Christianson, Michael Bowling
Games have a long history as benchmarks for progress in artificial intelligence.
no code implementations • 20 Sep 2018 • Trevor Davis, Kevin Waugh, Michael Bowling
Extensive-form games are a common model for multiagent interactions with imperfect information.
no code implementations • 16 Feb 2017 • Christian Kroer, Kevin Waugh, Fatma Kilinc-Karzan, Tuomas Sandholm
By introducing a new weighting scheme for the dilated entropy function, we develop the first distance-generating function for the strategy spaces of sequential games that has no dependence on the branching factor of the player.
1 code implementation • 6 Jan 2017 • Matej Moravčík, Martin Schmid, Neil Burch, Viliam Lisý, Dustin Morrill, Nolan Bard, Trevor Davis, Kevin Waugh, Michael Johanson, Michael Bowling
Poker is the quintessential game of imperfect information, and a longstanding challenge problem in artificial intelligence.
no code implementations • 28 Nov 2014 • Kevin Waugh, Dustin Morrill, J. Andrew Bagnell, Michael Bowling
We propose a novel online learning method for minimizing regret in large extensive-form games.
no code implementations • 18 Nov 2014 • Kevin Waugh, J. Andrew Bagnell
The task of computing approximate Nash equilibria in large zero-sum extensive-form games has received a tremendous amount of attention due mainly to the Annual Computer Poker Competition.
no code implementations • 15 Aug 2013 • Kevin Waugh, Brian D. Ziebart, J. Andrew Bagnell
Modeling the purposeful behavior of imperfect agents from a small number of observations is a challenging task.
1 code implementation • NeurIPS 2009 • Marc Lanctot, Kevin Waugh, Martin Zinkevich, Michael Bowling
In the domain of poker, CFR has proven effective, particularly when using a domain-specific augmentation involving chance outcome sampling.
no code implementations • NeurIPS 2009 • Kevin Waugh, Nolan Bard, Michael Bowling
A common approach for computing strategies in these large games is to first employ an abstraction technique to reduce the original game to an abstract game that is of a manageable size.