Search Results for author:
Found 2 papers, 2 papers with code
DREAM: Deep Regret minimization with Advantage baselines and Model-free learning
We introduce DREAM, a deep reinforcement learning algorithm that finds optimal strategies in imperfect-information games with multiple agents.
Single Deep Counterfactual Regret Minimization
Counterfactual Regret Minimization (CFR) is the most successful algorithm for finding approximate Nash equilibria in imperfect information games.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
