2 papers
cs.LG2020
DREAM: Deep Regret minimization with Advantage baselines and Model-free learning
Eric Steinberger, Adam Lerer, Noam Brown
We introduce DREAM, a deep reinforcement learning algorithm that finds optimal strategies in imperfect-information games with multiple agents. Formally, DREAM converges to a Nash E…
cs.GT2019
Single Deep Counterfactual Regret Minimization
Eric Steinberger
Counterfactual Regret Minimization (CFR) is the most successful algorithm for finding approximate Nash equilibria in imperfect information games. However, CFR's reliance on full ga…