8 citations · 18 across the 5 of their papers we have counts for
4 papers · 1 filter
Emergent Bartering Behaviour in Multi-Agent Reinforcement Learning
Michael Bradley Johanson, Edward Hughes, Finbarr Timbers +1
Advances in artificial intelligence often stem from the development of new environments that abstract real-world situations into a form where research can be done conveniently. Thi…
Solving Common-Payoff Games with Approximate Policy Iteration
Samuel Sokota, Edward Lockhart, Finbarr Timbers +6
For artificially intelligent learning systems to have widespread applicability in real-world settings, it is important that they be able to operate decentrally. Unfortunately, dece…
The Advantage Regret-Matching Actor-Critic
Audrūnas Gruslys, Marc Lanctot, Rémi Munos +10
Regret minimization has played a key role in online learning, equilibrium computation in games, and reinforcement learning (RL). In this paper, we describe a general model-free RL…
Computing Approximate Equilibria in Sequential Adversarial Games by Exploitability Descent
Edward Lockhart, Marc Lanctot, Julien Pérolat +4
In this paper, we present exploitability descent, a new algorithm to compute approximate equilibria in two-player zero-sum extensive-form games with imperfect information, by direc…