<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Unified Game-Theoretic Approach to Multiagent Reinforcement Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1711.00832/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1711.00832/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Unified Game-Theoretic Approach to Multiagent Reinforcement Learning — mentioned by Cybiote</title><link>https://news.ycombinator.com/item?id=15860833</link><guid isPermaLink="false">urn:hackerpapers:mention:1711.00832:15860833</guid><pubDate>Wed, 06 Dec 2017 13:19:07 GMT</pubDate><description>&lt;p&gt;Correction to the above: I stated Deepmind applied Neural Nets+MCTS and achieved ok results. I was actually misremembering two David Silver (Deepmind) papers as one. Smooth UCT modified UCT (popular brand of MCTS) to be able to handle imperfect information games. MCTS does not converge under imperfect information. Smooth UCT is strong at limit poker. Limit is much simpler than no-limit. Neural Fictitious Self Play based on fictitious play (invented 1950s), is an approach to reinforcement learning using neural nets for function approximation. Typical RL methods like DQN are highly exploitable.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1711.00832/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
