<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Revisiting Game Representations: The Hidden Costs of Efficiency in Sequential Decision-making Algorithms · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2112.10890/</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/2112.10890/feed.xml" rel="self" type="application/rss+xml" /><item><title>Revisiting Game Representations: The Hidden Costs of Efficiency in Sequential Decision-making Algorithms — mentioned by michalsustr</title><link>https://news.ycombinator.com/item?id=29987134</link><guid isPermaLink="false">urn:hackerpapers:mention:2112.10890:29987134</guid><pubDate>Tue, 18 Jan 2022 22:39:36 GMT</pubDate><description>&lt;p&gt;Interesting! We have very recently wrote a paper on the various tree representations [1]. Maybe it is the same distinction you found on your own? I judge this based on the screenshots on your website. Public state trees are amenable to nice factorization over the hands, and indeed most implementations use it, but formally they write they use the history tree notation. [1] https://arxiv.org/abs/2112.10890&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2112.10890/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.GT</category></item></channel></rss>
