<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Compositional game theory · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1603.04641/</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/1603.04641/feed.xml" rel="self" type="application/rss+xml" /><item><title>Compositional game theory — mentioned by bts</title><link>https://news.ycombinator.com/item?id=43839427</link><guid isPermaLink="false">urn:hackerpapers:mention:1603.04641:43839427</guid><pubDate>Tue, 29 Apr 2025 23:45:20 GMT</pubDate><description>&lt;p&gt;Indeed they call for new names, as they encompass far more than iterators. If you read a bit more about them, I think you will be surprised to see the breadth of what these abstractions can be used for. To start, they&amp;#x27;ve been used to build a new compositional foundation for game theory[1], and they can be used to model gradient-based learning in machine learning[2]. As for their simpler applications as getters and setters, they are programmable in the sense that you can think of lens/prism types as interfaces that can be implemented arbitrarily. So you can create your own lenses and combine…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1603.04641/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.GT</category></item><item><title>Compositional game theory — mentioned by cookiengineer</title><link>https://news.ycombinator.com/item?id=35335034</link><guid isPermaLink="false">urn:hackerpapers:mention:1603.04641:35335034</guid><pubDate>Tue, 28 Mar 2023 02:22:11 GMT</pubDate><description>&lt;p&gt;&amp;gt; computational category theory There&amp;#x27;s also the compositional game theory which is based on it: https://arxiv.org/abs/1603.04641&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1603.04641/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.GT</category></item><item><title>Compositional game theory — mentioned by cookiengineer</title><link>https://news.ycombinator.com/item?id=28345040</link><guid isPermaLink="false">urn:hackerpapers:mention:1603.04641:28345040</guid><pubDate>Sun, 29 Aug 2021 08:12:23 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m working on a prototype that uses the compositional game theory [1] and adapts it to be able to reliably predict the order complexity of functors and their differences between states. A huge bonus there would be when the order difference can be represented in a graph, so that tesselation or other approaches like a hypercube representation can be used for quick estimations. (that&amp;#x27;s what I&amp;#x27;m aiming for right now) If successful, the next step would be to integrate it into my web browser so that I can try out whether the equilibrium works as expected on some niche topics or forums. [1]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1603.04641/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.GT</category></item><item><title>Compositional game theory — HN submission</title><link>https://news.ycombinator.com/item?id=26385311</link><guid isPermaLink="false">urn:hackerpapers:submission:1603.04641:26385311</guid><pubDate>Mon, 08 Mar 2021 13:12:06 GMT</pubDate><description>&lt;p&gt;Compositional Game Theory&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1603.04641/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.GT</category></item></channel></rss>
