<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Open Loop In Natura Economic Planning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2005.01539/</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/2005.01539/feed.xml" rel="self" type="application/rss+xml" /><item><title>Open Loop In Natura Economic Planning — mentioned by mjn</title><link>https://news.ycombinator.com/item?id=27730942</link><guid isPermaLink="false">urn:hackerpapers:mention:2005.01539:27730942</guid><pubDate>Sun, 04 Jul 2021 16:46:01 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s simple compared to modern machine learning, but linear programming [1] was initially developed by Leonid Kantorovich partly with the goal of automating central planning. Most of his ideas weren&amp;#x27;t implemented in practice though. Here&amp;#x27;s a recent paper surveying some of that work and how one might approach the central allocation problem with the benefit of modern techniques: https://arxiv.org/abs/2005.01539 [1] https://en.wikipedia.org/wiki/Linear_programming&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2005.01539/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CY</category></item></channel></rss>
