activity
20172026
most citedMastering Atari, Go, Chess and Shogi by Planning with a Learned Model

1.2k citations · 2.3k across the 12 of their papers we have counts for

collaborators
Showing cs.AIShow all

5 papers · 1 filter

cs.AI2026

LEAP: Supercharging LLMs for Formal Mathematics with Agentic Frameworks

Po-Nien Kung, Linfeng Song, Dawsen Hwang +10

Large Language Models (LLMs) exhibit strong informal mathematical reasoning but struggle to generate mechanically verifiable proofs in formal languages like Lean. We present LEAP,…

cs.AI2022★ 153 cited

Mastering the Game of Stratego with Model-Free Multiagent Reinforcement Learning

Julien Perolat, Bart de Vylder, Daniel Hennes +31

We introduce DeepNash, an autonomous agent capable of learning to play the imperfect information game Stratego from scratch, up to a human expert level. Stratego is one of the few…

cs.AI2021

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…

cs.AI2020★ 5 cited

Human-Agent Cooperation in Bridge Bidding

Edward Lockhart, Neil Burch, Nolan Bard +4

We introduce a human-compatible reinforcement-learning approach to a cooperative game, making use of a third-party hand-coded human-compatible bot to generate initial training data…

cs.AI2019

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…