We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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 Equilibrium in two-player zero-sum games and to an extensive-form coarse correlated equilibrium in all other games. Our primary innovation is an effective algorithm that, in contrast to other regret-based deep learning algorithms, does not require access to a perfect simulator of the game to achieve good performance. We show that DREAM empirically achieves state-of-the-art performance among model-free algorithms in popular benchmark games, and is even competitive with algorithms that do use a perfect simulator.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.10410")
get_code_for_paper("2006.10410")
have("2006.10410")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.10410.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.10410)
Connect an agent — have() is free.